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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0234_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:58:11,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:58:11,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:58:11,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:58:11,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:58:11,674 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:58:11,674 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:58:11,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:58:11,677 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:58:11,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:58:11,679 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:58:11,679 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:58:11,680 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:58:11,681 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:58:11,681 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:58:11,683 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:58:11,685 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:58:11,686 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:58:11,688 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:58:11,689 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:58:11,690 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:58:11,691 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:58:11,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:58:11,692 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:58:11,693 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:58:11,694 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:58:11,694 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:58:11,694 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:58:11,695 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:58:11,695 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:58:11,695 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:58:11,696 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:58:11,706 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:58:11,706 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:58:11,707 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:58:11,707 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:58:11,707 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:58:11,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:58:11,708 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:58:11,708 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:58:11,708 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:58:11,708 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:58:11,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:58:11,709 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:58:11,709 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:58:11,709 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:58:11,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:58:11,709 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:58:11,709 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:58:11,710 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:58:11,710 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:58:11,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:58:11,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:58:11,710 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:58:11,710 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:58:11,711 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:58:11,711 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:58:11,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:58:11,752 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:58:11,755 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:58:11,757 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:58:11,757 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:58:11,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0234_true-valid-memsafety.i [2018-02-02 08:58:11,937 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:58:11,938 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:58:11,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:58:11,939 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:58:11,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:58:11,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:58:11" (1/1) ... [2018-02-02 08:58:11,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a0ca9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:11, skipping insertion in model container [2018-02-02 08:58:11,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:58:11" (1/1) ... [2018-02-02 08:58:11,957 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:58:11,989 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:58:12,083 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:58:12,101 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:58:12,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:12 WrapperNode [2018-02-02 08:58:12,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:58:12,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:58:12,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:58:12,111 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:58:12,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:12" (1/1) ... [2018-02-02 08:58:12,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:12" (1/1) ... [2018-02-02 08:58:12,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:12" (1/1) ... [2018-02-02 08:58:12,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:12" (1/1) ... [2018-02-02 08:58:12,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:12" (1/1) ... [2018-02-02 08:58:12,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:12" (1/1) ... [2018-02-02 08:58:12,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:12" (1/1) ... [2018-02-02 08:58:12,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:58:12,147 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:58:12,147 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:58:12,148 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:58:12,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:12" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:58:12,188 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:58:12,188 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:58:12,188 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-02 08:58:12,188 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-02 08:58:12,188 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-02 08:58:12,188 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-02 08:58:12,188 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-02 08:58:12,189 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-02 08:58:12,189 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-02 08:58:12,189 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-02 08:58:12,189 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-02 08:58:12,189 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-02 08:58:12,189 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-02 08:58:12,189 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-02 08:58:12,189 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:58:12,189 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 08:58:12,189 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 08:58:12,189 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:58:12,189 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:58:12,189 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:58:12,190 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 08:58:12,190 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 08:58:12,190 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 08:58:12,190 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 08:58:12,190 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 08:58:12,190 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 08:58:12,190 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-02 08:58:12,190 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:58:12,190 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-02 08:58:12,190 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-02 08:58:12,190 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-02 08:58:12,190 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-02 08:58:12,190 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-02 08:58:12,191 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-02 08:58:12,191 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-02 08:58:12,191 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-02 08:58:12,191 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-02 08:58:12,191 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-02 08:58:12,191 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-02 08:58:12,191 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:58:12,192 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:58:12,192 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:58:12,511 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 08:58:12,700 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:58:12,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:58:12 BoogieIcfgContainer [2018-02-02 08:58:12,701 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:58:12,702 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:58:12,702 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:58:12,704 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:58:12,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:58:11" (1/3) ... [2018-02-02 08:58:12,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6368c27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:58:12, skipping insertion in model container [2018-02-02 08:58:12,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:58:12" (2/3) ... [2018-02-02 08:58:12,705 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6368c27f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:58:12, skipping insertion in model container [2018-02-02 08:58:12,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:58:12" (3/3) ... [2018-02-02 08:58:12,707 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0234_true-valid-memsafety.i [2018-02-02 08:58:12,713 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:58:12,719 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2018-02-02 08:58:12,744 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:58:12,744 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:58:12,744 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:58:12,744 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:58:12,745 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:58:12,745 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:58:12,745 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:58:12,745 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:58:12,745 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:58:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2018-02-02 08:58:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 08:58:12,765 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:12,766 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 08:58:12,766 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:58:12,769 INFO L82 PathProgramCache]: Analyzing trace with hash 12092192, now seen corresponding path program 1 times [2018-02-02 08:58:12,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:12,771 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:12,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:12,803 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:12,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:12,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:12,885 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:12,885 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:58:12,886 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:58:12,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:58:12,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:58:12,956 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 3 states. [2018-02-02 08:58:13,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:13,117 INFO L93 Difference]: Finished difference Result 260 states and 279 transitions. [2018-02-02 08:58:13,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:58:13,119 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 08:58:13,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:13,130 INFO L225 Difference]: With dead ends: 260 [2018-02-02 08:58:13,131 INFO L226 Difference]: Without dead ends: 257 [2018-02-02 08:58:13,132 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:58:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-02-02 08:58:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 226. [2018-02-02 08:58:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-02-02 08:58:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 241 transitions. [2018-02-02 08:58:13,176 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 241 transitions. Word has length 4 [2018-02-02 08:58:13,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:13,176 INFO L432 AbstractCegarLoop]: Abstraction has 226 states and 241 transitions. [2018-02-02 08:58:13,177 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:58:13,177 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 241 transitions. [2018-02-02 08:58:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 08:58:13,177 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:13,177 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 08:58:13,177 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:58:13,178 INFO L82 PathProgramCache]: Analyzing trace with hash 12092193, now seen corresponding path program 1 times [2018-02-02 08:58:13,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:13,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:13,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,179 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:13,179 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:13,190 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:58:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:13,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:13,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:58:13,225 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:58:13,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:58:13,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:58:13,225 INFO L87 Difference]: Start difference. First operand 226 states and 241 transitions. Second operand 3 states. [2018-02-02 08:58:13,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:13,313 INFO L93 Difference]: Finished difference Result 233 states and 251 transitions. [2018-02-02 08:58:13,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:58:13,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 08:58:13,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:13,315 INFO L225 Difference]: With dead ends: 233 [2018-02-02 08:58:13,315 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 08:58:13,316 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:58:13,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 08:58:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 225. [2018-02-02 08:58:13,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-02-02 08:58:13,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 240 transitions. [2018-02-02 08:58:13,326 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 240 transitions. Word has length 4 [2018-02-02 08:58:13,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:13,326 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 240 transitions. [2018-02-02 08:58:13,326 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:58:13,327 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 240 transitions. [2018-02-02 08:58:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 08:58:13,327 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:13,327 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:13,327 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:58:13,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1806231127, now seen corresponding path program 1 times [2018-02-02 08:58:13,328 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:13,328 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:13,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,329 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:13,329 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,346 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:58:13,346 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:58:13,347 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:58:13,357 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:13,397 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:13,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:58:13,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:13,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:13,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 08:58:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:13,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:13,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:58:13,453 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:58:13,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:58:13,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:58:13,453 INFO L87 Difference]: Start difference. First operand 225 states and 240 transitions. Second operand 4 states. [2018-02-02 08:58:13,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:13,584 INFO L93 Difference]: Finished difference Result 224 states and 239 transitions. [2018-02-02 08:58:13,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:58:13,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 08:58:13,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:13,585 INFO L225 Difference]: With dead ends: 224 [2018-02-02 08:58:13,585 INFO L226 Difference]: Without dead ends: 224 [2018-02-02 08:58:13,586 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:58:13,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-02 08:58:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-02-02 08:58:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-02 08:58:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 239 transitions. [2018-02-02 08:58:13,595 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 239 transitions. Word has length 17 [2018-02-02 08:58:13,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:13,596 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 239 transitions. [2018-02-02 08:58:13,596 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:58:13,596 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 239 transitions. [2018-02-02 08:58:13,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 08:58:13,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:13,596 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:13,596 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:58:13,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1806231128, now seen corresponding path program 1 times [2018-02-02 08:58:13,597 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:13,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:13,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:13,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,610 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:58:13,611 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:58:13,611 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:58:13,615 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:13,631 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:13,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-02-02 08:58:13,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:13,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-02 08:58:13,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:13,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:58:13,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-02 08:58:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:58:13,726 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:13,726 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:58:13,726 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:58:13,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:58:13,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:58:13,727 INFO L87 Difference]: Start difference. First operand 224 states and 239 transitions. Second operand 4 states. [2018-02-02 08:58:13,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:13,924 INFO L93 Difference]: Finished difference Result 223 states and 238 transitions. [2018-02-02 08:58:13,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:58:13,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 08:58:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:13,925 INFO L225 Difference]: With dead ends: 223 [2018-02-02 08:58:13,925 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 08:58:13,926 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:58:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 08:58:13,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-02-02 08:58:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 08:58:13,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2018-02-02 08:58:13,933 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 17 [2018-02-02 08:58:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:13,933 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2018-02-02 08:58:13,933 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:58:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2018-02-02 08:58:13,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 08:58:13,936 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:13,936 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:13,936 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:58:13,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1639542084, now seen corresponding path program 1 times [2018-02-02 08:58:13,937 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:13,937 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:13,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,937 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:13,937 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:13,956 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:58:13,956 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:58:13,956 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:58:13,961 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:14,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:14,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:58:14,096 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:14,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:58:14,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 08:58:14,159 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1)))) is different from true [2018-02-02 08:58:14,163 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:14,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-02 08:58:14,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:14,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:14,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 08:58:14,176 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~0.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~0.base_BEFORE_CALL_1))) (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1))))) is different from true [2018-02-02 08:58:14,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:14,192 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:14,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 08:58:14,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:14,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 08:58:14,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-02 08:58:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 9 not checked. [2018-02-02 08:58:14,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:58:14,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 08:58:14,271 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 08:58:14,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 08:58:14,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-02 08:58:14,271 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 15 states. [2018-02-02 08:58:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:14,923 INFO L93 Difference]: Finished difference Result 250 states and 270 transitions. [2018-02-02 08:58:14,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 08:58:14,924 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-02 08:58:14,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:14,926 INFO L225 Difference]: With dead ends: 250 [2018-02-02 08:58:14,926 INFO L226 Difference]: Without dead ends: 250 [2018-02-02 08:58:14,927 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=313, Unknown=2, NotChecked=74, Total=462 [2018-02-02 08:58:14,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-02-02 08:58:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 221. [2018-02-02 08:58:14,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-02-02 08:58:14,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 236 transitions. [2018-02-02 08:58:14,954 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 236 transitions. Word has length 142 [2018-02-02 08:58:14,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:14,954 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 236 transitions. [2018-02-02 08:58:14,954 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 08:58:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 236 transitions. [2018-02-02 08:58:14,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 08:58:14,957 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:14,957 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:14,959 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:58:14,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1639542085, now seen corresponding path program 1 times [2018-02-02 08:58:14,959 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:14,959 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:14,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:14,960 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:14,960 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:14,974 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:58:14,975 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:58:14,975 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:58:14,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:15,067 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-02-02 08:58:15,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:58:15,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:58:15,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:58:15,151 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:58:15,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:58:15,152 INFO L87 Difference]: Start difference. First operand 221 states and 236 transitions. Second operand 8 states. [2018-02-02 08:58:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:15,230 INFO L93 Difference]: Finished difference Result 231 states and 246 transitions. [2018-02-02 08:58:15,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:58:15,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-02 08:58:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:15,231 INFO L225 Difference]: With dead ends: 231 [2018-02-02 08:58:15,232 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 08:58:15,232 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:58:15,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 08:58:15,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-02-02 08:58:15,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 08:58:15,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 237 transitions. [2018-02-02 08:58:15,237 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 237 transitions. Word has length 142 [2018-02-02 08:58:15,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:15,238 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 237 transitions. [2018-02-02 08:58:15,238 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:58:15,238 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 237 transitions. [2018-02-02 08:58:15,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 08:58:15,239 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:15,240 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:15,240 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:58:15,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1950053043, now seen corresponding path program 1 times [2018-02-02 08:58:15,240 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:15,240 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:15,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:15,241 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:15,241 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:15,253 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:58:15,253 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:58:15,253 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:58:15,262 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:58:15,458 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:15,556 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 85 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2018-02-02 08:58:15,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:58:15,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 08:58:15,577 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:58:15,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:58:15,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:58:15,577 INFO L87 Difference]: Start difference. First operand 222 states and 237 transitions. Second operand 9 states. [2018-02-02 08:58:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:15,686 INFO L93 Difference]: Finished difference Result 232 states and 247 transitions. [2018-02-02 08:58:15,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:58:15,687 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-02 08:58:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:15,688 INFO L225 Difference]: With dead ends: 232 [2018-02-02 08:58:15,688 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 08:58:15,688 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:58:15,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 08:58:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-02-02 08:58:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-02-02 08:58:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2018-02-02 08:58:15,693 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 148 [2018-02-02 08:58:15,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:15,694 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2018-02-02 08:58:15,694 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:58:15,694 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2018-02-02 08:58:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 08:58:15,696 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:15,696 INFO L351 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:15,696 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:58:15,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2122538629, now seen corresponding path program 2 times [2018-02-02 08:58:15,696 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:15,696 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:15,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:15,697 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:58:15,697 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:15,709 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:58:15,709 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:58:15,709 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:58:15,717 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 08:58:15,753 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:58:15,802 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-02-02 08:58:16,866 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:58:16,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 134 proven. 49 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-02-02 08:58:16,996 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:58:16,997 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 08:58:16,997 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:58:16,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:58:16,997 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:58:16,997 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 11 states. [2018-02-02 08:58:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:58:17,102 INFO L93 Difference]: Finished difference Result 233 states and 248 transitions. [2018-02-02 08:58:17,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:58:17,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 154 [2018-02-02 08:58:17,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:58:17,104 INFO L225 Difference]: With dead ends: 233 [2018-02-02 08:58:17,104 INFO L226 Difference]: Without dead ends: 224 [2018-02-02 08:58:17,104 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-02-02 08:58:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-02-02 08:58:17,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-02-02 08:58:17,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-02-02 08:58:17,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 239 transitions. [2018-02-02 08:58:17,109 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 239 transitions. Word has length 154 [2018-02-02 08:58:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:58:17,110 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 239 transitions. [2018-02-02 08:58:17,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:58:17,110 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 239 transitions. [2018-02-02 08:58:17,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-02 08:58:17,111 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:58:17,112 INFO L351 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:58:17,112 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_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 08:58:17,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1035671411, now seen corresponding path program 3 times [2018-02-02 08:58:17,112 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:58:17,112 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:58:17,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:17,113 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 08:58:17,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:58:17,124 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 08:58:17,124 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 08:58:17,124 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 08:58:17,138 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 08:58:17,163 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:58:17,172 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:58:17,186 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-02-02 08:58:17,280 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 08:58:17,284 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:58:17,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-02-02 08:58:17,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:17,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-02-02 08:58:17,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:19,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-02-02 08:58:19,398 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:19,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-02-02 08:58:19,687 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:19,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 08:58:19,715 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-02 08:58:22,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-02-02 08:58:22,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:22,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-02-02 08:58:22,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:22,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-02 08:58:22,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:22,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-02-02 08:58:22,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:22,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-02 08:58:22,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-02 08:58:22,500 WARN L1033 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_15 Int) (calloc_model_~size Int) (v_prenex_13 Int)) (let ((.cse0 (mod (* v_prenex_13 calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_prenex_15) 4294967296) .cse0) (< 2147483647 .cse0)))) (exists ((v_prenex_12 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse1 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| v_prenex_12) 4294967296))) (and (= .cse1 (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3)) (<= .cse1 2147483647))))) is different from true [2018-02-02 08:58:24,531 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_prenex_12 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse7 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| v_prenex_12) 4294967296))) (and (= .cse7 (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3)) (<= .cse7 2147483647))))) (.cse0 (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| v_prenex_18) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_17)) (= (store |c_old(#length)| v_prenex_17 (+ .cse6 (- 4294967296))) |c_#length|) (< 2147483647 .cse6))))) (.cse3 (exists ((v_prenex_15 Int) (calloc_model_~size Int) (v_prenex_13 Int)) (let ((.cse5 (mod (* v_prenex_13 calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_prenex_15) 4294967296) .cse5) (< 2147483647 .cse5))))) (.cse2 (exists ((calloc_model_~ptr~0.base Int) (v_prenex_19 Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse4 2147483647) (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse4) |c_#length|)))))) (or (and .cse0 .cse1) (and .cse1 .cse2) (and .cse0 .cse3) (and .cse3 .cse2))) is different from true [2018-02-02 08:58:25,181 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse0 (mod (* |c_calloc_model_#in~nmemb| v_prenex_18) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_17)) (= (store |c_old(#length)| v_prenex_17 (+ .cse0 (- 4294967296))) |c_#length|) (< 2147483647 .cse0)))) (exists ((v_prenex_12 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse1 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| v_prenex_12) 4294967296))) (and (= .cse1 (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3)) (<= .cse1 2147483647))))) (and (exists ((v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse2 (mod (* v_prenex_21 v_prenex_20) 4294967296))) (and (<= .cse2 2147483647) (= .cse2 (select |c_#length| v_prenex_22))))) (exists ((calloc_model_~ptr~0.base Int) (v_prenex_19 Int)) (let ((.cse3 (mod (* |c_calloc_model_#in~nmemb| v_prenex_19) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse3 2147483647) (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse3) |c_#length|))))) (and (exists ((v_prenex_15 Int) (calloc_model_~size Int) (v_prenex_13 Int)) (let ((.cse4 (mod (* v_prenex_13 calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_prenex_15) 4294967296) .cse4) (< 2147483647 .cse4)))) (exists ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse5 (mod (* |c_calloc_model_#in~nmemb| v_prenex_23) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_24)) (= (store |c_old(#length)| v_prenex_24 (+ .cse5 (- 4294967296))) |c_#length|) (< 2147483647 .cse5))))) (and (exists ((v_prenex_29 Int) (v_prenex_28 Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| v_prenex_29) 4294967296))) (and (<= .cse6 2147483647) (= |c_#length| (store |c_old(#length)| v_prenex_28 .cse6)) (= 0 (select |c_old(#valid)| v_prenex_28))))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_25 Int)) (let ((.cse7 (mod (* v_prenex_27 v_prenex_26) 4294967296))) (and (< 2147483647 .cse7) (= (+ (select |c_#length| v_prenex_25) 4294967296) .cse7)))))) is different from true [2018-02-02 08:58:25,198 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_29 Int) (v_prenex_28 Int)) (let ((.cse0 (mod v_prenex_29 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_28 .cse0)) (<= .cse0 2147483647) (= (select |c_old(#valid)| v_prenex_28) 0)))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_25 Int)) (let ((.cse1 (mod (* v_prenex_27 v_prenex_26) 4294967296))) (and (< 2147483647 .cse1) (= (+ (select |c_#length| v_prenex_25) 4294967296) .cse1))))) (and (exists ((v_prenex_12 Int) (|v_calloc_model_#in~nmemb_BEFORE_CALL_5| Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (let ((.cse2 (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_5| v_prenex_12) 4294967296))) (and (= .cse2 (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3)) (<= .cse2 2147483647)))) (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse3 (mod v_prenex_18 4294967296))) (and (= (select |c_old(#valid)| v_prenex_17) 0) (< 2147483647 .cse3) (= |c_#length| (store |c_old(#length)| v_prenex_17 (+ .cse3 (- 4294967296)))))))) (and (exists ((v_prenex_15 Int) (calloc_model_~size Int) (v_prenex_13 Int)) (let ((.cse4 (mod (* v_prenex_13 calloc_model_~size) 4294967296))) (and (= (+ (select |c_#length| v_prenex_15) 4294967296) .cse4) (< 2147483647 .cse4)))) (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 ((calloc_model_~ptr~0.base Int) (v_prenex_19 Int)) (let ((.cse6 (mod v_prenex_19 4294967296))) (and (= (store |c_old(#length)| calloc_model_~ptr~0.base .cse6) |c_#length|) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (<= .cse6 2147483647)))) (exists ((v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse7 (mod (* v_prenex_21 v_prenex_20) 4294967296))) (and (<= .cse7 2147483647) (= .cse7 (select |c_#length| v_prenex_22))))))) is different from true [2018-02-02 08:58:25,220 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:25,221 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:25,222 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-02-02 08:58:25,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:25,437 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:25,438 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:25,439 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 48 treesize of output 42 [2018-02-02 08:58:25,440 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:25,688 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:25,689 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-02-02 08:58:25,689 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:25,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:25,895 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:25,896 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 52 treesize of output 46 [2018-02-02 08:58:25,896 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,083 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 42 treesize of output 41 [2018-02-02 08:58:26,083 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,259 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:26,259 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 46 treesize of output 55 [2018-02-02 08:58:26,260 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,471 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:26,472 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-02-02 08:58:26,473 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,611 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:26,612 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:58:26,613 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-02-02 08:58:26,613 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 08:58:26,746 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-02-02 08:58:26,746 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 28 variables, input treesize:201, output treesize:165 [2018-02-02 08:58:57,793 WARN L146 SmtUtils]: Spent 30987ms on a formula simplification. DAG size of input: 95 DAG size of output 64 [2018-02-02 08:58:57,851 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 260 proven. 7 refuted. 0 times theorem prover too weak. 237 trivial. 27 not checked. [2018-02-02 08:58:57,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:58:57,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-02-02 08:58:57,868 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-02-02 08:58:57,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-02-02 08:58:57,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=408, Unknown=5, NotChecked=172, Total=650 [2018-02-02 08:58:57,868 INFO L87 Difference]: Start difference. First operand 224 states and 239 transitions. Second operand 26 states. [2018-02-02 08:58:58,241 WARN L146 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 53 DAG size of output 51 [2018-02-02 08:59:13,863 WARN L146 SmtUtils]: Spent 13356ms on a formula simplification. DAG size of input: 78 DAG size of output 76 Received shutdown request... [2018-02-02 08:59:30,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 08:59:30,993 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 08:59:30,996 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 08:59:30,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:59:30 BoogieIcfgContainer [2018-02-02 08:59:30,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:59:30,997 INFO L168 Benchmark]: Toolchain (without parser) took 79059.88 ms. Allocated memory was 397.9 MB in the beginning and 728.8 MB in the end (delta: 330.8 MB). Free memory was 354.6 MB in the beginning and 653.7 MB in the end (delta: -299.1 MB). Peak memory consumption was 31.8 MB. Max. memory is 5.3 GB. [2018-02-02 08:59:30,998 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:59:30,998 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.30 ms. Allocated memory is still 397.9 MB. Free memory was 354.6 MB in the beginning and 342.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 08:59:30,998 INFO L168 Benchmark]: Boogie Preprocessor took 35.90 ms. Allocated memory is still 397.9 MB. Free memory was 342.7 MB in the beginning and 340.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 08:59:30,999 INFO L168 Benchmark]: RCFGBuilder took 553.82 ms. Allocated memory is still 397.9 MB. Free memory was 340.1 MB in the beginning and 287.1 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 5.3 GB. [2018-02-02 08:59:30,999 INFO L168 Benchmark]: TraceAbstraction took 78295.05 ms. Allocated memory was 397.9 MB in the beginning and 728.8 MB in the end (delta: 330.8 MB). Free memory was 287.1 MB in the beginning and 653.7 MB in the end (delta: -366.6 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:59:31,000 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.17 ms. Allocated memory is still 397.9 MB. Free memory is still 361.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 172.30 ms. Allocated memory is still 397.9 MB. Free memory was 354.6 MB in the beginning and 342.7 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.90 ms. Allocated memory is still 397.9 MB. Free memory was 342.7 MB in the beginning and 340.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 553.82 ms. Allocated memory is still 397.9 MB. Free memory was 340.1 MB in the beginning and 287.1 MB in the end (delta: 53.0 MB). Peak memory consumption was 53.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 78295.05 ms. Allocated memory was 397.9 MB in the beginning and 728.8 MB in the end (delta: 330.8 MB). Free memory was 287.1 MB in the beginning and 653.7 MB in the end (delta: -366.6 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 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 830). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 830). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 818). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 818). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 820). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 871). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 865]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 865). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 871). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 860). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 860). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 850). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 850). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 840). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 840). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (224states) and interpolant automaton (currently 11 states, 26 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 127. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 231 locations, 71 error locations. TIMEOUT Result, 78.2s OverallTime, 9 OverallIterations, 18 TraceHistogramMax, 34.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1769 SDtfs, 467 SDslu, 6944 SDs, 0 SdLazy, 2098 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 806 GetRequests, 709 SyntacticMatches, 6 SemanticMatches, 90 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 52.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 68 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 41.2s InterpolantComputationTime, 788 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 779 ConstructedInterpolants, 46 QuantifiedInterpolants, 614983 SizeOfPredicates, 45 NumberOfNonLiveVariables, 3491 ConjunctsInSsa, 198 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 1707/1800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-59-31-008.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-59-31-008.csv Completed graceful shutdown