java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:46:25,099 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:46:25,100 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:46:25,110 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:46:25,110 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:46:25,111 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:46:25,112 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:46:25,113 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:46:25,115 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:46:25,115 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:46:25,116 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:46:25,116 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:46:25,116 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:46:25,117 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:46:25,118 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:46:25,119 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:46:25,121 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:46:25,122 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:46:25,123 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:46:25,124 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:46:25,126 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:46:25,126 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:46:25,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:46:25,127 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:46:25,128 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:46:25,129 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:46:25,129 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:46:25,129 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:46:25,130 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:46:25,130 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:46:25,130 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:46:25,130 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 18:46:25,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:46:25,140 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:46:25,141 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:46:25,141 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:46:25,141 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:46:25,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:46:25,142 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:46:25,142 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:46:25,142 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:46:25,142 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:46:25,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:46:25,143 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:46:25,143 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:46:25,143 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:46:25,143 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:46:25,143 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:46:25,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:46:25,144 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:46:25,144 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:46:25,144 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:46:25,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:46:25,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:46:25,144 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:46:25,145 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:46:25,145 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:46:25,173 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:46:25,186 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:46:25,191 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:46:25,192 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:46:25,193 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:46:25,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i [2018-02-02 18:46:25,343 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:46:25,345 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:46:25,345 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:46:25,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:46:25,351 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:46:25,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:46:25" (1/1) ... [2018-02-02 18:46:25,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece180a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:46:25, skipping insertion in model container [2018-02-02 18:46:25,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:46:25" (1/1) ... [2018-02-02 18:46:25,367 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:46:25,411 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:46:25,494 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:46:25,511 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:46:25,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:46:25 WrapperNode [2018-02-02 18:46:25,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:46:25,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:46:25,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:46:25,520 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:46:25,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:46:25" (1/1) ... [2018-02-02 18:46:25,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:46:25" (1/1) ... [2018-02-02 18:46:25,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:46:25" (1/1) ... [2018-02-02 18:46:25,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:46:25" (1/1) ... [2018-02-02 18:46:25,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:46:25" (1/1) ... [2018-02-02 18:46:25,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:46:25" (1/1) ... [2018-02-02 18:46:25,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:46:25" (1/1) ... [2018-02-02 18:46:25,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:46:25,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:46:25,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:46:25,549 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:46:25,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:46:25" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:46:25,581 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:46:25,581 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:46:25,581 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-02 18:46:25,581 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-02 18:46:25,581 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-02 18:46:25,581 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-02 18:46:25,581 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-02 18:46:25,581 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-02 18:46:25,582 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-02 18:46:25,582 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-02 18:46:25,582 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-02 18:46:25,582 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-02 18:46:25,582 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-02 18:46:25,582 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-02 18:46:25,582 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:46:25,582 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:46:25,582 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:46:25,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:46:25,583 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:46:25,583 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:46:25,583 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 18:46:25,583 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 18:46:25,583 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 18:46:25,583 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:46:25,583 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 18:46:25,583 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 18:46:25,584 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-02 18:46:25,584 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:46:25,584 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-02 18:46:25,584 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-02 18:46:25,584 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-02 18:46:25,584 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-02 18:46:25,584 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-02 18:46:25,584 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-02 18:46:25,585 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-02 18:46:25,585 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-02 18:46:25,585 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-02 18:46:25,585 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-02 18:46:25,585 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-02 18:46:25,585 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:46:25,585 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:46:25,586 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:46:25,826 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 18:46:26,018 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:46:26,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:46:26 BoogieIcfgContainer [2018-02-02 18:46:26,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:46:26,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:46:26,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:46:26,021 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:46:26,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:46:25" (1/3) ... [2018-02-02 18:46:26,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799dc3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:46:26, skipping insertion in model container [2018-02-02 18:46:26,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:46:25" (2/3) ... [2018-02-02 18:46:26,022 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799dc3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:46:26, skipping insertion in model container [2018-02-02 18:46:26,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:46:26" (3/3) ... [2018-02-02 18:46:26,023 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0237_true-valid-memsafety.i [2018-02-02 18:46:26,029 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:46:26,034 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 83 error locations. [2018-02-02 18:46:26,057 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:46:26,057 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:46:26,057 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:46:26,057 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:46:26,057 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:46:26,057 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:46:26,057 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:46:26,057 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:46:26,058 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:46:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states. [2018-02-02 18:46:26,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 18:46:26,076 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:46:26,077 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 18:46:26,077 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:46:26,080 INFO L82 PathProgramCache]: Analyzing trace with hash 12677088, now seen corresponding path program 1 times [2018-02-02 18:46:26,081 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:46:26,081 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:46:26,110 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:26,111 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:46:26,111 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:46:26,139 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:46:26,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:46:26,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:46:26,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:46:26,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:46:26,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:46:26,179 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:46:26,180 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 3 states. [2018-02-02 18:46:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:46:26,416 INFO L93 Difference]: Finished difference Result 279 states and 298 transitions. [2018-02-02 18:46:26,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:46:26,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 18:46:26,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:46:26,429 INFO L225 Difference]: With dead ends: 279 [2018-02-02 18:46:26,429 INFO L226 Difference]: Without dead ends: 276 [2018-02-02 18:46:26,431 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:46:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-02 18:46:26,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 245. [2018-02-02 18:46:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-02 18:46:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 260 transitions. [2018-02-02 18:46:26,477 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 260 transitions. Word has length 4 [2018-02-02 18:46:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:46:26,477 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 260 transitions. [2018-02-02 18:46:26,478 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:46:26,478 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 260 transitions. [2018-02-02 18:46:26,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 18:46:26,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:46:26,478 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 18:46:26,478 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:46:26,478 INFO L82 PathProgramCache]: Analyzing trace with hash 12677089, now seen corresponding path program 1 times [2018-02-02 18:46:26,479 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:46:26,479 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:46:26,479 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:26,480 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:46:26,480 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:46:26,494 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:46:26,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:46:26,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:46:26,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:46:26,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:46:26,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:46:26,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:46:26,529 INFO L87 Difference]: Start difference. First operand 245 states and 260 transitions. Second operand 3 states. [2018-02-02 18:46:26,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:46:26,645 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2018-02-02 18:46:26,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:46:26,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 18:46:26,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:46:26,647 INFO L225 Difference]: With dead ends: 252 [2018-02-02 18:46:26,647 INFO L226 Difference]: Without dead ends: 252 [2018-02-02 18:46:26,648 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:46:26,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-02 18:46:26,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 244. [2018-02-02 18:46:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 18:46:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 259 transitions. [2018-02-02 18:46:26,664 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 259 transitions. Word has length 4 [2018-02-02 18:46:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:46:26,664 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 259 transitions. [2018-02-02 18:46:26,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:46:26,664 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 259 transitions. [2018-02-02 18:46:26,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 18:46:26,665 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:46:26,665 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:46:26,665 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:46:26,665 INFO L82 PathProgramCache]: Analyzing trace with hash -144742640, now seen corresponding path program 1 times [2018-02-02 18:46:26,665 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:46:26,665 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:46:26,666 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:26,666 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:46:26,666 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:26,681 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:46:26,682 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:46:26,682 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2018-02-02 18:46:26,690 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:46:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:46:26,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:46:26,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:46:26,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:26,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:46:26,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 18:46:26,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:46:26,780 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:46:26,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:46:26,781 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:46:26,781 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:46:26,781 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:46:26,781 INFO L87 Difference]: Start difference. First operand 244 states and 259 transitions. Second operand 4 states. [2018-02-02 18:46:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:46:26,931 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2018-02-02 18:46:26,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:46:26,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 18:46:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:46:26,932 INFO L225 Difference]: With dead ends: 243 [2018-02-02 18:46:26,933 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 18:46:26,933 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:46:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 18:46:26,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-02-02 18:46:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-02 18:46:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 258 transitions. [2018-02-02 18:46:26,942 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 258 transitions. Word has length 17 [2018-02-02 18:46:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:46:26,942 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 258 transitions. [2018-02-02 18:46:26,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:46:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 258 transitions. [2018-02-02 18:46:26,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 18:46:26,943 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:46:26,943 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:46:26,943 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:46:26,943 INFO L82 PathProgramCache]: Analyzing trace with hash -144742639, now seen corresponding path program 1 times [2018-02-02 18:46:26,943 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:46:26,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:46:26,944 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:26,944 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:46:26,944 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:26,955 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:46:26,955 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:46:26,956 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:46:26,963 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:46:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:46:26,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:46:27,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-02-02 18:46:27,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:27,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-02 18:46:27,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:27,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:46:27,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-02 18:46:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:46:27,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:46:27,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:46:27,097 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:46:27,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:46:27,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:46:27,098 INFO L87 Difference]: Start difference. First operand 243 states and 258 transitions. Second operand 4 states. [2018-02-02 18:46:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:46:27,247 INFO L93 Difference]: Finished difference Result 242 states and 257 transitions. [2018-02-02 18:46:27,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:46:27,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 18:46:27,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:46:27,248 INFO L225 Difference]: With dead ends: 242 [2018-02-02 18:46:27,248 INFO L226 Difference]: Without dead ends: 242 [2018-02-02 18:46:27,249 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:46:27,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-02 18:46:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-02-02 18:46:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-02 18:46:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-02-02 18:46:27,257 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 17 [2018-02-02 18:46:27,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:46:27,257 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-02-02 18:46:27,257 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:46:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-02-02 18:46:27,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 18:46:27,261 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:46:27,261 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:46:27,261 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:46:27,261 INFO L82 PathProgramCache]: Analyzing trace with hash -515979882, now seen corresponding path program 1 times [2018-02-02 18:46:27,261 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:46:27,262 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:46:27,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:27,263 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:46:27,263 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:27,280 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:46:27,280 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:46:27,280 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:46:27,290 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:46:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:46:27,385 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:46:27,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:46:27,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:27,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:46:27,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 18:46:27,464 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1)))) is different from true [2018-02-02 18:46:27,467 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:27,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-02 18:46:27,469 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:27,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:46:27,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 18:46:27,477 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~0.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~0.base_BEFORE_CALL_1))) (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1))))) is different from true [2018-02-02 18:46:27,507 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:27,508 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:46:27,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 18:46:27,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:27,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:46:27,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-02 18:46:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 9 not checked. [2018-02-02 18:46:27,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:46:27,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 18:46:27,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:46:27,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:46:27,600 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-02 18:46:27,600 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 15 states. [2018-02-02 18:46:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:46:28,212 INFO L93 Difference]: Finished difference Result 267 states and 287 transitions. [2018-02-02 18:46:28,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:46:28,212 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-02 18:46:28,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:46:28,214 INFO L225 Difference]: With dead ends: 267 [2018-02-02 18:46:28,214 INFO L226 Difference]: Without dead ends: 267 [2018-02-02 18:46:28,214 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=313, Unknown=2, NotChecked=74, Total=462 [2018-02-02 18:46:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-02 18:46:28,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 238. [2018-02-02 18:46:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-02 18:46:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 253 transitions. [2018-02-02 18:46:28,221 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 253 transitions. Word has length 142 [2018-02-02 18:46:28,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:46:28,222 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 253 transitions. [2018-02-02 18:46:28,222 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:46:28,222 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 253 transitions. [2018-02-02 18:46:28,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 18:46:28,224 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:46:28,224 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:46:28,227 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:46:28,227 INFO L82 PathProgramCache]: Analyzing trace with hash -515979881, now seen corresponding path program 1 times [2018-02-02 18:46:28,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:46:28,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:46:28,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:28,229 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:46:28,229 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:28,242 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:46:28,242 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:46:28,242 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:46:28,250 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:46:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:46:28,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:46:28,446 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-02 18:46:28,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:46:28,467 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:46:28,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:46:28,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:46:28,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:46:28,468 INFO L87 Difference]: Start difference. First operand 238 states and 253 transitions. Second operand 8 states. [2018-02-02 18:46:28,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:46:28,575 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2018-02-02 18:46:28,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:46:28,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-02 18:46:28,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:46:28,580 INFO L225 Difference]: With dead ends: 248 [2018-02-02 18:46:28,580 INFO L226 Difference]: Without dead ends: 239 [2018-02-02 18:46:28,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:46:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-02 18:46:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-02-02 18:46:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-02 18:46:28,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 254 transitions. [2018-02-02 18:46:28,586 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 254 transitions. Word has length 142 [2018-02-02 18:46:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:46:28,586 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 254 transitions. [2018-02-02 18:46:28,586 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:46:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2018-02-02 18:46:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 18:46:28,588 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:46:28,588 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:46:28,588 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:46:28,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1585380729, now seen corresponding path program 1 times [2018-02-02 18:46:28,588 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:46:28,588 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:46:28,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:28,589 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:46:28,589 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:28,601 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:46:28,601 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:46:28,601 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:46:28,613 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:46:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:46:28,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:46:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 105 proven. 1 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-02-02 18:46:29,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:46:29,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 18:46:29,049 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:46:29,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:46:29,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:46:29,049 INFO L87 Difference]: Start difference. First operand 239 states and 254 transitions. Second operand 9 states. [2018-02-02 18:46:29,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:46:29,195 INFO L93 Difference]: Finished difference Result 249 states and 264 transitions. [2018-02-02 18:46:29,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:46:29,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-02 18:46:29,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:46:29,197 INFO L225 Difference]: With dead ends: 249 [2018-02-02 18:46:29,197 INFO L226 Difference]: Without dead ends: 240 [2018-02-02 18:46:29,198 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:46:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-02 18:46:29,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2018-02-02 18:46:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 18:46:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 255 transitions. [2018-02-02 18:46:29,202 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 255 transitions. Word has length 148 [2018-02-02 18:46:29,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:46:29,203 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 255 transitions. [2018-02-02 18:46:29,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:46:29,203 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 255 transitions. [2018-02-02 18:46:29,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 18:46:29,204 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:46:29,204 INFO L351 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:46:29,205 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:46:29,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1111849367, now seen corresponding path program 2 times [2018-02-02 18:46:29,205 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:46:29,205 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:46:29,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:29,206 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:46:29,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:29,228 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:46:29,229 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:46:29,229 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:46:29,240 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:46:31,210 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:46:31,211 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:46:31,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:46:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 267 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-02 18:46:37,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:46:37,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 18:46:37,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:46:37,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:46:37,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=106, Unknown=3, NotChecked=0, Total=132 [2018-02-02 18:46:37,832 INFO L87 Difference]: Start difference. First operand 240 states and 255 transitions. Second operand 12 states. [2018-02-02 18:46:39,854 WARN L143 SmtUtils]: Spent 2006ms on a formula simplification that was a NOOP. DAG size: 19 [2018-02-02 18:46:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:46:52,627 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions. [2018-02-02 18:46:52,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 18:46:52,628 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 154 [2018-02-02 18:46:52,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:46:52,629 INFO L225 Difference]: With dead ends: 250 [2018-02-02 18:46:52,629 INFO L226 Difference]: Without dead ends: 241 [2018-02-02 18:46:52,629 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=43, Invalid=192, Unknown=5, NotChecked=0, Total=240 [2018-02-02 18:46:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-02-02 18:46:52,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-02-02 18:46:52,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-02 18:46:52,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 256 transitions. [2018-02-02 18:46:52,633 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 256 transitions. Word has length 154 [2018-02-02 18:46:52,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:46:52,633 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 256 transitions. [2018-02-02 18:46:52,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:46:52,633 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 256 transitions. [2018-02-02 18:46:52,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-02 18:46:52,635 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:46:52,635 INFO L351 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:46:52,635 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:46:52,635 INFO L82 PathProgramCache]: Analyzing trace with hash 668249593, now seen corresponding path program 3 times [2018-02-02 18:46:52,635 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:46:52,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:46:52,636 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:52,636 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:46:52,637 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:46:52,647 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:46:52,647 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:46:52,647 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:46:52,656 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 18:46:52,821 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-02 18:46:52,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:46:52,826 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:46:52,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-02-02 18:46:52,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:52,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-02-02 18:46:52,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:52,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-02-02 18:46:52,898 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:52,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-02-02 18:46:52,900 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:46:52,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:46:52,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-02 18:47:01,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-02-02 18:47:01,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:47:02,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-02 18:47:02,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:47:02,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-02 18:47:02,038 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:47:02,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-02-02 18:47:02,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:47:02,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-02 18:47:02,074 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-02 18:47:04,152 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((|v_calloc_model_#in~nmemb_BEFORE_CALL_6| Int) (v_calloc_model_~size_BEFORE_CALL_5 Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (and (<= (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_6| v_calloc_model_~size_BEFORE_CALL_5) 4294967296) 2147483647) (= (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) (mod (* v_calloc_model_~size_BEFORE_CALL_5 |v_calloc_model_#in~nmemb_BEFORE_CALL_6|) 4294967296)))) (exists ((v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int)) (and (< 2147483647 (mod (* v_prenex_25 v_prenex_26) 4294967296)) (= (mod (* v_prenex_26 v_prenex_25) 4294967296) (+ (select |c_#length| v_prenex_28) 4294967296))))) is different from true [2018-02-02 18:47:04,983 WARN L143 SmtUtils]: Spent 763ms on a formula simplification that was a NOOP. DAG size: 34 [2018-02-02 18:47:07,750 WARN L143 SmtUtils]: Spent 2726ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-02 18:47:08,990 WARN L143 SmtUtils]: Spent 1194ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-02 18:47:15,367 WARN L146 SmtUtils]: Spent 6321ms on a formula simplification. DAG size of input: 39 DAG size of output 37 [2018-02-02 18:47:15,739 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_38 Int) (v_prenex_34 Int)) (let ((.cse0 (mod v_prenex_34 4294967296))) (and (<= .cse0 3) (= (select |c_old(#valid)| v_prenex_38) 0) (< 2 .cse0) (= |c_#length| (store |c_old(#length)| v_prenex_38 .cse0)) (<= .cse0 2147483647)))) is different from true [2018-02-02 18:47:15,751 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:47:15,752 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:47:15,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 25 [2018-02-02 18:47:15,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:47:15,762 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:47:15,763 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:47:15,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 18:47:15,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:47:15,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:47:15,769 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:26 [2018-02-02 18:47:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 260 proven. 34 refuted. 0 times theorem prover too weak. 231 trivial. 6 not checked. [2018-02-02 18:47:15,853 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:47:15,854 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-02-02 18:47:15,854 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-02-02 18:47:15,854 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-02-02 18:47:15,854 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=682, Unknown=12, NotChecked=106, Total=870 [2018-02-02 18:47:15,854 INFO L87 Difference]: Start difference. First operand 241 states and 256 transitions. Second operand 30 states. [2018-02-02 18:47:22,492 WARN L146 SmtUtils]: Spent 384ms on a formula simplification. DAG size of input: 78 DAG size of output 40 [2018-02-02 18:47:24,661 WARN L146 SmtUtils]: Spent 2079ms on a formula simplification. DAG size of input: 79 DAG size of output 41 [2018-02-02 18:47:30,015 WARN L146 SmtUtils]: Spent 5028ms on a formula simplification. DAG size of input: 83 DAG size of output 48 [2018-02-02 18:47:39,364 WARN L146 SmtUtils]: Spent 4812ms on a formula simplification. DAG size of input: 76 DAG size of output 56 [2018-02-02 18:47:44,742 WARN L146 SmtUtils]: Spent 1159ms on a formula simplification. DAG size of input: 61 DAG size of output 41 [2018-02-02 18:47:53,054 WARN L146 SmtUtils]: Spent 8244ms on a formula simplification. DAG size of input: 83 DAG size of output 63 [2018-02-02 18:47:55,140 WARN L146 SmtUtils]: Spent 1941ms on a formula simplification. DAG size of input: 68 DAG size of output 48 [2018-02-02 18:48:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:06,619 INFO L93 Difference]: Finished difference Result 343 states and 383 transitions. [2018-02-02 18:48:06,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-02-02 18:48:06,619 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 160 [2018-02-02 18:48:06,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:06,621 INFO L225 Difference]: With dead ends: 343 [2018-02-02 18:48:06,621 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 18:48:06,622 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 54.0s TimeCoverageRelationStatistics Valid=259, Invalid=2487, Unknown=18, NotChecked=206, Total=2970 [2018-02-02 18:48:06,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 18:48:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 259. [2018-02-02 18:48:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-02-02 18:48:06,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 284 transitions. [2018-02-02 18:48:06,628 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 284 transitions. Word has length 160 [2018-02-02 18:48:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:06,629 INFO L432 AbstractCegarLoop]: Abstraction has 259 states and 284 transitions. [2018-02-02 18:48:06,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-02-02 18:48:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 284 transitions. [2018-02-02 18:48:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-02-02 18:48:06,631 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:06,631 INFO L351 BasicCegarLoop]: trace histogram [23, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:48:06,631 INFO L371 AbstractCegarLoop]: === Iteration 10 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:48:06,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1806440816, now seen corresponding path program 4 times [2018-02-02 18:48:06,631 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:06,631 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:06,632 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:06,632 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:48:06,632 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:06,641 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:48:06,641 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:48:06,641 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:48:06,650 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 18:48:09,284 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 18:48:09,285 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:48:09,292 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:48:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 429 proven. 22 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-02-02 18:48:09,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:48:09,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 18:48:09,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:48:09,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:48:09,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:48:09,411 INFO L87 Difference]: Start difference. First operand 259 states and 284 transitions. Second operand 12 states. [2018-02-02 18:48:09,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:09,555 INFO L93 Difference]: Finished difference Result 269 states and 294 transitions. [2018-02-02 18:48:09,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:48:09,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 165 [2018-02-02 18:48:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:09,557 INFO L225 Difference]: With dead ends: 269 [2018-02-02 18:48:09,557 INFO L226 Difference]: Without dead ends: 260 [2018-02-02 18:48:09,557 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:48:09,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-02-02 18:48:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2018-02-02 18:48:09,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-02-02 18:48:09,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2018-02-02 18:48:09,561 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 165 [2018-02-02 18:48:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:09,561 INFO L432 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2018-02-02 18:48:09,561 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:48:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2018-02-02 18:48:09,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-02-02 18:48:09,563 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:09,563 INFO L351 BasicCegarLoop]: trace histogram [28, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:48:09,563 INFO L371 AbstractCegarLoop]: === Iteration 11 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:48:09,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1924439207, now seen corresponding path program 5 times [2018-02-02 18:48:09,563 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:09,563 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:09,564 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:09,564 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:48:09,564 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:09,572 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:48:09,573 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:48:09,573 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:48:09,580 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 18:48:10,311 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-02-02 18:48:10,311 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:48:10,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:48:10,437 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 413 proven. 15 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-02-02 18:48:10,467 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:48:10,468 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 18:48:10,468 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 18:48:10,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 18:48:10,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:48:10,469 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand 13 states. [2018-02-02 18:48:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:48:10,605 INFO L93 Difference]: Finished difference Result 262 states and 277 transitions. [2018-02-02 18:48:10,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:48:10,605 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 170 [2018-02-02 18:48:10,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:48:10,606 INFO L225 Difference]: With dead ends: 262 [2018-02-02 18:48:10,606 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 18:48:10,606 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-02-02 18:48:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 18:48:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-02-02 18:48:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 18:48:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 259 transitions. [2018-02-02 18:48:10,610 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 259 transitions. Word has length 170 [2018-02-02 18:48:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:48:10,610 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 259 transitions. [2018-02-02 18:48:10,610 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 18:48:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 259 transitions. [2018-02-02 18:48:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-02 18:48:10,611 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:48:10,611 INFO L351 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:48:10,611 INFO L371 AbstractCegarLoop]: === Iteration 12 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:48:10,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1387949673, now seen corresponding path program 6 times [2018-02-02 18:48:10,612 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:48:10,612 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:48:10,612 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:10,612 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:48:10,613 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:48:10,620 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:48:10,620 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:48:10,621 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:48:10,627 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Received shutdown request... [2018-02-02 18:48:13,809 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-02 18:48:13,810 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:48:13,815 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:48:13,820 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-02 18:48:13,821 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:48:13,826 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:48:13,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:48:13 BoogieIcfgContainer [2018-02-02 18:48:13,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:48:13,827 INFO L168 Benchmark]: Toolchain (without parser) took 108482.99 ms. Allocated memory was 404.2 MB in the beginning and 682.1 MB in the end (delta: 277.9 MB). Free memory was 358.3 MB in the beginning and 591.9 MB in the end (delta: -233.6 MB). Peak memory consumption was 44.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:48:13,828 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 404.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:48:13,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.57 ms. Allocated memory is still 404.2 MB. Free memory was 358.3 MB in the beginning and 346.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-02-02 18:48:13,828 INFO L168 Benchmark]: Boogie Preprocessor took 28.80 ms. Allocated memory is still 404.2 MB. Free memory was 344.9 MB in the beginning and 343.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 18:48:13,828 INFO L168 Benchmark]: RCFGBuilder took 469.50 ms. Allocated memory is still 404.2 MB. Free memory was 343.6 MB in the beginning and 286.6 MB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 5.3 GB. [2018-02-02 18:48:13,829 INFO L168 Benchmark]: TraceAbstraction took 107807.08 ms. Allocated memory was 404.2 MB in the beginning and 682.1 MB in the end (delta: 277.9 MB). Free memory was 286.6 MB in the beginning and 591.9 MB in the end (delta: -305.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:48:13,830 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 404.2 MB. Free memory is still 364.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 174.57 ms. Allocated memory is still 404.2 MB. Free memory was 358.3 MB in the beginning and 346.3 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 28.80 ms. Allocated memory is still 404.2 MB. Free memory was 344.9 MB in the beginning and 343.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 469.50 ms. Allocated memory is still 404.2 MB. Free memory was 343.6 MB in the beginning and 286.6 MB in the end (delta: 57.0 MB). Peak memory consumption was 57.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 107807.08 ms. Allocated memory was 404.2 MB in the beginning and 682.1 MB in the end (delta: 277.9 MB). Free memory was 286.6 MB in the beginning and 591.9 MB in the end (delta: -305.3 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 874]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 874). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was analyzing trace of length 179 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 3. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 250 locations, 83 error locations. TIMEOUT Result, 107.7s OverallTime, 12 OverallIterations, 36 TraceHistogramMax, 67.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2543 SDtfs, 812 SDslu, 14200 SDs, 0 SdLazy, 6987 SolverSat, 184 SolverUnsat, 48 SolverUnknown, 0 SolverNotchecked, 30.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1167 GetRequests, 1020 SyntacticMatches, 5 SemanticMatches, 142 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 66.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 152 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 5.8s SatisfiabilityAnalysisTime, 30.4s InterpolantComputationTime, 1123 NumberOfCodeBlocks, 934 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1112 ConstructedInterpolants, 47 QuantifiedInterpolants, 567069 SizeOfPredicates, 54 NumberOfNonLiveVariables, 4705 ConjunctsInSsa, 329 ConjunctsInUnsatCore, 11 InterpolantComputations, 5 PerfectInterpolantSequences, 3161/3277 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-48-13-837.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-48-13-837.csv Completed graceful shutdown