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-0234_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:14:35,208 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:14:35,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:14:35,219 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:14:35,219 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:14:35,220 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:14:35,221 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:14:35,222 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:14:35,224 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:14:35,225 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:14:35,225 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:14:35,225 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:14:35,226 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:14:35,227 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:14:35,227 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:14:35,229 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:14:35,231 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:14:35,232 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:14:35,233 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:14:35,234 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:14:35,235 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:14:35,236 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:14:35,236 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:14:35,237 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:14:35,237 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:14:35,238 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:14:35,238 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:14:35,239 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:14:35,239 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:14:35,239 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:14:35,240 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:14:35,240 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-03 23:14:35,249 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:14:35,249 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:14:35,250 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:14:35,250 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:14:35,250 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:14:35,250 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:14:35,251 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:14:35,251 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:14:35,251 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:14:35,251 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:14:35,251 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:14:35,251 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:14:35,251 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:14:35,252 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:14:35,252 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:14:35,252 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:14:35,252 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:14:35,252 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:14:35,252 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:14:35,253 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:14:35,253 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:14:35,253 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:14:35,253 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:14:35,253 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:14:35,253 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:14:35,283 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:14:35,293 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:14:35,298 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:14:35,299 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:14:35,299 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:14:35,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0234_false-valid-memtrack.i [2018-02-03 23:14:35,420 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:14:35,421 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:14:35,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:14:35,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:14:35,427 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:14:35,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:14:35" (1/1) ... [2018-02-03 23:14:35,430 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 03.02 11:14:35, skipping insertion in model container [2018-02-03 23:14:35,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:14:35" (1/1) ... [2018-02-03 23:14:35,442 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:14:35,471 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:14:35,558 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:14:35,574 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:14:35,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:35 WrapperNode [2018-02-03 23:14:35,580 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:14:35,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:14:35,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:14:35,580 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:14:35,592 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:35" (1/1) ... [2018-02-03 23:14:35,593 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:35" (1/1) ... [2018-02-03 23:14:35,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:35" (1/1) ... [2018-02-03 23:14:35,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:35" (1/1) ... [2018-02-03 23:14:35,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:35" (1/1) ... [2018-02-03 23:14:35,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:35" (1/1) ... [2018-02-03 23:14:35,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:35" (1/1) ... [2018-02-03 23:14:35,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:14:35,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:14:35,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:14:35,620 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:14:35,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:35" (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-03 23:14:35,667 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:14:35,667 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:14:35,667 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-03 23:14:35,667 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-03 23:14:35,667 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-03 23:14:35,668 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-03 23:14:35,668 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-03 23:14:35,668 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-03 23:14:35,668 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-03 23:14:35,668 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-03 23:14:35,668 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-03 23:14:35,668 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-03 23:14:35,668 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-03 23:14:35,668 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-03 23:14:35,669 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:14:35,669 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-03 23:14:35,669 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-03 23:14:35,669 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:14:35,669 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:14:35,669 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:14:35,669 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-03 23:14:35,669 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-03 23:14:35,669 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-03 23:14:35,670 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-03 23:14:35,670 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-03 23:14:35,670 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-03 23:14:35,670 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-03 23:14:35,670 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 23:14:35,670 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-03 23:14:35,670 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-03 23:14:35,670 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-03 23:14:35,671 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-03 23:14:35,671 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-03 23:14:35,671 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-03 23:14:35,671 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-03 23:14:35,671 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-03 23:14:35,671 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-03 23:14:35,671 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-03 23:14:35,671 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-03 23:14:35,672 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:14:35,672 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:14:35,672 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:14:35,891 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-03 23:14:36,123 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:14:36,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:14:36 BoogieIcfgContainer [2018-02-03 23:14:36,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:14:36,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:14:36,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:14:36,126 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:14:36,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:14:35" (1/3) ... [2018-02-03 23:14:36,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac9b23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:14:36, skipping insertion in model container [2018-02-03 23:14:36,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:14:35" (2/3) ... [2018-02-03 23:14:36,127 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac9b23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:14:36, skipping insertion in model container [2018-02-03 23:14:36,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:14:36" (3/3) ... [2018-02-03 23:14:36,128 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0234_false-valid-memtrack.i [2018-02-03 23:14:36,134 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:14:36,140 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-02-03 23:14:36,164 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:14:36,164 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:14:36,164 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:14:36,164 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:14:36,164 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:14:36,164 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:14:36,165 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:14:36,165 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:14:36,165 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:14:36,177 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2018-02-03 23:14:36,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:14:36,184 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:36,185 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:14:36,185 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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-03 23:14:36,188 INFO L82 PathProgramCache]: Analyzing trace with hash 11876704, now seen corresponding path program 1 times [2018-02-03 23:14:36,189 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:36,189 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:36,220 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:36,220 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:36,220 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:36,247 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:36,278 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-03 23:14:36,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:36,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:14:36,280 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:14:36,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:14:36,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:14:36,340 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2018-02-03 23:14:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:36,486 INFO L93 Difference]: Finished difference Result 254 states and 273 transitions. [2018-02-03 23:14:36,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:14:36,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:14:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:36,500 INFO L225 Difference]: With dead ends: 254 [2018-02-03 23:14:36,500 INFO L226 Difference]: Without dead ends: 251 [2018-02-03 23:14:36,501 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-03 23:14:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-03 23:14:36,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 219. [2018-02-03 23:14:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-03 23:14:36,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-03 23:14:36,536 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 4 [2018-02-03 23:14:36,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:36,536 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-03 23:14:36,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:14:36,537 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-03 23:14:36,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:14:36,537 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:36,537 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:14:36,537 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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-03 23:14:36,538 INFO L82 PathProgramCache]: Analyzing trace with hash 11876705, now seen corresponding path program 1 times [2018-02-03 23:14:36,538 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:36,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:36,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:36,539 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:36,539 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:36,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:36,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:14:36,585 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-03 23:14:36,585 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:36,585 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:14:36,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:14:36,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:14:36,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:14:36,586 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 3 states. [2018-02-03 23:14:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:36,670 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2018-02-03 23:14:36,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:14:36,670 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:14:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:36,672 INFO L225 Difference]: With dead ends: 226 [2018-02-03 23:14:36,672 INFO L226 Difference]: Without dead ends: 226 [2018-02-03 23:14:36,673 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-03 23:14:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-03 23:14:36,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2018-02-03 23:14:36,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-03 23:14:36,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-03 23:14:36,684 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 4 [2018-02-03 23:14:36,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:36,685 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-03 23:14:36,685 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:14:36,685 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-03 23:14:36,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:14:36,685 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:36,686 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:14:36,686 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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-03 23:14:36,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1969754800, now seen corresponding path program 1 times [2018-02-03 23:14:36,686 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:36,686 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:36,687 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:36,687 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:36,687 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:36,704 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:14:36,704 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:14:36,704 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:14:36,710 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:36,736 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:36,762 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-03 23:14:36,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:36,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:36,766 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:14:36,772 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-03 23:14:36,789 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:36,790 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:14:36,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:14:36,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:14:36,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:14:36,791 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 4 states. [2018-02-03 23:14:36,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:36,889 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-03 23:14:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:14:36,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-03 23:14:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:36,890 INFO L225 Difference]: With dead ends: 217 [2018-02-03 23:14:36,890 INFO L226 Difference]: Without dead ends: 217 [2018-02-03 23:14:36,890 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-03 23:14:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-03 23:14:36,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-03 23:14:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-03 23:14:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-02-03 23:14:36,897 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 17 [2018-02-03 23:14:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:36,897 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-02-03 23:14:36,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:14:36,897 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-02-03 23:14:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:14:36,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:36,898 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:14:36,898 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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-03 23:14:36,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1969754799, now seen corresponding path program 1 times [2018-02-03 23:14:36,898 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:36,898 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:36,899 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:36,899 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:36,899 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:36,910 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:14:36,911 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:14:36,911 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-03 23:14:36,918 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:36,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:36,952 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-03 23:14:36,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:36,969 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-03 23:14:36,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:36,988 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:14:36,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-03 23:14:37,046 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-03 23:14:37,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:37,066 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:14:37,067 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:14:37,067 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:14:37,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:14:37,067 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 4 states. [2018-02-03 23:14:37,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:37,190 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2018-02-03 23:14:37,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:14:37,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-03 23:14:37,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:37,191 INFO L225 Difference]: With dead ends: 216 [2018-02-03 23:14:37,191 INFO L226 Difference]: Without dead ends: 216 [2018-02-03 23:14:37,192 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-03 23:14:37,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-03 23:14:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-03 23:14:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-03 23:14:37,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-02-03 23:14:37,199 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 17 [2018-02-03 23:14:37,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:37,200 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-02-03 23:14:37,200 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:14:37,200 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-02-03 23:14:37,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-03 23:14:37,203 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:37,204 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-03 23:14:37,204 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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-03 23:14:37,204 INFO L82 PathProgramCache]: Analyzing trace with hash -772454620, now seen corresponding path program 1 times [2018-02-03 23:14:37,204 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:37,204 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:37,205 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:37,205 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:37,206 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:37,221 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:14:37,221 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:14:37,222 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-03 23:14:37,227 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:37,318 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:37,328 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-03 23:14:37,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:37,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:14:37,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:14:37,378 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-03 23:14:37,381 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:37,383 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-03 23:14:37,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:37,384 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-03 23:14:37,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-03 23:14:37,393 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-03 23:14:37,406 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:37,407 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:14:37,408 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-03 23:14:37,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:37,415 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-03 23:14:37,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-03 23:14:37,452 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-03 23:14:37,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:14:37,470 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-03 23:14:37,470 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:14:37,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:14:37,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-03 23:14:37,471 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 15 states. [2018-02-03 23:14:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:38,099 INFO L93 Difference]: Finished difference Result 244 states and 264 transitions. [2018-02-03 23:14:38,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 23:14:38,100 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-03 23:14:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:38,101 INFO L225 Difference]: With dead ends: 244 [2018-02-03 23:14:38,101 INFO L226 Difference]: Without dead ends: 244 [2018-02-03 23:14:38,101 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-03 23:14:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-03 23:14:38,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 214. [2018-02-03 23:14:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-03 23:14:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 229 transitions. [2018-02-03 23:14:38,106 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 229 transitions. Word has length 142 [2018-02-03 23:14:38,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:38,106 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 229 transitions. [2018-02-03 23:14:38,106 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:14:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 229 transitions. [2018-02-03 23:14:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-03 23:14:38,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:38,107 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-03 23:14:38,107 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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-03 23:14:38,107 INFO L82 PathProgramCache]: Analyzing trace with hash -772454619, now seen corresponding path program 1 times [2018-02-03 23:14:38,107 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:38,108 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:38,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:38,108 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:38,108 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:38,120 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:14:38,120 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:14:38,121 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-03 23:14:38,133 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:38,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-03 23:14:38,330 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:14:38,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:14:38,330 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:14:38,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:14:38,331 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:14:38,331 INFO L87 Difference]: Start difference. First operand 214 states and 229 transitions. Second operand 8 states. [2018-02-03 23:14:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:38,427 INFO L93 Difference]: Finished difference Result 224 states and 239 transitions. [2018-02-03 23:14:38,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:14:38,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-03 23:14:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:38,429 INFO L225 Difference]: With dead ends: 224 [2018-02-03 23:14:38,429 INFO L226 Difference]: Without dead ends: 215 [2018-02-03 23:14:38,430 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-03 23:14:38,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-03 23:14:38,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-02-03 23:14:38,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-03 23:14:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 230 transitions. [2018-02-03 23:14:38,436 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 230 transitions. Word has length 142 [2018-02-03 23:14:38,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:38,436 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 230 transitions. [2018-02-03 23:14:38,436 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:14:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 230 transitions. [2018-02-03 23:14:38,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-03 23:14:38,438 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:38,438 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-03 23:14:38,439 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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-03 23:14:38,439 INFO L82 PathProgramCache]: Analyzing trace with hash 152413325, now seen corresponding path program 1 times [2018-02-03 23:14:38,439 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:38,439 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:38,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:38,440 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:38,440 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:38,453 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:14:38,453 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:14:38,453 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-03 23:14:38,468 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:14:38,699 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-03 23:14:38,817 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:14:38,817 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-03 23:14:38,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:14:38,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:14:38,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:14:38,818 INFO L87 Difference]: Start difference. First operand 215 states and 230 transitions. Second operand 9 states. [2018-02-03 23:14:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:38,908 INFO L93 Difference]: Finished difference Result 225 states and 240 transitions. [2018-02-03 23:14:38,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 23:14:38,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-03 23:14:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:38,910 INFO L225 Difference]: With dead ends: 225 [2018-02-03 23:14:38,910 INFO L226 Difference]: Without dead ends: 216 [2018-02-03 23:14:38,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:14:38,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-03 23:14:38,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-03 23:14:38,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-03 23:14:38,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-02-03 23:14:38,918 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 148 [2018-02-03 23:14:38,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:38,919 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-02-03 23:14:38,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:14:38,919 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-02-03 23:14:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-03 23:14:38,921 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:38,921 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-03 23:14:38,921 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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-03 23:14:38,921 INFO L82 PathProgramCache]: Analyzing trace with hash -677500123, now seen corresponding path program 2 times [2018-02-03 23:14:38,921 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:38,922 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:38,922 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:38,922 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:14:38,923 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:38,934 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:14:38,934 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:14:38,935 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-03 23:14:38,948 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:14:40,348 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:14:40,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:14:40,353 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 99 proven. 56 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-02-03 23:14:40,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:14:40,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-03 23:14:40,458 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-03 23:14:40,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-03 23:14:40,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-03 23:14:40,458 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 10 states. [2018-02-03 23:14:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:40,560 INFO L93 Difference]: Finished difference Result 226 states and 241 transitions. [2018-02-03 23:14:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-03 23:14:40,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-02-03 23:14:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:40,562 INFO L225 Difference]: With dead ends: 226 [2018-02-03 23:14:40,562 INFO L226 Difference]: Without dead ends: 217 [2018-02-03 23:14:40,562 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:14:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-03 23:14:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-03 23:14:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-03 23:14:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-02-03 23:14:40,567 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 154 [2018-02-03 23:14:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:40,567 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-02-03 23:14:40,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-03 23:14:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-02-03 23:14:40,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-03 23:14:40,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:40,569 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-03 23:14:40,570 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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-03 23:14:40,570 INFO L82 PathProgramCache]: Analyzing trace with hash -626793843, now seen corresponding path program 3 times [2018-02-03 23:14:40,570 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:40,570 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:40,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:40,571 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:14:40,571 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:40,584 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:14:40,584 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:14:40,584 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-03 23:14:40,593 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 23:14:40,714 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-03 23:14:40,715 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:14:40,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-02-03 23:14:40,844 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:14:40,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-03 23:14:40,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-03 23:14:40,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-03 23:14:40,845 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:14:40,845 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 11 states. [2018-02-03 23:14:40,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:40,938 INFO L93 Difference]: Finished difference Result 227 states and 242 transitions. [2018-02-03 23:14:40,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 23:14:40,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 160 [2018-02-03 23:14:40,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:40,939 INFO L225 Difference]: With dead ends: 227 [2018-02-03 23:14:40,939 INFO L226 Difference]: Without dead ends: 218 [2018-02-03 23:14:40,939 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-03 23:14:40,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-03 23:14:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-03 23:14:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-03 23:14:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-03 23:14:40,943 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 160 [2018-02-03 23:14:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:40,943 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-03 23:14:40,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-03 23:14:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-03 23:14:40,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-02-03 23:14:40,945 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:40,945 INFO L351 BasicCegarLoop]: trace histogram [24, 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-03 23:14:40,945 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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-03 23:14:40,945 INFO L82 PathProgramCache]: Analyzing trace with hash 262360869, now seen corresponding path program 4 times [2018-02-03 23:14:40,945 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:40,945 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:40,946 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:40,946 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:14:40,946 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:40,955 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:14:40,955 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:14:40,955 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-03 23:14:40,965 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-03 23:14:43,887 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-03 23:14:43,888 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:14:43,895 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 447 proven. 23 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-02-03 23:14:44,017 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:14:44,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-03 23:14:44,018 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:14:44,018 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:14:44,018 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-03 23:14:44,018 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 12 states. [2018-02-03 23:14:44,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:44,140 INFO L93 Difference]: Finished difference Result 228 states and 243 transitions. [2018-02-03 23:14:44,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-03 23:14:44,140 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-02-03 23:14:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:44,141 INFO L225 Difference]: With dead ends: 228 [2018-02-03 23:14:44,141 INFO L226 Difference]: Without dead ends: 219 [2018-02-03 23:14:44,141 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-03 23:14:44,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-03 23:14:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-02-03 23:14:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-03 23:14:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-03 23:14:44,145 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 166 [2018-02-03 23:14:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:44,145 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-03 23:14:44,145 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:14:44,145 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-03 23:14:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-03 23:14:44,146 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:44,146 INFO L351 BasicCegarLoop]: trace histogram [30, 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-03 23:14:44,147 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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-03 23:14:44,147 INFO L82 PathProgramCache]: Analyzing trace with hash -668999539, now seen corresponding path program 5 times [2018-02-03 23:14:44,147 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:44,147 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:44,147 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:44,148 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:14:44,148 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:44,156 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:14:44,156 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:14:44,156 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-03 23:14:44,165 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-03 23:14:52,635 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-03 23:14:52,635 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:14:52,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 437 proven. 60 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-02-03 23:14:52,762 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:14:52,762 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-03 23:14:52,763 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-03 23:14:52,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-03 23:14:52,763 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-03 23:14:52,763 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 13 states. [2018-02-03 23:14:52,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:14:52,898 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-02-03 23:14:52,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-03 23:14:52,898 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 172 [2018-02-03 23:14:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:14:52,899 INFO L225 Difference]: With dead ends: 229 [2018-02-03 23:14:52,899 INFO L226 Difference]: Without dead ends: 220 [2018-02-03 23:14:52,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-03 23:14:52,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-03 23:14:52,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-02-03 23:14:52,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-03 23:14:52,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 235 transitions. [2018-02-03 23:14:52,903 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 235 transitions. Word has length 172 [2018-02-03 23:14:52,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:14:52,903 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 235 transitions. [2018-02-03 23:14:52,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-03 23:14:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2018-02-03 23:14:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-03 23:14:52,904 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:14:52,904 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-03 23:14:52,904 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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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-03 23:14:52,904 INFO L82 PathProgramCache]: Analyzing trace with hash -954944731, now seen corresponding path program 6 times [2018-02-03 23:14:52,905 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:14:52,905 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:14:52,905 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:52,905 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:14:52,906 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:14:52,915 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:14:52,916 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:14:52,916 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-03 23:14:52,922 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-03 23:14:54,746 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-03 23:14:54,746 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:14:54,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:14:54,765 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 27 treesize of output 26 [2018-02-03 23:14:54,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:54,785 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 30 treesize of output 29 [2018-02-03 23:14:54,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:14:54,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:14:54,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:56 [2018-02-03 23:14:59,275 WARN L143 SmtUtils]: Spent 2012ms on a formula simplification that was a NOOP. DAG size: 32 [2018-02-03 23:15:00,004 WARN L143 SmtUtils]: Spent 672ms on a formula simplification that was a NOOP. DAG size: 34 [2018-02-03 23:15:01,349 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-03 23:15:01,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:01,369 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-03 23:15:01,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:01,389 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 25 treesize of output 24 [2018-02-03 23:15:01,390 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:01,409 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 24 treesize of output 19 [2018-02-03 23:15:01,409 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:01,423 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-03 23:15:01,423 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-03 23:15:02,344 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_8| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse0 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_8| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse0) (= .cse0 (+ (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) 4294967296))))) (exists ((v_prenex_15 Int) (v_prenex_12 Int) (v_prenex_13 Int)) (let ((.cse1 (mod (* v_prenex_13 v_prenex_12) 4294967296))) (and (<= .cse1 2147483647) (= (select |c_#length| v_prenex_15) .cse1))))) is different from true [2018-02-03 23:15:10,000 WARN L146 SmtUtils]: Spent 7583ms on a formula simplification. DAG size of input: 57 DAG size of output 32 [2018-02-03 23:15:10,006 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_17 Int) (calloc_model_~size Int)) (let ((.cse0 (mod calloc_model_~size 4294967296))) (and (= (select |c_old(#valid)| v_prenex_17) 0) (< 2147483647 .cse0) (= (store |c_old(#length)| v_prenex_17 (+ .cse0 (- 4294967296))) |c_#length|)))) (exists ((v_prenex_12 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse1 (mod v_prenex_12 4294967296))) (and (= |c_#length| (store |c_old(#length)| calloc_model_~ptr~0.base .cse1)) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse1 2147483647))))) is different from true [2018-02-03 23:15:10,013 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,014 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 32 treesize of output 35 [2018-02-03 23:15:10,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,032 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 34 treesize of output 47 [2018-02-03 23:15:10,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,051 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,052 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 33 treesize of output 27 [2018-02-03 23:15:10,052 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,065 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:15:10,066 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 31 treesize of output 25 [2018-02-03 23:15:10,067 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:15:10,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-03 23:15:10,078 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-03 23:15:12,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 522 proven. 13 refuted. 0 times theorem prover too weak. 524 trivial. 57 not checked. [2018-02-03 23:15:12,192 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:15:12,192 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-03 23:15:12,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-03 23:15:12,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-03 23:15:12,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=437, Unknown=11, NotChecked=86, Total=600 [2018-02-03 23:15:12,193 INFO L87 Difference]: Start difference. First operand 220 states and 235 transitions. Second operand 25 states. [2018-02-03 23:15:18,296 WARN L143 SmtUtils]: Spent 4015ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-03 23:15:20,728 WARN L143 SmtUtils]: Spent 2387ms on a formula simplification that was a NOOP. DAG size: 34 [2018-02-03 23:15:24,787 WARN L143 SmtUtils]: Spent 4015ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-03 23:15:26,970 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 49 DAG size of output 47 [2018-02-03 23:15:28,046 WARN L146 SmtUtils]: Spent 891ms on a formula simplification. DAG size of input: 72 DAG size of output 70 [2018-02-03 23:15:36,387 WARN L146 SmtUtils]: Spent 6158ms on a formula simplification. DAG size of input: 59 DAG size of output 35 [2018-02-03 23:15:40,480 WARN L146 SmtUtils]: Spent 4046ms on a formula simplification. DAG size of input: 62 DAG size of output 40 [2018-02-03 23:15:40,715 WARN L146 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 67 DAG size of output 42 [2018-02-03 23:15:59,258 WARN L146 SmtUtils]: Spent 15909ms on a formula simplification. DAG size of input: 81 DAG size of output 52 [2018-02-03 23:16:09,134 WARN L146 SmtUtils]: Spent 9347ms on a formula simplification. DAG size of input: 88 DAG size of output 59 [2018-02-03 23:16:32,486 WARN L143 SmtUtils]: Spent 17589ms on a formula simplification that was a NOOP. DAG size: 55 [2018-02-03 23:17:25,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:17:25,885 INFO L93 Difference]: Finished difference Result 254 states and 276 transitions. [2018-02-03 23:17:25,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-03 23:17:25,885 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2018-02-03 23:17:25,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:17:25,887 INFO L225 Difference]: With dead ends: 254 [2018-02-03 23:17:25,887 INFO L226 Difference]: Without dead ends: 254 [2018-02-03 23:17:25,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 88.2s TimeCoverageRelationStatistics Valid=188, Invalid=1361, Unknown=19, NotChecked=154, Total=1722 [2018-02-03 23:17:25,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-02-03 23:17:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 218. [2018-02-03 23:17:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-03 23:17:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-03 23:17:25,893 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 178 [2018-02-03 23:17:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:17:25,893 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-03 23:17:25,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-03 23:17:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-03 23:17:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-02-03 23:17:25,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:17:25,894 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, 1, 1] [2018-02-03 23:17:25,894 INFO L371 AbstractCegarLoop]: === Iteration 13 === [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_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, 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-03 23:17:25,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1421120613, now seen corresponding path program 1 times [2018-02-03 23:17:25,894 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:17:25,894 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:17:25,895 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:17:25,895 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:17:25,895 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:17:25,903 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:17:25,903 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:17:25,903 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:17:25,908 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:17:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:17:25,972 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:17:25,978 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 30 treesize of output 29 [2018-02-03 23:17:25,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:17:25,994 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 27 treesize of output 26 [2018-02-03 23:17:25,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:17:26,009 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 29 treesize of output 28 [2018-02-03 23:17:26,010 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:17:26,011 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 26 treesize of output 25 [2018-02-03 23:17:26,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:17:26,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:17:26,025 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:58, output treesize:54 [2018-02-03 23:17:26,720 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= (store |c_old(#length)| |calloc_model_#t~malloc0.base| (+ (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296) (- 4294967296))) |c_#length|) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296)))) (exists ((v_prenex_34 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse0 (mod (* v_prenex_36 v_prenex_34) 4294967296))) (and (<= .cse0 2147483647) (= (store |c_old(#length)| v_prenex_35 .cse0) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_35)))))) is different from true [2018-02-03 23:17:26,736 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 23 treesize of output 18 [2018-02-03 23:17:26,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:17:26,757 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 18 treesize of output 17 [2018-02-03 23:17:26,757 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:17:26,778 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-03 23:17:26,778 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:17:26,795 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-03 23:17:26,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:17:26,809 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-03 23:17:26,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-03 23:17:29,941 WARN L143 SmtUtils]: Spent 1116ms on a formula simplification that was a NOOP. DAG size: 27 [2018-02-03 23:17:29,996 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_prenex_39 Int) (v_prenex_44 Int) (v_prenex_42 Int)) (and (< 2147483647 (mod (* v_prenex_44 v_prenex_39) 4294967296)) (= (+ (select |c_#length| v_prenex_42) 4294967296) (mod (* v_prenex_39 v_prenex_44) 4294967296))))) (.cse2 (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= (store |c_old(#length)| |calloc_model_#t~malloc0.base| (+ (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296) (- 4294967296))) |c_#length|) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296))))) (.cse0 (exists ((v_prenex_34 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse5 (mod (* v_prenex_36 v_prenex_34) 4294967296))) (and (<= .cse5 2147483647) (= (store |c_old(#length)| v_prenex_35 .cse5) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_35)))))) (.cse3 (exists ((v_prenex_41 Int) (v_prenex_40 Int) (v_prenex_43 Int)) (let ((.cse4 (mod (* v_prenex_41 v_prenex_40) 4294967296))) (and (= (select |c_#length| v_prenex_43) .cse4) (<= .cse4 2147483647)))))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse0 .cse3))) is different from true [2018-02-03 23:17:30,005 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_34 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (let ((.cse0 (mod (* v_prenex_36 v_prenex_34) 4294967296))) (and (<= .cse0 2147483647) (= (store |c_old(#length)| v_prenex_35 .cse0) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_35))))) (exists ((v_prenex_39 Int) (v_prenex_44 Int) (v_prenex_42 Int)) (and (< 2147483647 (mod (* v_prenex_44 v_prenex_39) 4294967296)) (= (+ (select |c_#length| v_prenex_42) 4294967296) (mod (* v_prenex_39 v_prenex_44) 4294967296))))) (and (exists ((v_prenex_45 Int) (v_prenex_47 Int) (v_prenex_46 Int)) (and (< 2147483647 (mod (* v_prenex_46 v_prenex_45) 4294967296)) (= (+ (select |c_#length| v_prenex_47) 4294967296) (mod (* v_prenex_45 v_prenex_46) 4294967296)))) (exists ((calloc_model_~size Int) (|calloc_model_#t~malloc0.base| Int) (calloc_model_~nmemb Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= (store |c_old(#length)| |calloc_model_#t~malloc0.base| (+ (mod (* calloc_model_~size calloc_model_~nmemb) 4294967296) (- 4294967296))) |c_#length|) (< 2147483647 (mod (* calloc_model_~nmemb calloc_model_~size) 4294967296))))) (and (exists ((v_prenex_49 Int) (v_prenex_48 Int) (v_prenex_50 Int)) (let ((.cse1 (mod (* v_prenex_50 v_prenex_48) 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_49 (+ .cse1 (- 4294967296)))) (< 2147483647 .cse1) (= 0 (select |c_old(#valid)| v_prenex_49))))) (exists ((v_prenex_41 Int) (v_prenex_40 Int) (v_prenex_43 Int)) (let ((.cse2 (mod (* v_prenex_41 v_prenex_40) 4294967296))) (and (= (select |c_#length| v_prenex_43) .cse2) (<= .cse2 2147483647))))) (and (exists ((v_prenex_52 Int) (v_prenex_51 Int) (v_prenex_53 Int)) (let ((.cse3 (mod (* v_prenex_52 v_prenex_51) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_53)) (= |c_#length| (store |c_old(#length)| v_prenex_53 .cse3)) (<= .cse3 2147483647)))) (exists ((v_prenex_56 Int) (v_prenex_55 Int) (v_prenex_54 Int)) (let ((.cse4 (mod (* v_prenex_54 v_prenex_55) 4294967296))) (and (= (select |c_#length| v_prenex_56) .cse4) (<= .cse4 2147483647)))))) is different from true [2018-02-03 23:17:30,030 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:17:30,031 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:17:30,032 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 70 treesize of output 64 [2018-02-03 23:17:30,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:17:52,307 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:17:52,308 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:17:52,308 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 65 treesize of output 59 [2018-02-03 23:17:52,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:18:10,064 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:18:10,066 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:18:10,066 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 65 treesize of output 80 [2018-02-03 23:18:10,067 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. Received shutdown request... [2018-02-03 23:18:21,627 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-02-03 23:18:21,627 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 23:18:21,631 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 23:18:21,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 11:18:21 BoogieIcfgContainer [2018-02-03 23:18:21,631 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 23:18:21,632 INFO L168 Benchmark]: Toolchain (without parser) took 226211.23 ms. Allocated memory was 400.0 MB in the beginning and 723.0 MB in the end (delta: 323.0 MB). Free memory was 356.9 MB in the beginning and 615.4 MB in the end (delta: -258.5 MB). Peak memory consumption was 277.3 MB. Max. memory is 5.3 GB. [2018-02-03 23:18:21,632 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:18:21,633 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.00 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 345.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-03 23:18:21,633 INFO L168 Benchmark]: Boogie Preprocessor took 39.23 ms. Allocated memory is still 400.0 MB. Free memory was 345.0 MB in the beginning and 342.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-03 23:18:21,633 INFO L168 Benchmark]: RCFGBuilder took 503.31 ms. Allocated memory is still 400.0 MB. Free memory was 342.4 MB in the beginning and 291.1 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 5.3 GB. [2018-02-03 23:18:21,633 INFO L168 Benchmark]: TraceAbstraction took 225507.75 ms. Allocated memory was 400.0 MB in the beginning and 723.0 MB in the end (delta: 323.0 MB). Free memory was 291.1 MB in the beginning and 615.4 MB in the end (delta: -324.4 MB). Peak memory consumption was 211.5 MB. Max. memory is 5.3 GB. [2018-02-03 23:18:21,634 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.12 ms. Allocated memory is still 400.0 MB. Free memory is still 363.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.00 ms. Allocated memory is still 400.0 MB. Free memory was 356.9 MB in the beginning and 345.0 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.23 ms. Allocated memory is still 400.0 MB. Free memory was 345.0 MB in the beginning and 342.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 503.31 ms. Allocated memory is still 400.0 MB. Free memory was 342.4 MB in the beginning and 291.1 MB in the end (delta: 51.3 MB). Peak memory consumption was 51.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 225507.75 ms. Allocated memory was 400.0 MB in the beginning and 723.0 MB in the end (delta: 323.0 MB). Free memory was 291.1 MB in the beginning and 615.4 MB in the end (delta: -324.4 MB). Peak memory consumption was 211.5 MB. 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 827). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 864]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 864). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 866). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 866). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was analyzing trace of length 181 with TraceHistMax 36, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 272. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 224 locations, 67 error locations. TIMEOUT Result, 225.4s OverallTime, 13 OverallIterations, 36 TraceHistogramMax, 135.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2541 SDtfs, 574 SDslu, 14130 SDs, 0 SdLazy, 4224 SolverSat, 141 SolverUnsat, 136 SolverUnknown, 0 SolverNotchecked, 63.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1338 GetRequests, 1196 SyntacticMatches, 5 SemanticMatches, 137 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 89.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=0, 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, 12 MinimizatonAttempts, 106 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 15.0s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1292 ConstructedInterpolants, 52 QuantifiedInterpolants, 690517 SizeOfPredicates, 63 NumberOfNonLiveVariables, 5050 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 4266/4491 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-0234_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_23-18-21-642.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_23-18-21-642.csv Completed graceful shutdown