java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0234_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-a74eeac-m [2018-02-02 18:37:54,769 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 18:37:54,770 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 18:37:54,783 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 18:37:54,783 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 18:37:54,784 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 18:37:54,785 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 18:37:54,787 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 18:37:54,789 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 18:37:54,789 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 18:37:54,790 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 18:37:54,790 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 18:37:54,791 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 18:37:54,792 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 18:37:54,793 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 18:37:54,795 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 18:37:54,796 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 18:37:54,798 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 18:37:54,799 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 18:37:54,799 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 18:37:54,801 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 18:37:54,801 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 18:37:54,801 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 18:37:54,802 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 18:37:54,803 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 18:37:54,804 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 18:37:54,804 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 18:37:54,804 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 18:37:54,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 18:37:54,805 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 18:37:54,805 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 18:37:54,805 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 18:37:54,815 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 18:37:54,815 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 18:37:54,816 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 18:37:54,816 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 18:37:54,816 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 18:37:54,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 18:37:54,817 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 18:37:54,817 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 18:37:54,817 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 18:37:54,817 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 18:37:54,817 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 18:37:54,817 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 18:37:54,817 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 18:37:54,818 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 18:37:54,818 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 18:37:54,818 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 18:37:54,818 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 18:37:54,818 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 18:37:54,818 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 18:37:54,818 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 18:37:54,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:37:54,819 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 18:37:54,819 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 18:37:54,819 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 18:37:54,819 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 18:37:54,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 18:37:54,859 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 18:37:54,862 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 18:37:54,864 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 18:37:54,865 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 18:37:54,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0234_false-valid-memtrack.i [2018-02-02 18:37:55,026 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 18:37:55,027 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 18:37:55,028 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 18:37:55,028 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 18:37:55,032 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 18:37:55,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:37:55" (1/1) ... [2018-02-02 18:37:55,035 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59897e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:55, skipping insertion in model container [2018-02-02 18:37:55,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 06:37:55" (1/1) ... [2018-02-02 18:37:55,044 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:37:55,085 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 18:37:55,171 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:37:55,187 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 18:37:55,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:55 WrapperNode [2018-02-02 18:37:55,196 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 18:37:55,197 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 18:37:55,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 18:37:55,197 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 18:37:55,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:55" (1/1) ... [2018-02-02 18:37:55,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:55" (1/1) ... [2018-02-02 18:37:55,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:55" (1/1) ... [2018-02-02 18:37:55,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:55" (1/1) ... [2018-02-02 18:37:55,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:55" (1/1) ... [2018-02-02 18:37:55,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:55" (1/1) ... [2018-02-02 18:37:55,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:55" (1/1) ... [2018-02-02 18:37:55,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 18:37:55,228 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 18:37:55,228 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 18:37:55,228 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 18:37:55,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:55" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 18:37:55,262 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 18:37:55,262 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 18:37:55,262 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-02 18:37:55,262 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-02 18:37:55,263 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-02 18:37:55,263 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-02 18:37:55,263 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-02 18:37:55,263 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-02 18:37:55,263 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-02 18:37:55,263 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-02 18:37:55,263 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-02 18:37:55,263 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-02 18:37:55,263 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-02 18:37:55,264 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-02 18:37:55,264 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 18:37:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 18:37:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 18:37:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 18:37:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 18:37:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 18:37:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-02 18:37:55,264 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-02 18:37:55,264 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 18:37:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 18:37:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 18:37:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-02 18:37:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-02 18:37:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 18:37:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-02 18:37:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-02 18:37:55,265 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-02 18:37:55,266 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-02 18:37:55,266 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-02 18:37:55,266 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-02 18:37:55,266 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-02 18:37:55,266 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-02 18:37:55,266 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-02 18:37:55,266 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-02 18:37:55,267 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-02 18:37:55,267 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 18:37:55,267 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 18:37:55,267 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 18:37:55,507 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-02 18:37:55,690 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 18:37:55,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:37:55 BoogieIcfgContainer [2018-02-02 18:37:55,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 18:37:55,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 18:37:55,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 18:37:55,693 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 18:37:55,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 06:37:55" (1/3) ... [2018-02-02 18:37:55,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79715b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:37:55, skipping insertion in model container [2018-02-02 18:37:55,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 06:37:55" (2/3) ... [2018-02-02 18:37:55,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79715b31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 06:37:55, skipping insertion in model container [2018-02-02 18:37:55,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 06:37:55" (3/3) ... [2018-02-02 18:37:55,695 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0234_false-valid-memtrack.i [2018-02-02 18:37:55,700 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 18:37:55,707 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-02-02 18:37:55,729 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 18:37:55,729 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 18:37:55,729 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 18:37:55,729 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 18:37:55,729 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 18:37:55,730 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 18:37:55,730 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 18:37:55,730 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 18:37:55,730 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 18:37:55,741 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states. [2018-02-02 18:37:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 18:37:55,748 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:55,749 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 18:37:55,749 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:37:55,752 INFO L82 PathProgramCache]: Analyzing trace with hash 11876704, now seen corresponding path program 1 times [2018-02-02 18:37:55,753 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:55,753 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:55,781 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:55,782 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:55,782 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:55,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:55,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:55,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:55,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:37:55,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:37:55,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:37:55,899 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:37:55,901 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 3 states. [2018-02-02 18:37:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:56,052 INFO L93 Difference]: Finished difference Result 254 states and 273 transitions. [2018-02-02 18:37:56,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:37:56,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 18:37:56,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:56,065 INFO L225 Difference]: With dead ends: 254 [2018-02-02 18:37:56,066 INFO L226 Difference]: Without dead ends: 251 [2018-02-02 18:37:56,067 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:37:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-02-02 18:37:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 219. [2018-02-02 18:37:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 18:37:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-02 18:37:56,109 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 4 [2018-02-02 18:37:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:56,110 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-02 18:37:56,110 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:37:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-02 18:37:56,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 18:37:56,110 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:56,111 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 18:37:56,111 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:37:56,111 INFO L82 PathProgramCache]: Analyzing trace with hash 11876705, now seen corresponding path program 1 times [2018-02-02 18:37:56,111 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:56,111 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:56,112 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:56,112 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:56,112 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:56,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 18:37:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:56,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:56,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 18:37:56,159 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 18:37:56,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 18:37:56,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:37:56,160 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 3 states. [2018-02-02 18:37:56,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:56,252 INFO L93 Difference]: Finished difference Result 226 states and 244 transitions. [2018-02-02 18:37:56,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 18:37:56,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 18:37:56,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:56,255 INFO L225 Difference]: With dead ends: 226 [2018-02-02 18:37:56,255 INFO L226 Difference]: Without dead ends: 226 [2018-02-02 18:37:56,256 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 18:37:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-02-02 18:37:56,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 218. [2018-02-02 18:37:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 18:37:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-02 18:37:56,267 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 4 [2018-02-02 18:37:56,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:56,267 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-02 18:37:56,268 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 18:37:56,268 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-02 18:37:56,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 18:37:56,268 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:56,269 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:56,269 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:37:56,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1969754800, now seen corresponding path program 1 times [2018-02-02 18:37:56,269 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:56,269 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:56,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:56,270 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:56,270 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:56,287 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:37:56,287 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:37:56,287 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:37:56,292 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:56,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:56,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:37:56,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:37:56,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:37:56,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 18:37:56,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:56,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:56,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:37:56,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:37:56,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:37:56,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:37:56,376 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 4 states. [2018-02-02 18:37:56,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:56,480 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-02 18:37:56,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:37:56,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 18:37:56,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:56,481 INFO L225 Difference]: With dead ends: 217 [2018-02-02 18:37:56,481 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 18:37:56,481 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:37:56,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 18:37:56,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-02 18:37:56,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 18:37:56,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-02-02 18:37:56,492 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 17 [2018-02-02 18:37:56,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:56,492 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-02-02 18:37:56,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:37:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-02-02 18:37:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-02 18:37:56,493 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:56,493 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:56,493 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:37:56,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1969754799, now seen corresponding path program 1 times [2018-02-02 18:37:56,494 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:56,494 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:56,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:56,495 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:56,495 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:56,507 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:37:56,508 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:37:56,508 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:37:56,515 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:56,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:56,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-02-02 18:37:56,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:37:56,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-02 18:37:56,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:37:56,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:37:56,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-02 18:37:56,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 18:37:56,637 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:56,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 18:37:56,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 18:37:56,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 18:37:56,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 18:37:56,638 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 4 states. [2018-02-02 18:37:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:56,813 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2018-02-02 18:37:56,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 18:37:56,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-02 18:37:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:56,814 INFO L225 Difference]: With dead ends: 216 [2018-02-02 18:37:56,814 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 18:37:56,815 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-02 18:37:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 18:37:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-02 18:37:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 18:37:56,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-02-02 18:37:56,822 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 17 [2018-02-02 18:37:56,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:56,822 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-02-02 18:37:56,822 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 18:37:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-02-02 18:37:56,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 18:37:56,826 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:56,826 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:56,826 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:37:56,826 INFO L82 PathProgramCache]: Analyzing trace with hash -772454620, now seen corresponding path program 1 times [2018-02-02 18:37:56,826 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:56,827 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:56,827 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:56,828 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:56,828 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:56,844 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:37:56,844 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:37:56,845 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:37:56,849 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:56,958 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:56,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 18:37:56,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:37:56,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 18:37:56,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-02 18:37:57,037 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1)))) is different from true [2018-02-02 18:37:57,042 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:37:57,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-02 18:37:57,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:37:57,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 18:37:57,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-02 18:37:57,055 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~0.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~0.base_BEFORE_CALL_1))) (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1))))) is different from true [2018-02-02 18:37:57,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:37:57,072 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:37:57,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-02 18:37:57,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:37:57,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 18:37:57,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-02 18:37:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 9 not checked. [2018-02-02 18:37:57,146 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:37:57,146 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-02 18:37:57,146 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-02 18:37:57,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-02 18:37:57,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-02 18:37:57,147 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 15 states. [2018-02-02 18:37:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:57,785 INFO L93 Difference]: Finished difference Result 244 states and 264 transitions. [2018-02-02 18:37:57,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-02 18:37:57,785 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-02 18:37:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:57,786 INFO L225 Difference]: With dead ends: 244 [2018-02-02 18:37:57,786 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 18:37:57,787 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=313, Unknown=2, NotChecked=74, Total=462 [2018-02-02 18:37:57,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 18:37:57,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 214. [2018-02-02 18:37:57,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-02-02 18:37:57,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 229 transitions. [2018-02-02 18:37:57,794 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 229 transitions. Word has length 142 [2018-02-02 18:37:57,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:57,794 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 229 transitions. [2018-02-02 18:37:57,795 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-02 18:37:57,795 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 229 transitions. [2018-02-02 18:37:57,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-02 18:37:57,796 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:57,796 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:57,798 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:37:57,798 INFO L82 PathProgramCache]: Analyzing trace with hash -772454619, now seen corresponding path program 1 times [2018-02-02 18:37:57,799 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:57,799 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:57,799 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:57,800 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:57,800 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:57,812 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:37:57,812 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:37:57,813 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:37:57,822 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:57,921 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:57,975 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 18:37:57,993 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 18:37:57,994 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 18:37:57,994 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 18:37:57,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 18:37:57,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 18:37:57,995 INFO L87 Difference]: Start difference. First operand 214 states and 229 transitions. Second operand 8 states. [2018-02-02 18:37:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:58,073 INFO L93 Difference]: Finished difference Result 224 states and 239 transitions. [2018-02-02 18:37:58,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 18:37:58,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-02 18:37:58,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:58,076 INFO L225 Difference]: With dead ends: 224 [2018-02-02 18:37:58,076 INFO L226 Difference]: Without dead ends: 215 [2018-02-02 18:37:58,076 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:37:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-02-02 18:37:58,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-02-02 18:37:58,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-02-02 18:37:58,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 230 transitions. [2018-02-02 18:37:58,081 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 230 transitions. Word has length 142 [2018-02-02 18:37:58,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:58,081 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 230 transitions. [2018-02-02 18:37:58,082 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 18:37:58,082 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 230 transitions. [2018-02-02 18:37:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-02 18:37:58,083 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:58,083 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:58,084 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:37:58,084 INFO L82 PathProgramCache]: Analyzing trace with hash 152413325, now seen corresponding path program 1 times [2018-02-02 18:37:58,084 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:58,084 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:58,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:58,085 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:58,085 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:58,097 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:37:58,097 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:37:58,098 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:37:58,104 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:58,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 18:37:58,302 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:37:58,409 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 18:37:58,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:37:58,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 18:37:58,442 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 18:37:58,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 18:37:58,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 18:37:58,443 INFO L87 Difference]: Start difference. First operand 215 states and 230 transitions. Second operand 9 states. [2018-02-02 18:37:58,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:37:58,606 INFO L93 Difference]: Finished difference Result 225 states and 240 transitions. [2018-02-02 18:37:58,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 18:37:58,607 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-02 18:37:58,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:37:58,608 INFO L225 Difference]: With dead ends: 225 [2018-02-02 18:37:58,608 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 18:37:58,609 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:37:58,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 18:37:58,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-02 18:37:58,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 18:37:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-02-02 18:37:58,614 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 148 [2018-02-02 18:37:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:37:58,614 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-02-02 18:37:58,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 18:37:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-02-02 18:37:58,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-02 18:37:58,616 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:37:58,616 INFO L351 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:37:58,616 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:37:58,617 INFO L82 PathProgramCache]: Analyzing trace with hash -677500123, now seen corresponding path program 2 times [2018-02-02 18:37:58,617 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:37:58,617 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:37:58,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:58,618 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 18:37:58,618 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:37:58,630 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:37:58,630 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:37:58,630 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:37:58,636 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-02 18:38:00,008 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-02 18:38:00,008 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:38:00,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:38:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 99 proven. 56 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-02-02 18:38:00,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:38:00,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 18:38:00,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 18:38:00,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 18:38:00,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 18:38:00,113 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 10 states. [2018-02-02 18:38:00,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:38:00,218 INFO L93 Difference]: Finished difference Result 226 states and 241 transitions. [2018-02-02 18:38:00,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 18:38:00,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2018-02-02 18:38:00,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:38:00,220 INFO L225 Difference]: With dead ends: 226 [2018-02-02 18:38:00,220 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 18:38:00,220 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:38:00,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 18:38:00,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-02-02 18:38:00,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-02-02 18:38:00,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2018-02-02 18:38:00,225 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 232 transitions. Word has length 154 [2018-02-02 18:38:00,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:38:00,225 INFO L432 AbstractCegarLoop]: Abstraction has 217 states and 232 transitions. [2018-02-02 18:38:00,225 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 18:38:00,225 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 232 transitions. [2018-02-02 18:38:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-02 18:38:00,227 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:38:00,227 INFO L351 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:38:00,227 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:38:00,227 INFO L82 PathProgramCache]: Analyzing trace with hash -626793843, now seen corresponding path program 3 times [2018-02-02 18:38:00,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:38:00,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:38:00,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:00,228 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:38:00,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:00,240 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:38:00,241 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:38:00,241 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:38:00,253 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-02 18:38:00,347 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-02 18:38:00,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:38:00,351 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:38:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-02-02 18:38:00,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:38:00,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-02-02 18:38:00,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 18:38:00,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 18:38:00,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-02-02 18:38:00,461 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. Second operand 11 states. [2018-02-02 18:38:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:38:00,559 INFO L93 Difference]: Finished difference Result 227 states and 242 transitions. [2018-02-02 18:38:00,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 18:38:00,559 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 160 [2018-02-02 18:38:00,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:38:00,560 INFO L225 Difference]: With dead ends: 227 [2018-02-02 18:38:00,560 INFO L226 Difference]: Without dead ends: 218 [2018-02-02 18:38:00,560 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-02-02 18:38:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-02-02 18:38:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-02-02 18:38:00,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-02-02 18:38:00,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 233 transitions. [2018-02-02 18:38:00,563 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 233 transitions. Word has length 160 [2018-02-02 18:38:00,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:38:00,563 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 233 transitions. [2018-02-02 18:38:00,563 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 18:38:00,563 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 233 transitions. [2018-02-02 18:38:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-02-02 18:38:00,564 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:38:00,564 INFO L351 BasicCegarLoop]: trace histogram [24, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:38:00,565 INFO L371 AbstractCegarLoop]: === Iteration 10 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:38:00,565 INFO L82 PathProgramCache]: Analyzing trace with hash 262360869, now seen corresponding path program 4 times [2018-02-02 18:38:00,565 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:38:00,565 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:38:00,565 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:00,565 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:38:00,566 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:00,575 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:38:00,575 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:38:00,576 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:38:00,584 INFO L109 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-02-02 18:38:03,912 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-02-02 18:38:03,913 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:38:03,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:38:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 447 proven. 23 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-02-02 18:38:04,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:38:04,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-02 18:38:04,062 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 18:38:04,062 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 18:38:04,062 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 18:38:04,063 INFO L87 Difference]: Start difference. First operand 218 states and 233 transitions. Second operand 12 states. [2018-02-02 18:38:04,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:38:04,190 INFO L93 Difference]: Finished difference Result 228 states and 243 transitions. [2018-02-02 18:38:04,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:38:04,191 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2018-02-02 18:38:04,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:38:04,191 INFO L225 Difference]: With dead ends: 228 [2018-02-02 18:38:04,192 INFO L226 Difference]: Without dead ends: 219 [2018-02-02 18:38:04,192 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-02-02 18:38:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-02-02 18:38:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-02-02 18:38:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-02-02 18:38:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 234 transitions. [2018-02-02 18:38:04,196 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 234 transitions. Word has length 166 [2018-02-02 18:38:04,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:38:04,196 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 234 transitions. [2018-02-02 18:38:04,196 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 18:38:04,196 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 234 transitions. [2018-02-02 18:38:04,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-02-02 18:38:04,197 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:38:04,197 INFO L351 BasicCegarLoop]: trace histogram [30, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:38:04,197 INFO L371 AbstractCegarLoop]: === Iteration 11 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:38:04,197 INFO L82 PathProgramCache]: Analyzing trace with hash -668999539, now seen corresponding path program 5 times [2018-02-02 18:38:04,197 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:38:04,197 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:38:04,198 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:04,198 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:38:04,198 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:04,207 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:38:04,207 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:38:04,208 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:38:04,216 INFO L109 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-02-02 18:38:12,792 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-02-02 18:38:12,793 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:38:12,799 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:38:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 437 proven. 60 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2018-02-02 18:38:12,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:38:12,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-02-02 18:38:12,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 18:38:12,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 18:38:12,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-02-02 18:38:12,913 INFO L87 Difference]: Start difference. First operand 219 states and 234 transitions. Second operand 13 states. [2018-02-02 18:38:13,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 18:38:13,057 INFO L93 Difference]: Finished difference Result 229 states and 244 transitions. [2018-02-02 18:38:13,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 18:38:13,057 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 172 [2018-02-02 18:38:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 18:38:13,058 INFO L225 Difference]: With dead ends: 229 [2018-02-02 18:38:13,058 INFO L226 Difference]: Without dead ends: 220 [2018-02-02 18:38:13,058 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-02-02 18:38:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-02-02 18:38:13,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-02-02 18:38:13,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-02-02 18:38:13,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 235 transitions. [2018-02-02 18:38:13,062 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 235 transitions. Word has length 172 [2018-02-02 18:38:13,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 18:38:13,063 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 235 transitions. [2018-02-02 18:38:13,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 18:38:13,063 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 235 transitions. [2018-02-02 18:38:13,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-02-02 18:38:13,063 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 18:38:13,063 INFO L351 BasicCegarLoop]: trace histogram [36, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 18:38:13,063 INFO L371 AbstractCegarLoop]: === Iteration 12 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr0RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-02 18:38:13,064 INFO L82 PathProgramCache]: Analyzing trace with hash -954944731, now seen corresponding path program 6 times [2018-02-02 18:38:13,064 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 18:38:13,064 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 18:38:13,064 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:13,065 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-02 18:38:13,065 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 18:38:13,073 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-02 18:38:13,074 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-02 18:38:13,074 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-02 18:38:13,079 INFO L109 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-02-02 18:38:14,920 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-02-02 18:38:14,920 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-02 18:38:14,924 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 18:38:14,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-02-02 18:38:14,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:14,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-02-02 18:38:14,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:14,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 18:38:14,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:56 [2018-02-02 18:38:19,958 WARN L143 SmtUtils]: Spent 2049ms on a formula simplification that was a NOOP. DAG size: 25 [2018-02-02 18:38:20,195 WARN L143 SmtUtils]: Spent 225ms on a formula simplification that was a NOOP. DAG size: 32 [2018-02-02 18:38:21,293 WARN L143 SmtUtils]: Spent 1046ms on a formula simplification that was a NOOP. DAG size: 34 [2018-02-02 18:38:23,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-02 18:38:23,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:23,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-02-02 18:38:23,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:23,607 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 18:38:23,607 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:23,625 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 18:38:23,625 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:23,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-02 18:38:23,641 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-02 18:38:28,838 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_prenex_12 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse7 (mod (* |c_calloc_model_#in~nmemb| v_prenex_12) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= |c_#length| (store |c_old(#length)| calloc_model_~ptr~0.base .cse7)) (<= .cse7 2147483647))))) (.cse2 (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int)) (let ((.cse6 (mod (* v_prenex_3 v_prenex_5) 4294967296))) (and (= (+ (select |c_#length| v_prenex_4) 4294967296) .cse6) (< 2147483647 .cse6))))) (.cse0 (exists ((v_calloc_model_~nmemb_BEFORE_CALL_7 Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_2 Int) (v_calloc_model_~size_BEFORE_CALL_7 Int)) (let ((.cse5 (mod (* v_calloc_model_~nmemb_BEFORE_CALL_7 v_calloc_model_~size_BEFORE_CALL_7) 4294967296))) (and (= (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_2) .cse5) (<= .cse5 2147483647))))) (.cse3 (exists ((calloc_model_~size Int) (v_prenex_17 Int)) (let ((.cse4 (mod (* |c_calloc_model_#in~nmemb| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse4) (= 0 (select |c_old(#valid)| v_prenex_17)) (= (store |c_old(#length)| v_prenex_17 (+ .cse4 (- 4294967296))) |c_#length|)))))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse2 .cse3) (and .cse0 .cse3))) is different from true [2018-02-02 18:38:28,849 WARN L1033 $PredicateComparison]: unable to prove that (or (and (exists ((v_calloc_model_~nmemb_BEFORE_CALL_7 Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_2 Int) (v_calloc_model_~size_BEFORE_CALL_7 Int)) (let ((.cse0 (mod (* v_calloc_model_~nmemb_BEFORE_CALL_7 v_calloc_model_~size_BEFORE_CALL_7) 4294967296))) (and (= (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_2) .cse0) (<= .cse0 2147483647)))) (exists ((v_prenex_12 Int) (calloc_model_~ptr~0.base Int)) (let ((.cse1 (mod (* |c_calloc_model_#in~nmemb| v_prenex_12) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= |c_#length| (store |c_old(#length)| calloc_model_~ptr~0.base .cse1)) (<= .cse1 2147483647))))) (and (exists ((v_prenex_4 Int) (v_prenex_5 Int) (v_prenex_3 Int)) (let ((.cse2 (mod (* v_prenex_3 v_prenex_5) 4294967296))) (and (= (+ (select |c_#length| v_prenex_4) 4294967296) .cse2) (< 2147483647 .cse2)))) (exists ((v_prenex_18 Int) (v_prenex_19 Int)) (let ((.cse3 (mod (* |c_calloc_model_#in~nmemb| v_prenex_18) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_19)) (= |c_#length| (store |c_old(#length)| v_prenex_19 .cse3)) (<= .cse3 2147483647))))) (and (exists ((v_prenex_22 Int) (v_prenex_21 Int) (v_prenex_20 Int)) (let ((.cse4 (mod (* v_prenex_22 v_prenex_21) 4294967296))) (and (< 2147483647 .cse4) (= (+ (select |c_#length| v_prenex_20) 4294967296) .cse4)))) (exists ((calloc_model_~size Int) (v_prenex_17 Int)) (let ((.cse5 (mod (* |c_calloc_model_#in~nmemb| calloc_model_~size) 4294967296))) (and (< 2147483647 .cse5) (= 0 (select |c_old(#valid)| v_prenex_17)) (= (store |c_old(#length)| v_prenex_17 (+ .cse5 (- 4294967296))) |c_#length|))))) (and (exists ((v_prenex_23 Int) (v_prenex_24 Int)) (let ((.cse6 (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 (+ .cse6 (- 4294967296))) |c_#length|) (< 2147483647 .cse6)))) (exists ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_25 Int)) (let ((.cse7 (mod (* v_prenex_27 v_prenex_26) 4294967296))) (and (<= .cse7 2147483647) (= (select |c_#length| v_prenex_25) .cse7)))))) is different from true [2018-02-02 18:38:53,476 WARN L146 SmtUtils]: Spent 20129ms on a formula simplification. DAG size of input: 96 DAG size of output 29 [2018-02-02 18:38:53,489 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:38:53,490 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:38:53,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2018-02-02 18:38:53,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:53,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:38:53,510 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:38:53,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 27 [2018-02-02 18:38:53,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:53,530 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:38:53,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2018-02-02 18:38:53,531 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:53,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:38:53,546 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 18:38:53,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-02-02 18:38:53,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 18:38:53,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-02-02 18:38:53,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:67, output treesize:49 [2018-02-02 18:38:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1116 backedges. 522 proven. 66 refuted. 0 times theorem prover too weak. 525 trivial. 3 not checked. [2018-02-02 18:38:55,683 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 18:38:55,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-02-02 18:38:55,684 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 18:38:55,684 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 18:38:55,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=8, NotChecked=86, Total=600 [2018-02-02 18:38:55,684 INFO L87 Difference]: Start difference. First operand 220 states and 235 transitions. Second operand 25 states. [2018-02-02 18:38:59,819 WARN L143 SmtUtils]: Spent 2020ms on a formula simplification that was a NOOP. DAG size: 31 [2018-02-02 18:39:00,597 WARN L143 SmtUtils]: Spent 730ms on a formula simplification that was a NOOP. DAG size: 34 [2018-02-02 18:39:02,658 WARN L143 SmtUtils]: Spent 2018ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-02 18:39:04,835 WARN L146 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 49 DAG size of output 47 [2018-02-02 18:39:05,790 WARN L146 SmtUtils]: Spent 788ms on a formula simplification. DAG size of input: 72 DAG size of output 70 [2018-02-02 18:39:07,958 WARN L143 SmtUtils]: Spent 2016ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-02 18:39:08,592 WARN L143 SmtUtils]: Spent 599ms on a formula simplification that was a NOOP. DAG size: 40 [2018-02-02 18:39:12,903 WARN L146 SmtUtils]: Spent 4270ms on a formula simplification. DAG size of input: 45 DAG size of output 42 Received shutdown request... [2018-02-02 18:39:44,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-02 18:39:44,238 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 18:39:44,241 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 18:39:44,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 06:39:44 BoogieIcfgContainer [2018-02-02 18:39:44,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 18:39:44,242 INFO L168 Benchmark]: Toolchain (without parser) took 109215.64 ms. Allocated memory was 399.5 MB in the beginning and 687.9 MB in the end (delta: 288.4 MB). Free memory was 356.4 MB in the beginning and 557.2 MB in the end (delta: -200.8 MB). Peak memory consumption was 87.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:39:44,243 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 18:39:44,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.76 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 344.5 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 18:39:44,243 INFO L168 Benchmark]: Boogie Preprocessor took 31.41 ms. Allocated memory is still 399.5 MB. Free memory was 344.5 MB in the beginning and 341.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 18:39:44,243 INFO L168 Benchmark]: RCFGBuilder took 462.16 ms. Allocated memory is still 399.5 MB. Free memory was 341.8 MB in the beginning and 290.6 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 5.3 GB. [2018-02-02 18:39:44,243 INFO L168 Benchmark]: TraceAbstraction took 108550.59 ms. Allocated memory was 399.5 MB in the beginning and 687.9 MB in the end (delta: 288.4 MB). Free memory was 290.6 MB in the beginning and 557.2 MB in the end (delta: -266.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 5.3 GB. [2018-02-02 18:39:44,244 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.16 ms. Allocated memory is still 399.5 MB. Free memory is still 363.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 168.76 ms. Allocated memory is still 399.5 MB. Free memory was 356.4 MB in the beginning and 344.5 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.41 ms. Allocated memory is still 399.5 MB. Free memory was 344.5 MB in the beginning and 341.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 462.16 ms. Allocated memory is still 399.5 MB. Free memory was 341.8 MB in the beginning and 290.6 MB in the end (delta: 51.2 MB). Peak memory consumption was 51.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 108550.59 ms. Allocated memory was 399.5 MB in the beginning and 687.9 MB in the end (delta: 288.4 MB). Free memory was 290.6 MB in the beginning and 557.2 MB in the end (delta: -266.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 819). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 818). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 795). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 794). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 864]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 864). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 786). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 785). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 804). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 776). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 775). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 777). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 866). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 866). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (220states) and interpolant automaton (currently 12 states, 25 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 116. - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 224 locations, 67 error locations. TIMEOUT Result, 108.5s OverallTime, 12 OverallIterations, 36 TraceHistogramMax, 50.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2368 SDtfs, 488 SDslu, 12908 SDs, 0 SdLazy, 2666 SolverSat, 113 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1328 GetRequests, 1194 SyntacticMatches, 5 SemanticMatches, 128 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 54.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 70 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 15.4s SatisfiabilityAnalysisTime, 41.6s InterpolantComputationTime, 1304 NumberOfCodeBlocks, 1022 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1292 ConstructedInterpolants, 52 QuantifiedInterpolants, 759547 SizeOfPredicates, 63 NumberOfNonLiveVariables, 5050 ConjunctsInSsa, 308 ConjunctsInUnsatCore, 12 InterpolantComputations, 5 PerfectInterpolantSequences, 4267/4491 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_18-39-44-249.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0234_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_18-39-44-249.csv Completed graceful shutdown