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/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:02:01,280 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:02:01,281 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:02:01,296 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:02:01,296 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:02:01,297 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:02:01,298 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:02:01,299 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:02:01,301 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:02:01,302 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:02:01,303 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:02:01,303 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:02:01,304 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:02:01,305 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:02:01,306 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:02:01,308 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:02:01,310 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:02:01,312 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:02:01,314 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:02:01,315 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:02:01,317 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:02:01,317 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:02:01,317 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:02:01,318 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:02:01,319 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:02:01,321 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:02:01,321 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:02:01,321 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:02:01,322 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:02:01,322 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:02:01,322 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:02:01,323 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:02:01,332 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:02:01,332 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:02:01,332 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:02:01,332 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:02:01,333 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:02:01,333 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:02:01,333 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:02:01,333 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:02:01,333 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:02:01,333 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:02:01,333 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:02:01,334 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:02:01,334 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:02:01,334 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:02:01,334 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:02:01,334 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:02:01,334 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:02:01,334 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:02:01,334 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:02:01,335 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:02:01,335 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:02:01,335 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:02:01,335 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:02:01,335 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:02:01,335 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:02:01,336 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:02:01,336 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:02:01,336 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:02:01,336 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:02:01,336 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:02:01,336 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:02:01,336 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:02:01,337 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:02:01,337 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:02:01,368 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:02:01,378 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:02:01,381 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:02:01,382 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:02:01,382 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:02:01,383 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i [2018-01-24 12:02:01,564 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:02:01,570 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:02:01,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:02:01,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:02:01,576 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:02:01,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:02:01" (1/1) ... [2018-01-24 12:02:01,579 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a76578b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:02:01, skipping insertion in model container [2018-01-24 12:02:01,579 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:02:01" (1/1) ... [2018-01-24 12:02:01,592 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:02:01,633 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:02:01,761 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:02:01,787 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:02:01,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:02:01 WrapperNode [2018-01-24 12:02:01,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:02:01,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:02:01,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:02:01,801 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:02:01,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:02:01" (1/1) ... [2018-01-24 12:02:01,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:02:01" (1/1) ... [2018-01-24 12:02:01,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:02:01" (1/1) ... [2018-01-24 12:02:01,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:02:01" (1/1) ... [2018-01-24 12:02:01,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:02:01" (1/1) ... [2018-01-24 12:02:01,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:02:01" (1/1) ... [2018-01-24 12:02:01,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:02:01" (1/1) ... [2018-01-24 12:02:01,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:02:01,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:02:01,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:02:01,849 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:02:01,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:02:01" (1/1) ... No working directory specified, using /storage/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-01-24 12:02:01,895 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:02:01,895 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:02:01,895 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-01-24 12:02:01,895 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-01-24 12:02:01,895 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-01-24 12:02:01,895 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-01-24 12:02:01,895 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-01-24 12:02:01,895 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-01-24 12:02:01,896 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-01-24 12:02:01,896 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-01-24 12:02:01,896 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-01-24 12:02:01,896 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-01-24 12:02:01,896 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-01-24 12:02:01,896 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-01-24 12:02:01,896 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:02:01,896 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:02:01,896 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:02:01,896 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:02:01,896 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:02:01,897 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:02:01,897 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-01-24 12:02:01,897 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-01-24 12:02:01,897 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 12:02:01,897 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:02:01,897 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 12:02:01,897 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-01-24 12:02:01,897 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-01-24 12:02:01,897 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:02:01,898 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-01-24 12:02:01,898 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-01-24 12:02:01,898 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-01-24 12:02:01,898 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-01-24 12:02:01,898 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-01-24 12:02:01,898 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-01-24 12:02:01,898 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-01-24 12:02:01,898 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-01-24 12:02:01,898 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-01-24 12:02:01,898 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-01-24 12:02:01,898 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-01-24 12:02:01,898 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:02:01,899 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:02:01,899 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:02:02,235 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-24 12:02:02,546 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:02:02,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:02:02 BoogieIcfgContainer [2018-01-24 12:02:02,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:02:02,548 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:02:02,548 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:02:02,550 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:02:02,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:02:01" (1/3) ... [2018-01-24 12:02:02,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6fce67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:02:02, skipping insertion in model container [2018-01-24 12:02:02,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:02:01" (2/3) ... [2018-01-24 12:02:02,552 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6fce67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:02:02, skipping insertion in model container [2018-01-24 12:02:02,552 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:02:02" (3/3) ... [2018-01-24 12:02:02,553 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0237_true-valid-memsafety.i [2018-01-24 12:02:02,559 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:02:02,565 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 83 error locations. [2018-01-24 12:02:02,614 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:02:02,614 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:02:02,615 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:02:02,615 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:02:02,615 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:02:02,615 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:02:02,615 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:02:02,615 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:02:02,616 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:02:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states. [2018-01-24 12:02:02,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 12:02:02,647 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:02:02,648 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 12:02:02,648 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:02:02,653 INFO L82 PathProgramCache]: Analyzing trace with hash 12677088, now seen corresponding path program 1 times [2018-01-24 12:02:02,656 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:02:02,656 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:02:02,727 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:02,728 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:02:02,728 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:02:02,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:02:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:02:02,812 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:02:02,813 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:02:02,814 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:02:02,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:02:02,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:02:02,907 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 3 states. [2018-01-24 12:02:03,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:02:03,233 INFO L93 Difference]: Finished difference Result 521 states and 603 transitions. [2018-01-24 12:02:03,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:02:03,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 12:02:03,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:02:03,292 INFO L225 Difference]: With dead ends: 521 [2018-01-24 12:02:03,292 INFO L226 Difference]: Without dead ends: 276 [2018-01-24 12:02:03,299 INFO L525 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-01-24 12:02:03,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-01-24 12:02:03,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 245. [2018-01-24 12:02:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-01-24 12:02:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 260 transitions. [2018-01-24 12:02:03,362 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 260 transitions. Word has length 4 [2018-01-24 12:02:03,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:02:03,362 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 260 transitions. [2018-01-24 12:02:03,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:02:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 260 transitions. [2018-01-24 12:02:03,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 12:02:03,362 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:02:03,362 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 12:02:03,363 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:02:03,363 INFO L82 PathProgramCache]: Analyzing trace with hash 12677089, now seen corresponding path program 1 times [2018-01-24 12:02:03,363 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:02:03,363 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:02:03,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:03,364 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:02:03,364 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:02:03,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:02:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:02:03,434 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:02:03,434 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:02:03,435 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:02:03,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:02:03,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:02:03,436 INFO L87 Difference]: Start difference. First operand 245 states and 260 transitions. Second operand 3 states. [2018-01-24 12:02:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:02:03,557 INFO L93 Difference]: Finished difference Result 253 states and 271 transitions. [2018-01-24 12:02:03,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:02:03,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 12:02:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:02:03,559 INFO L225 Difference]: With dead ends: 253 [2018-01-24 12:02:03,559 INFO L226 Difference]: Without dead ends: 252 [2018-01-24 12:02:03,559 INFO L525 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-01-24 12:02:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-01-24 12:02:03,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 244. [2018-01-24 12:02:03,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-01-24 12:02:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 259 transitions. [2018-01-24 12:02:03,579 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 259 transitions. Word has length 4 [2018-01-24 12:02:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:02:03,580 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 259 transitions. [2018-01-24 12:02:03,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:02:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 259 transitions. [2018-01-24 12:02:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:02:03,580 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:02:03,580 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:02:03,581 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:02:03,581 INFO L82 PathProgramCache]: Analyzing trace with hash -144742640, now seen corresponding path program 1 times [2018-01-24 12:02:03,581 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:02:03,581 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:02:03,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:03,582 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:02:03,582 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:03,601 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:02:03,601 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:02:03,602 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:02:03,609 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:02:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:02:03,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:02:03,668 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-01-24 12:02:03,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:03,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:02:03,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:02:03,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:02:03,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:02:03,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:02:03,698 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:02:03,698 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:02:03,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:02:03,699 INFO L87 Difference]: Start difference. First operand 244 states and 259 transitions. Second operand 4 states. [2018-01-24 12:02:03,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:02:03,884 INFO L93 Difference]: Finished difference Result 244 states and 259 transitions. [2018-01-24 12:02:03,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:02:03,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 12:02:03,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:02:03,886 INFO L225 Difference]: With dead ends: 244 [2018-01-24 12:02:03,886 INFO L226 Difference]: Without dead ends: 243 [2018-01-24 12:02:03,886 INFO L525 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-01-24 12:02:03,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-24 12:02:03,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-01-24 12:02:03,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-24 12:02:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 258 transitions. [2018-01-24 12:02:03,903 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 258 transitions. Word has length 17 [2018-01-24 12:02:03,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:02:03,903 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 258 transitions. [2018-01-24 12:02:03,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:02:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 258 transitions. [2018-01-24 12:02:03,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 12:02:03,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:02:03,904 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:02:03,904 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:02:03,904 INFO L82 PathProgramCache]: Analyzing trace with hash -144742639, now seen corresponding path program 1 times [2018-01-24 12:02:03,904 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:02:03,904 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:02:03,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:03,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:02:03,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:03,920 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:02:03,921 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:02:03,921 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:02:03,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:02:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:02:03,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:02:03,956 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-01-24 12:02:03,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:03,973 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-01-24 12:02:03,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:03,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:02:03,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-01-24 12:02:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:02:04,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:02:04,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:02:04,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:02:04,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:02:04,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:02:04,043 INFO L87 Difference]: Start difference. First operand 243 states and 258 transitions. Second operand 4 states. [2018-01-24 12:02:04,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:02:04,315 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2018-01-24 12:02:04,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:02:04,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-01-24 12:02:04,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:02:04,317 INFO L225 Difference]: With dead ends: 243 [2018-01-24 12:02:04,317 INFO L226 Difference]: Without dead ends: 242 [2018-01-24 12:02:04,318 INFO L525 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-01-24 12:02:04,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-24 12:02:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-01-24 12:02:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-01-24 12:02:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-01-24 12:02:04,331 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 17 [2018-01-24 12:02:04,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:02:04,331 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-01-24 12:02:04,331 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:02:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-01-24 12:02:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-24 12:02:04,336 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:02:04,336 INFO L322 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-01-24 12:02:04,336 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:02:04,336 INFO L82 PathProgramCache]: Analyzing trace with hash -515979882, now seen corresponding path program 1 times [2018-01-24 12:02:04,336 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:02:04,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:02:04,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:04,338 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:02:04,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:04,361 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:02:04,361 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:02:04,361 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:02:04,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:02:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:02:04,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:02:04,503 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-01-24 12:02:04,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:04,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:02:04,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 12:02:04,603 WARN L1029 $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-01-24 12:02:04,607 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:04,609 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-01-24 12:02:04,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:04,612 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-01-24 12:02:04,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 12:02:04,629 WARN L1029 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~5.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-01-24 12:02:04,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:04,649 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:04,650 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-01-24 12:02:04,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:04,658 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-01-24 12:02:04,658 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-01-24 12:02:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 9 not checked. [2018-01-24 12:02:04,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:02:04,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-01-24 12:02:04,742 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-24 12:02:04,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-24 12:02:04,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-01-24 12:02:04,743 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 15 states. [2018-01-24 12:02:05,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:02:05,806 INFO L93 Difference]: Finished difference Result 271 states and 291 transitions. [2018-01-24 12:02:05,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:02:05,806 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-01-24 12:02:05,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:02:05,810 INFO L225 Difference]: With dead ends: 271 [2018-01-24 12:02:05,810 INFO L226 Difference]: Without dead ends: 267 [2018-01-24 12:02:05,812 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=313, Unknown=2, NotChecked=74, Total=462 [2018-01-24 12:02:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-01-24 12:02:05,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 238. [2018-01-24 12:02:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-24 12:02:05,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 253 transitions. [2018-01-24 12:02:05,830 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 253 transitions. Word has length 142 [2018-01-24 12:02:05,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:02:05,831 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 253 transitions. [2018-01-24 12:02:05,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-24 12:02:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 253 transitions. [2018-01-24 12:02:05,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-01-24 12:02:05,833 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:02:05,833 INFO L322 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-01-24 12:02:05,833 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:02:05,834 INFO L82 PathProgramCache]: Analyzing trace with hash -515979881, now seen corresponding path program 1 times [2018-01-24 12:02:05,834 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:02:05,834 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:02:05,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:05,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:02:05,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:05,853 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:02:05,853 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:02:05,853 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:02:05,864 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:02:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:02:06,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:02:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-01-24 12:02:06,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:02:06,215 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:02:06,215 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:02:06,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:02:06,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:02:06,216 INFO L87 Difference]: Start difference. First operand 238 states and 253 transitions. Second operand 8 states. [2018-01-24 12:02:06,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:02:06,372 INFO L93 Difference]: Finished difference Result 479 states and 520 transitions. [2018-01-24 12:02:06,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:02:06,373 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-01-24 12:02:06,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:02:06,375 INFO L225 Difference]: With dead ends: 479 [2018-01-24 12:02:06,375 INFO L226 Difference]: Without dead ends: 239 [2018-01-24 12:02:06,377 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:02:06,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-01-24 12:02:06,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-01-24 12:02:06,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-01-24 12:02:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 254 transitions. [2018-01-24 12:02:06,394 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 254 transitions. Word has length 142 [2018-01-24 12:02:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:02:06,394 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 254 transitions. [2018-01-24 12:02:06,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:02:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2018-01-24 12:02:06,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-01-24 12:02:06,397 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:02:06,397 INFO L322 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-01-24 12:02:06,397 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:02:06,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1585380729, now seen corresponding path program 1 times [2018-01-24 12:02:06,397 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:02:06,397 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:02:06,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:06,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:02:06,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:06,416 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:02:06,417 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:02:06,417 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:02:06,428 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:02:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:02:06,654 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:02:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 105 proven. 1 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-01-24 12:02:06,772 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:02:06,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-01-24 12:02:06,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:02:06,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:02:06,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:02:06,773 INFO L87 Difference]: Start difference. First operand 239 states and 254 transitions. Second operand 9 states. [2018-01-24 12:02:06,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:02:06,904 INFO L93 Difference]: Finished difference Result 481 states and 522 transitions. [2018-01-24 12:02:06,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:02:06,904 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-01-24 12:02:06,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:02:06,906 INFO L225 Difference]: With dead ends: 481 [2018-01-24 12:02:06,906 INFO L226 Difference]: Without dead ends: 240 [2018-01-24 12:02:06,907 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:02:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-01-24 12:02:06,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2018-01-24 12:02:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-24 12:02:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 255 transitions. [2018-01-24 12:02:06,920 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 255 transitions. Word has length 148 [2018-01-24 12:02:06,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:02:06,920 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 255 transitions. [2018-01-24 12:02:06,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:02:06,920 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 255 transitions. [2018-01-24 12:02:06,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-01-24 12:02:06,922 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:02:06,922 INFO L322 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-01-24 12:02:06,922 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:02:06,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1111849367, now seen corresponding path program 2 times [2018-01-24 12:02:06,923 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:02:06,923 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:02:06,923 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:06,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:02:06,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:06,938 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:02:06,938 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:02:06,938 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:02:06,948 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 12:02:06,985 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:02:07,040 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 12:02:08,141 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:02:08,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:02:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 219 proven. 12 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2018-01-24 12:02:08,285 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:02:08,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-01-24 12:02:08,307 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:02:08,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:02:08,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:02:08,308 INFO L87 Difference]: Start difference. First operand 240 states and 255 transitions. Second operand 10 states. [2018-01-24 12:02:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:02:08,467 INFO L93 Difference]: Finished difference Result 483 states and 524 transitions. [2018-01-24 12:02:08,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:02:08,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-01-24 12:02:08,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:02:08,470 INFO L225 Difference]: With dead ends: 483 [2018-01-24 12:02:08,470 INFO L226 Difference]: Without dead ends: 241 [2018-01-24 12:02:08,471 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:02:08,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-01-24 12:02:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-01-24 12:02:08,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-01-24 12:02:08,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 256 transitions. [2018-01-24 12:02:08,488 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 256 transitions. Word has length 154 [2018-01-24 12:02:08,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:02:08,488 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 256 transitions. [2018-01-24 12:02:08,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:02:08,488 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 256 transitions. [2018-01-24 12:02:08,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-01-24 12:02:08,490 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:02:08,490 INFO L322 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-01-24 12:02:08,491 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-01-24 12:02:08,491 INFO L82 PathProgramCache]: Analyzing trace with hash 668249593, now seen corresponding path program 3 times [2018-01-24 12:02:08,491 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:02:08,491 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:02:08,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:08,492 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 12:02:08,492 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:02:08,508 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-01-24 12:02:08,508 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-01-24 12:02:08,508 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:02:08,519 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 12:02:08,555 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:02:08,564 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:02:08,586 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 12:02:08,700 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 12:02:08,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:02:08,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-01-24 12:02:08,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:08,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-01-24 12:02:08,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:08,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-01-24 12:02:08,816 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:08,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-01-24 12:02:08,819 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:08,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:02:08,844 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-01-24 12:02:13,060 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-01-24 12:02:13,061 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:13,086 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-01-24 12:02:13,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:13,113 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-01-24 12:02:13,114 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:13,135 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-01-24 12:02:13,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:13,155 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-01-24 12:02:13,155 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-01-24 12:02:20,264 WARN L143 SmtUtils]: Spent 2078ms on a formula simplification that was a NOOP. DAG size: 25 [2018-01-24 12:02:20,295 WARN L1029 $PredicateComparison]: unable to prove that (let ((.cse0 (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_3 Int) (calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int)) (let ((.cse7 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse7) (= (+ (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_3) 4294967296) .cse7))))) (.cse1 (exists ((v_prenex_18 Int) (calloc_model_~ptr~5.base Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| v_prenex_18) 4294967296))) (and (= (select |c_old(#valid)| calloc_model_~ptr~5.base) 0) (< 2147483647 .cse6) (= (store |c_old(#length)| calloc_model_~ptr~5.base (+ .cse6 (- 4294967296))) |c_#length|))))) (.cse2 (exists ((v_prenex_17 Int) (v_prenex_19 Int)) (let ((.cse5 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (= (select |c_old(#valid)| v_prenex_17) 0) (<= .cse5 2147483647) (= |c_#length| (store |c_old(#length)| v_prenex_17 .cse5)))))) (.cse3 (exists ((v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse4 (mod (* v_prenex_14 v_prenex_12) 4294967296))) (and (= (select |c_#length| v_prenex_13) .cse4) (<= .cse4 2147483647)))))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and .cse3 .cse1) (and .cse2 .cse3))) is different from true [2018-01-24 12:02:20,327 WARN L1029 $PredicateComparison]: unable to prove that (or (and (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_3 Int) (calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int)) (let ((.cse0 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse0) (= (+ (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_3) 4294967296) .cse0)))) (exists ((v_prenex_18 Int) (calloc_model_~ptr~5.base Int)) (let ((.cse1 (mod (* |c_calloc_model_#in~nmemb| v_prenex_18) 4294967296))) (and (= (select |c_old(#valid)| calloc_model_~ptr~5.base) 0) (< 2147483647 .cse1) (= (store |c_old(#length)| calloc_model_~ptr~5.base (+ .cse1 (- 4294967296))) |c_#length|))))) (and (exists ((v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse2 (mod (* v_prenex_14 v_prenex_12) 4294967296))) (and (= (select |c_#length| v_prenex_13) .cse2) (<= .cse2 2147483647)))) (exists ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse3 (mod (* |c_calloc_model_#in~nmemb| v_prenex_23) 4294967296))) (and (= (select |c_old(#valid)| v_prenex_24) 0) (= (store |c_old(#length)| v_prenex_24 (+ .cse3 (- 4294967296))) |c_#length|) (< 2147483647 .cse3))))) (and (exists ((v_prenex_29 Int) (v_prenex_25 Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| v_prenex_29) 4294967296))) (and (<= .cse4 2147483647) (= (select |c_old(#valid)| v_prenex_25) 0) (= |c_#length| (store |c_old(#length)| v_prenex_25 .cse4))))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int)) (let ((.cse5 (mod (* v_prenex_27 v_prenex_26) 4294967296))) (and (<= .cse5 2147483647) (= (select |c_#length| v_prenex_28) .cse5))))) (and (exists ((v_prenex_17 Int) (v_prenex_19 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (= (select |c_old(#valid)| v_prenex_17) 0) (<= .cse6 2147483647) (= |c_#length| (store |c_old(#length)| v_prenex_17 .cse6))))) (exists ((v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse7 (mod (* v_prenex_22 v_prenex_21) 4294967296))) (and (< 2147483647 .cse7) (= (+ (select |c_#length| v_prenex_20) 4294967296) .cse7)))))) is different from true [2018-01-24 12:02:20,353 WARN L1029 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_17 Int) (v_prenex_19 Int)) (let ((.cse0 (mod v_prenex_19 4294967296))) (and (= (select |c_old(#valid)| v_prenex_17) 0) (<= .cse0 2147483647) (= (store |c_old(#length)| v_prenex_17 .cse0) |c_#length|)))) (exists ((v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse1 (mod (* v_prenex_22 v_prenex_21) 4294967296))) (and (< 2147483647 .cse1) (= (+ (select |c_#length| v_prenex_20) 4294967296) .cse1))))) (and (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_3 Int) (calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int)) (let ((.cse2 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse2) (= (+ (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_3) 4294967296) .cse2)))) (exists ((v_prenex_18 Int) (calloc_model_~ptr~5.base Int)) (let ((.cse3 (mod v_prenex_18 4294967296))) (and (= (select |c_old(#valid)| calloc_model_~ptr~5.base) 0) (= (store |c_old(#length)| calloc_model_~ptr~5.base (+ .cse3 (- 4294967296))) |c_#length|) (< 2147483647 .cse3))))) (and (exists ((v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse4 (mod (* v_prenex_14 v_prenex_12) 4294967296))) (and (= (select |c_#length| v_prenex_13) .cse4) (<= .cse4 2147483647)))) (exists ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse5 (mod v_prenex_23 4294967296))) (and (< 2147483647 .cse5) (= (store |c_old(#length)| v_prenex_24 (+ .cse5 (- 4294967296))) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_24)))))) (and (exists ((v_prenex_29 Int) (v_prenex_25 Int)) (let ((.cse6 (mod v_prenex_29 4294967296))) (and (<= .cse6 2147483647) (= (select |c_old(#valid)| v_prenex_25) 0) (= (store |c_old(#length)| v_prenex_25 .cse6) |c_#length|)))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int)) (let ((.cse7 (mod (* v_prenex_27 v_prenex_26) 4294967296))) (and (<= .cse7 2147483647) (= (select |c_#length| v_prenex_28) .cse7)))))) is different from true [2018-01-24 12:02:20,398 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:20,406 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 50 treesize of output 53 [2018-01-24 12:02:20,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:20,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:20,631 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 48 treesize of output 51 [2018-01-24 12:02:20,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:20,808 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:20,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:20,810 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 49 treesize of output 43 [2018-01-24 12:02:20,811 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:21,122 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:21,123 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:21,124 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 52 treesize of output 65 [2018-01-24 12:02:21,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:21,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:21,258 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:21,258 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 47 treesize of output 41 [2018-01-24 12:02:21,259 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:21,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:21,391 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:21,391 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 51 treesize of output 45 [2018-01-24 12:02:21,392 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:21,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:21,522 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:21,523 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 50 treesize of output 44 [2018-01-24 12:02:21,523 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:21,676 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:02:21,677 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 44 treesize of output 53 [2018-01-24 12:02:21,677 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:02:21,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-1 vars, End of recursive call: 20 dim-0 vars, and 4 xjuncts. [2018-01-24 12:02:21,802 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 28 variables, input treesize:201, output treesize:165 [2018-01-24 12:02:42,709 WARN L146 SmtUtils]: Spent 20834ms on a formula simplification. DAG size of input: 95 DAG size of output 64 [2018-01-24 12:02:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 258 proven. 27 refuted. 0 times theorem prover too weak. 239 trivial. 7 not checked. [2018-01-24 12:02:42,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:02:42,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-01-24 12:02:42,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 12:02:42,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 12:02:42,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=394, Unknown=7, NotChecked=126, Total=600 [2018-01-24 12:02:42,807 INFO L87 Difference]: Start difference. First operand 241 states and 256 transitions. Second operand 25 states. [2018-01-24 12:02:45,519 WARN L146 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 79 DAG size of output 51 [2018-01-24 12:02:46,801 WARN L146 SmtUtils]: Spent 1173ms on a formula simplification. DAG size of input: 78 DAG size of output 76 [2018-01-24 12:03:04,390 WARN L146 SmtUtils]: Spent 14760ms on a formula simplification. DAG size of input: 127 DAG size of output 54 [2018-01-24 12:03:06,408 WARN L1007 $PredicateComparison]: unable to prove that (let ((.cse19 (mod (* c_calloc_model_~nmemb c_calloc_model_~size) 4294967296))) (let ((.cse21 (<= .cse19 2147483647)) (.cse14 (= |c_calloc_model_#in~nmemb| c_calloc_model_~nmemb)) (.cse12 (select |c_#length| c_calloc_model_~ptr~5.base)) (.cse3 (= 0 c_calloc_model_~ptr~5.offset)) (.cse16 (= c_calloc_model_~size |c_calloc_model_#in~size|)) (.cse20 (< 2147483647 .cse19)) (.cse25 (= (select |c_#valid| c_calloc_model_~ptr~5.base) 1)) (.cse13 (mod (* |c_calloc_model_#in~nmemb| |c_calloc_model_#in~size|) 4294967296))) (and (let ((.cse0 (= 0 (select |c_old(#valid)| |c_calloc_model_#t~malloc0.base|)))) (or (and .cse0 (exists ((calloc_model_~size Int)) (let ((.cse1 (mod (* |c_calloc_model_#in~nmemb| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse1) (= (store |c_old(#length)| |c_calloc_model_#t~malloc0.base| (+ .cse1 (- 4294967296))) |c_#length|))))) (and .cse0 (exists ((v_prenex_12 Int)) (let ((.cse2 (mod (* |c_calloc_model_#in~nmemb| v_prenex_12) 4294967296))) (and (= |c_#length| (store |c_old(#length)| |c_calloc_model_#t~malloc0.base| .cse2)) (<= .cse2 2147483647))))))) .cse3 (or (and (exists ((v_calloc_model_~ptr~5.base_BEFORE_CALL_3 Int) (calloc_model_~size Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int)) (let ((.cse4 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse4) (= (+ (select |c_#length| v_calloc_model_~ptr~5.base_BEFORE_CALL_3) 4294967296) .cse4)))) (exists ((v_prenex_18 Int) (calloc_model_~ptr~5.base Int)) (let ((.cse5 (mod (* |c_calloc_model_#in~nmemb| v_prenex_18) 4294967296))) (and (= (select |c_old(#valid)| calloc_model_~ptr~5.base) 0) (< 2147483647 .cse5) (= (store |c_old(#length)| calloc_model_~ptr~5.base (+ .cse5 (- 4294967296))) |c_#length|))))) (and (exists ((v_prenex_12 Int) (v_prenex_14 Int) (v_prenex_13 Int)) (let ((.cse6 (mod (* v_prenex_14 v_prenex_12) 4294967296))) (and (= (select |c_#length| v_prenex_13) .cse6) (<= .cse6 2147483647)))) (exists ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse7 (mod (* |c_calloc_model_#in~nmemb| v_prenex_23) 4294967296))) (and (= (select |c_old(#valid)| v_prenex_24) 0) (= (store |c_old(#length)| v_prenex_24 (+ .cse7 (- 4294967296))) |c_#length|) (< 2147483647 .cse7))))) (and (exists ((v_prenex_29 Int) (v_prenex_25 Int)) (let ((.cse8 (mod (* |c_calloc_model_#in~nmemb| v_prenex_29) 4294967296))) (and (<= .cse8 2147483647) (= (select |c_old(#valid)| v_prenex_25) 0) (= |c_#length| (store |c_old(#length)| v_prenex_25 .cse8))))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_28 Int)) (let ((.cse9 (mod (* v_prenex_27 v_prenex_26) 4294967296))) (and (<= .cse9 2147483647) (= (select |c_#length| v_prenex_28) .cse9))))) (and (exists ((v_prenex_17 Int) (v_prenex_19 Int)) (let ((.cse10 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (= (select |c_old(#valid)| v_prenex_17) 0) (<= .cse10 2147483647) (= |c_#length| (store |c_old(#length)| v_prenex_17 .cse10))))) (exists ((v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse11 (mod (* v_prenex_22 v_prenex_21) 4294967296))) (and (< 2147483647 .cse11) (= (+ (select |c_#length| v_prenex_20) 4294967296) .cse11)))))) (= .cse12 .cse13) (let ((.cse18 (select |c_#length| |c_calloc_model_#t~malloc0.base|)) (.cse15 (= (select |c_#valid| |c_calloc_model_#t~malloc0.base|) 1)) (.cse17 (= 0 |c_calloc_model_#t~malloc0.offset|))) (or (and .cse14 .cse15 .cse16 .cse17 (= (+ .cse18 4294967296) .cse19) .cse20) (and .cse14 (= .cse18 .cse19) .cse15 .cse16 .cse17 .cse21))) (= (select |c_#length| |c_calloc_model_#res.base|) .cse13) (let ((.cse22 (= (select |c_old(#valid)| c_calloc_model_~ptr~5.base) 0))) (or (and .cse22 (exists ((calloc_model_~size Int)) (let ((.cse23 (mod (* |c_calloc_model_#in~nmemb| calloc_model_~size) 4294967296))) (and (= |c_#length| (store |c_old(#length)| c_calloc_model_~ptr~5.base (+ .cse23 (- 4294967296)))) (< 2147483647 .cse23))))) (and (exists ((v_prenex_12 Int)) (let ((.cse24 (mod (* |c_calloc_model_#in~nmemb| v_prenex_12) 4294967296))) (and (= (store |c_old(#length)| c_calloc_model_~ptr~5.base .cse24) |c_#length|) (<= .cse24 2147483647)))) .cse22))) (= (select |c_#valid| |c_calloc_model_#res.base|) 1) (or (and .cse14 (= .cse19 .cse12) .cse3 .cse16 .cse25 .cse21) (and .cse14 (= .cse19 (+ .cse12 4294967296)) .cse3 .cse16 .cse25 .cse20)) (= |c_calloc_model_#res.offset| 0) (<= 1 .cse13) .cse25 (<= .cse13 2147483647)))) is different from false [2018-01-24 12:03:10,981 WARN L146 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 116 DAG size of output 47 Received shutdown request... [2018-01-24 12:03:17,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:03:17,528 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:03:17,534 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:03:17,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:03:17 BoogieIcfgContainer [2018-01-24 12:03:17,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:03:17,535 INFO L168 Benchmark]: Toolchain (without parser) took 75970.50 ms. Allocated memory was 291.5 MB in the beginning and 590.3 MB in the end (delta: 298.8 MB). Free memory was 250.5 MB in the beginning and 510.0 MB in the end (delta: -259.4 MB). Peak memory consumption was 39.4 MB. Max. memory is 5.3 GB. [2018-01-24 12:03:17,536 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 291.5 MB. Free memory is still 256.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:03:17,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.55 ms. Allocated memory is still 291.5 MB. Free memory was 250.5 MB in the beginning and 236.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:03:17,537 INFO L168 Benchmark]: Boogie Preprocessor took 48.05 ms. Allocated memory is still 291.5 MB. Free memory was 236.6 MB in the beginning and 234.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:03:17,537 INFO L168 Benchmark]: RCFGBuilder took 698.34 ms. Allocated memory is still 291.5 MB. Free memory was 234.6 MB in the beginning and 181.6 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:03:17,538 INFO L168 Benchmark]: TraceAbstraction took 74986.64 ms. Allocated memory was 291.5 MB in the beginning and 590.3 MB in the end (delta: 298.8 MB). Free memory was 181.6 MB in the beginning and 510.0 MB in the end (delta: -328.4 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:03:17,540 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 291.5 MB. Free memory is still 256.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 229.55 ms. Allocated memory is still 291.5 MB. Free memory was 250.5 MB in the beginning and 236.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 48.05 ms. Allocated memory is still 291.5 MB. Free memory was 236.6 MB in the beginning and 234.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 698.34 ms. Allocated memory is still 291.5 MB. Free memory was 234.6 MB in the beginning and 181.6 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 74986.64 ms. Allocated memory was 291.5 MB in the beginning and 590.3 MB in the end (delta: 298.8 MB). Free memory was 181.6 MB in the beginning and 510.0 MB in the end (delta: -328.4 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 874]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 874). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 14 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 112. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 250 locations, 83 error locations. TIMEOUT Result, 74.9s OverallTime, 9 OverallIterations, 18 TraceHistogramMax, 37.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1889 SDtfs, 502 SDslu, 7314 SDs, 0 SdLazy, 2387 SolverSat, 110 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 808 GetRequests, 713 SyntacticMatches, 3 SemanticMatches, 91 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 58.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred 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, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 68 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 34.9s InterpolantComputationTime, 788 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 779 ConstructedInterpolants, 46 QuantifiedInterpolants, 610663 SizeOfPredicates, 39 NumberOfNonLiveVariables, 3563 ConjunctsInSsa, 217 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 1744/1800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-03-17-550.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-03-17-550.csv Completed graceful shutdown