java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-03 23:31:33,587 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-03 23:31:33,588 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-03 23:31:33,599 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-03 23:31:33,599 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-03 23:31:33,600 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-03 23:31:33,601 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-03 23:31:33,602 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-03 23:31:33,604 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-03 23:31:33,604 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-03 23:31:33,605 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-03 23:31:33,605 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-03 23:31:33,606 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-03 23:31:33,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-03 23:31:33,607 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-03 23:31:33,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-03 23:31:33,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-03 23:31:33,612 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-03 23:31:33,613 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-03 23:31:33,614 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-03 23:31:33,615 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-03 23:31:33,615 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-03 23:31:33,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-03 23:31:33,616 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-03 23:31:33,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-03 23:31:33,618 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-03 23:31:33,618 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-03 23:31:33,618 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-03 23:31:33,619 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-03 23:31:33,619 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-03 23:31:33,619 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-03 23:31:33,619 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-03 23:31:33,628 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-03 23:31:33,629 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-03 23:31:33,629 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-03 23:31:33,630 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-03 23:31:33,630 INFO L133 SettingsManager]: * Use SBE=true [2018-02-03 23:31:33,630 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-03 23:31:33,630 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-03 23:31:33,630 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-03 23:31:33,630 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-03 23:31:33,630 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-03 23:31:33,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-03 23:31:33,631 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-03 23:31:33,631 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-03 23:31:33,631 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-03 23:31:33,631 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-03 23:31:33,631 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-03 23:31:33,632 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-03 23:31:33,632 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-03 23:31:33,632 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-03 23:31:33,632 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-03 23:31:33,632 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:31:33,632 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-03 23:31:33,633 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-03 23:31:33,633 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-03 23:31:33,633 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-03 23:31:33,661 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-03 23:31:33,671 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-03 23:31:33,674 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-03 23:31:33,676 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-03 23:31:33,677 INFO L276 PluginConnector]: CDTParser initialized [2018-02-03 23:31:33,677 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0237_true-valid-memsafety.i [2018-02-03 23:31:33,823 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-03 23:31:33,824 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-03 23:31:33,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-03 23:31:33,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-03 23:31:33,831 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-03 23:31:33,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:31:33" (1/1) ... [2018-02-03 23:31:33,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ece180a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:33, skipping insertion in model container [2018-02-03 23:31:33,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.02 11:31:33" (1/1) ... [2018-02-03 23:31:33,847 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:31:33,879 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-03 23:31:33,973 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:31:33,990 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-03 23:31:33,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:33 WrapperNode [2018-02-03 23:31:34,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-03 23:31:34,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-03 23:31:34,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-03 23:31:34,001 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-03 23:31:34,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:33" (1/1) ... [2018-02-03 23:31:34,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:33" (1/1) ... [2018-02-03 23:31:34,017 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:33" (1/1) ... [2018-02-03 23:31:34,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:33" (1/1) ... [2018-02-03 23:31:34,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:33" (1/1) ... [2018-02-03 23:31:34,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:33" (1/1) ... [2018-02-03 23:31:34,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:33" (1/1) ... [2018-02-03 23:31:34,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-03 23:31:34,030 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-03 23:31:34,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-03 23:31:34,030 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-03 23:31:34,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:33" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-03 23:31:34,065 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-03 23:31:34,065 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-03 23:31:34,065 INFO L136 BoogieDeclarations]: Found implementation of procedure calloc_model [2018-02-03 23:31:34,065 INFO L136 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2018-02-03 23:31:34,065 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_insert [2018-02-03 23:31:34,065 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_insert [2018-02-03 23:31:34,065 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_insert [2018-02-03 23:31:34,065 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_insert [2018-02-03 23:31:34,065 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_insert [2018-02-03 23:31:34,065 INFO L136 BoogieDeclarations]: Found implementation of procedure l4_destroy [2018-02-03 23:31:34,065 INFO L136 BoogieDeclarations]: Found implementation of procedure l3_destroy [2018-02-03 23:31:34,065 INFO L136 BoogieDeclarations]: Found implementation of procedure l2_destroy [2018-02-03 23:31:34,066 INFO L136 BoogieDeclarations]: Found implementation of procedure l1_destroy [2018-02-03 23:31:34,066 INFO L136 BoogieDeclarations]: Found implementation of procedure l0_destroy [2018-02-03 23:31:34,066 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-03 23:31:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-03 23:31:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-03 23:31:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-03 23:31:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-03 23:31:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-03 23:31:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-02-03 23:31:34,066 INFO L136 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-02-03 23:31:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-03 23:31:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-03 23:31:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-03 23:31:34,066 INFO L128 BoogieDeclarations]: Found specification of procedure memset [2018-02-03 23:31:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure calloc_model [2018-02-03 23:31:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-03 23:31:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2018-02-03 23:31:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure l4_insert [2018-02-03 23:31:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure l3_insert [2018-02-03 23:31:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure l2_insert [2018-02-03 23:31:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure l1_insert [2018-02-03 23:31:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure l0_insert [2018-02-03 23:31:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure l4_destroy [2018-02-03 23:31:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure l3_destroy [2018-02-03 23:31:34,067 INFO L128 BoogieDeclarations]: Found specification of procedure l2_destroy [2018-02-03 23:31:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure l1_destroy [2018-02-03 23:31:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure l0_destroy [2018-02-03 23:31:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-03 23:31:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-03 23:31:34,068 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-03 23:31:34,339 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-02-03 23:31:34,529 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-03 23:31:34,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:31:34 BoogieIcfgContainer [2018-02-03 23:31:34,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-03 23:31:34,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-03 23:31:34,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-03 23:31:34,532 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-03 23:31:34,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.02 11:31:33" (1/3) ... [2018-02-03 23:31:34,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799dc3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:31:34, skipping insertion in model container [2018-02-03 23:31:34,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.02 11:31:33" (2/3) ... [2018-02-03 23:31:34,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@799dc3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.02 11:31:34, skipping insertion in model container [2018-02-03 23:31:34,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.02 11:31:34" (3/3) ... [2018-02-03 23:31:34,534 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0237_true-valid-memsafety.i [2018-02-03 23:31:34,539 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-03 23:31:34,543 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 83 error locations. [2018-02-03 23:31:34,573 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-03 23:31:34,573 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-03 23:31:34,574 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-03 23:31:34,574 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-03 23:31:34,574 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-03 23:31:34,574 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-03 23:31:34,574 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-03 23:31:34,574 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-03 23:31:34,575 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-03 23:31:34,589 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states. [2018-02-03 23:31:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:31:34,596 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:34,597 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:31:34,597 INFO L371 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:34,601 INFO L82 PathProgramCache]: Analyzing trace with hash 12677088, now seen corresponding path program 1 times [2018-02-03 23:31:34,603 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:34,603 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:34,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:34,646 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:34,646 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:34,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:34,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:31:34,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:31:34,719 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:31:34,719 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:31:34,720 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:31:34,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:31:34,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:31:34,733 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 3 states. [2018-02-03 23:31:34,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:34,951 INFO L93 Difference]: Finished difference Result 279 states and 298 transitions. [2018-02-03 23:31:34,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:31:34,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:31:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:34,961 INFO L225 Difference]: With dead ends: 279 [2018-02-03 23:31:34,961 INFO L226 Difference]: Without dead ends: 276 [2018-02-03 23:31:34,962 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:31:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-02-03 23:31:34,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 245. [2018-02-03 23:31:34,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-02-03 23:31:34,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 260 transitions. [2018-02-03 23:31:34,997 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 260 transitions. Word has length 4 [2018-02-03 23:31:34,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:34,998 INFO L432 AbstractCegarLoop]: Abstraction has 245 states and 260 transitions. [2018-02-03 23:31:34,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:31:34,998 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 260 transitions. [2018-02-03 23:31:34,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-03 23:31:34,998 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:34,998 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-03 23:31:34,999 INFO L371 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:34,999 INFO L82 PathProgramCache]: Analyzing trace with hash 12677089, now seen corresponding path program 1 times [2018-02-03 23:31:34,999 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:34,999 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:35,000 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:35,000 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:35,000 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:35,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-03 23:31:35,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:31:35,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:31:35,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-03 23:31:35,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-03 23:31:35,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-03 23:31:35,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:31:35,051 INFO L87 Difference]: Start difference. First operand 245 states and 260 transitions. Second operand 3 states. [2018-02-03 23:31:35,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:35,132 INFO L93 Difference]: Finished difference Result 252 states and 270 transitions. [2018-02-03 23:31:35,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-03 23:31:35,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-03 23:31:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:35,134 INFO L225 Difference]: With dead ends: 252 [2018-02-03 23:31:35,134 INFO L226 Difference]: Without dead ends: 252 [2018-02-03 23:31:35,135 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-03 23:31:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-02-03 23:31:35,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 244. [2018-02-03 23:31:35,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-03 23:31:35,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 259 transitions. [2018-02-03 23:31:35,147 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 259 transitions. Word has length 4 [2018-02-03 23:31:35,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:35,148 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 259 transitions. [2018-02-03 23:31:35,148 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-03 23:31:35,148 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 259 transitions. [2018-02-03 23:31:35,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:31:35,149 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:35,149 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:31:35,149 INFO L371 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:35,149 INFO L82 PathProgramCache]: Analyzing trace with hash -144742640, now seen corresponding path program 1 times [2018-02-03 23:31:35,149 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:35,149 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:35,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:35,150 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:35,150 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:35,174 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:35,174 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:35,174 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:35,182 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:35,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:35,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:31:35,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:35,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:31:35,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:31:35,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:31:35,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:31:35,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:31:35,275 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:31:35,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:31:35,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:31:35,276 INFO L87 Difference]: Start difference. First operand 244 states and 259 transitions. Second operand 4 states. [2018-02-03 23:31:35,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:35,432 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2018-02-03 23:31:35,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:31:35,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-03 23:31:35,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:35,434 INFO L225 Difference]: With dead ends: 243 [2018-02-03 23:31:35,434 INFO L226 Difference]: Without dead ends: 243 [2018-02-03 23:31:35,434 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:31:35,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-03 23:31:35,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-02-03 23:31:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-02-03 23:31:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 258 transitions. [2018-02-03 23:31:35,443 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 258 transitions. Word has length 17 [2018-02-03 23:31:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:35,443 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 258 transitions. [2018-02-03 23:31:35,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:31:35,444 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 258 transitions. [2018-02-03 23:31:35,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-03 23:31:35,444 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:35,444 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:31:35,444 INFO L371 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:35,445 INFO L82 PathProgramCache]: Analyzing trace with hash -144742639, now seen corresponding path program 1 times [2018-02-03 23:31:35,445 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:35,445 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:35,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:35,446 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:35,446 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:35,458 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:35,458 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:35,458 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:35,463 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:35,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:35,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-02-03 23:31:35,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:35,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-03 23:31:35,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:35,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:31:35,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:44 [2018-02-03 23:31:35,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-03 23:31:35,574 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:31:35,574 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-03 23:31:35,574 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-03 23:31:35,574 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-03 23:31:35,574 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-03 23:31:35,574 INFO L87 Difference]: Start difference. First operand 243 states and 258 transitions. Second operand 4 states. [2018-02-03 23:31:35,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:35,727 INFO L93 Difference]: Finished difference Result 242 states and 257 transitions. [2018-02-03 23:31:35,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-03 23:31:35,727 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-03 23:31:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:35,728 INFO L225 Difference]: With dead ends: 242 [2018-02-03 23:31:35,729 INFO L226 Difference]: Without dead ends: 242 [2018-02-03 23:31:35,729 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-03 23:31:35,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-02-03 23:31:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-02-03 23:31:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-02-03 23:31:35,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 257 transitions. [2018-02-03 23:31:35,737 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 257 transitions. Word has length 17 [2018-02-03 23:31:35,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:35,737 INFO L432 AbstractCegarLoop]: Abstraction has 242 states and 257 transitions. [2018-02-03 23:31:35,737 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-03 23:31:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 257 transitions. [2018-02-03 23:31:35,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-03 23:31:35,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:35,741 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:31:35,742 INFO L371 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:35,742 INFO L82 PathProgramCache]: Analyzing trace with hash -515979882, now seen corresponding path program 1 times [2018-02-03 23:31:35,742 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:35,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:35,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:35,743 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:35,743 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:35,759 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:35,760 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:35,760 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:35,766 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:35,849 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:35,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-03 23:31:35,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:35,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-03 23:31:35,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-02-03 23:31:35,928 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1)))) is different from true [2018-02-03 23:31:35,932 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:31:35,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-02-03 23:31:35,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:35,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-03 23:31:35,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-02-03 23:31:35,942 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_calloc_model_~ptr~0.base_BEFORE_CALL_1 Int)) (= 1 (select |c_#valid| v_calloc_model_~ptr~0.base_BEFORE_CALL_1))) (exists ((|calloc_model_#t~malloc0.base| Int)) (and (= 0 (select |c_old(#valid)| |calloc_model_#t~malloc0.base|)) (= |c_#valid| (store |c_old(#valid)| |calloc_model_#t~malloc0.base| 1))))) is different from true [2018-02-03 23:31:35,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:31:35,955 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:31:35,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-02-03 23:31:35,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:35,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:31:35,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:20 [2018-02-03 23:31:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 9 not checked. [2018-02-03 23:31:36,032 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:31:36,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-02-03 23:31:36,032 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-02-03 23:31:36,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-02-03 23:31:36,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=125, Unknown=2, NotChecked=46, Total=210 [2018-02-03 23:31:36,033 INFO L87 Difference]: Start difference. First operand 242 states and 257 transitions. Second operand 15 states. [2018-02-03 23:31:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:36,670 INFO L93 Difference]: Finished difference Result 267 states and 287 transitions. [2018-02-03 23:31:36,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-03 23:31:36,671 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 142 [2018-02-03 23:31:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:36,673 INFO L225 Difference]: With dead ends: 267 [2018-02-03 23:31:36,673 INFO L226 Difference]: Without dead ends: 267 [2018-02-03 23:31:36,673 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=313, Unknown=2, NotChecked=74, Total=462 [2018-02-03 23:31:36,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-02-03 23:31:36,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 238. [2018-02-03 23:31:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-02-03 23:31:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 253 transitions. [2018-02-03 23:31:36,681 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 253 transitions. Word has length 142 [2018-02-03 23:31:36,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:36,682 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 253 transitions. [2018-02-03 23:31:36,682 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-02-03 23:31:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 253 transitions. [2018-02-03 23:31:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-02-03 23:31:36,684 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:36,684 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:31:36,684 INFO L371 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:36,684 INFO L82 PathProgramCache]: Analyzing trace with hash -515979881, now seen corresponding path program 1 times [2018-02-03 23:31:36,684 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:36,685 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:36,685 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:36,686 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:36,686 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:36,698 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:36,698 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:36,698 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:36,716 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:36,807 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:36,888 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-02-03 23:31:36,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-03 23:31:36,917 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-03 23:31:36,917 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-03 23:31:36,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-03 23:31:36,918 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-03 23:31:36,918 INFO L87 Difference]: Start difference. First operand 238 states and 253 transitions. Second operand 8 states. [2018-02-03 23:31:37,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:37,039 INFO L93 Difference]: Finished difference Result 248 states and 263 transitions. [2018-02-03 23:31:37,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-03 23:31:37,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2018-02-03 23:31:37,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:37,041 INFO L225 Difference]: With dead ends: 248 [2018-02-03 23:31:37,041 INFO L226 Difference]: Without dead ends: 239 [2018-02-03 23:31:37,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-03 23:31:37,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-02-03 23:31:37,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-02-03 23:31:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-02-03 23:31:37,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 254 transitions. [2018-02-03 23:31:37,047 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 254 transitions. Word has length 142 [2018-02-03 23:31:37,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:37,047 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 254 transitions. [2018-02-03 23:31:37,047 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-03 23:31:37,047 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2018-02-03 23:31:37,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-02-03 23:31:37,049 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:37,049 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:31:37,049 INFO L371 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:37,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1585380729, now seen corresponding path program 1 times [2018-02-03 23:31:37,049 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:37,049 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:37,050 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:37,050 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:37,050 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:37,061 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:37,061 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:37,062 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:37,079 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-03 23:31:37,316 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:37,392 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 105 proven. 1 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2018-02-03 23:31:37,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:31:37,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-03 23:31:37,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-03 23:31:37,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-03 23:31:37,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-03 23:31:37,411 INFO L87 Difference]: Start difference. First operand 239 states and 254 transitions. Second operand 9 states. [2018-02-03 23:31:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:37,559 INFO L93 Difference]: Finished difference Result 249 states and 264 transitions. [2018-02-03 23:31:37,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-03 23:31:37,559 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 148 [2018-02-03 23:31:37,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:37,560 INFO L225 Difference]: With dead ends: 249 [2018-02-03 23:31:37,561 INFO L226 Difference]: Without dead ends: 240 [2018-02-03 23:31:37,561 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-03 23:31:37,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-02-03 23:31:37,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2018-02-03 23:31:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-03 23:31:37,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 255 transitions. [2018-02-03 23:31:37,567 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 255 transitions. Word has length 148 [2018-02-03 23:31:37,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:37,567 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 255 transitions. [2018-02-03 23:31:37,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-03 23:31:37,567 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 255 transitions. [2018-02-03 23:31:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-02-03 23:31:37,569 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:37,569 INFO L351 BasicCegarLoop]: trace histogram [12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:31:37,569 INFO L371 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:37,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1111849367, now seen corresponding path program 2 times [2018-02-03 23:31:37,569 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:37,569 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:37,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:37,570 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-03 23:31:37,570 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:37,582 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:37,583 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:37,583 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:37,597 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-02-03 23:31:39,615 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-02-03 23:31:39,615 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:31:39,621 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:44,857 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 267 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-02-03 23:31:44,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:31:44,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-02-03 23:31:44,876 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-03 23:31:44,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-03 23:31:44,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=106, Unknown=3, NotChecked=0, Total=132 [2018-02-03 23:31:44,876 INFO L87 Difference]: Start difference. First operand 240 states and 255 transitions. Second operand 12 states. [2018-02-03 23:31:45,360 WARN L143 SmtUtils]: Spent 468ms on a formula simplification that was a NOOP. DAG size: 19 [2018-02-03 23:31:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-03 23:31:59,524 INFO L93 Difference]: Finished difference Result 250 states and 265 transitions. [2018-02-03 23:31:59,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-03 23:31:59,525 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 154 [2018-02-03 23:31:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-03 23:31:59,526 INFO L225 Difference]: With dead ends: 250 [2018-02-03 23:31:59,526 INFO L226 Difference]: Without dead ends: 241 [2018-02-03 23:31:59,527 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=43, Invalid=192, Unknown=5, NotChecked=0, Total=240 [2018-02-03 23:31:59,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-02-03 23:31:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-02-03 23:31:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-02-03 23:31:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 256 transitions. [2018-02-03 23:31:59,532 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 256 transitions. Word has length 154 [2018-02-03 23:31:59,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-03 23:31:59,532 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 256 transitions. [2018-02-03 23:31:59,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-03 23:31:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 256 transitions. [2018-02-03 23:31:59,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-02-03 23:31:59,534 INFO L343 BasicCegarLoop]: Found error trace [2018-02-03 23:31:59,534 INFO L351 BasicCegarLoop]: trace histogram [18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-03 23:31:59,534 INFO L371 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0RequiresViolation, l3_destroyErr3RequiresViolation, l3_destroyErr1RequiresViolation, l3_destroyErr2RequiresViolation, l3_destroyErr4RequiresViolation, l3_destroyErr5RequiresViolation, l0_insertErr3RequiresViolation, l0_insertErr1RequiresViolation, l0_insertErr5RequiresViolation, l0_insertErr2RequiresViolation, l0_insertErr4RequiresViolation, l0_insertErr0RequiresViolation, l4_destroyErr4RequiresViolation, l4_destroyErr6RequiresViolation, l4_destroyErr2RequiresViolation, l4_destroyErr3RequiresViolation, l4_destroyErr1RequiresViolation, l4_destroyErr7RequiresViolation, l4_destroyErr0RequiresViolation, l4_destroyErr5RequiresViolation, l2_insertErr3RequiresViolation, l2_insertErr5RequiresViolation, l2_insertErr0RequiresViolation, l2_insertErr1RequiresViolation, l2_insertErr7RequiresViolation, l2_insertErr4RequiresViolation, l2_insertErr6RequiresViolation, l2_insertErr2RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolation, mainErr0RequiresViolation, l3_insertErr6RequiresViolation, l3_insertErr4RequiresViolation, l3_insertErr0RequiresViolation, l3_insertErr5RequiresViolation, l3_insertErr3RequiresViolation, l3_insertErr1RequiresViolation, l3_insertErr7RequiresViolation, l3_insertErr2RequiresViolation, l1_insertErr4RequiresViolation, l1_insertErr0RequiresViolation, l1_insertErr6RequiresViolation, l1_insertErr2RequiresViolation, l1_insertErr3RequiresViolation, l1_insertErr1RequiresViolation, l1_insertErr7RequiresViolation, l1_insertErr5RequiresViolation, l0_destroyErr5RequiresViolation, l0_destroyErr3RequiresViolation, l0_destroyErr1RequiresViolation, l0_destroyErr0RequiresViolation, l0_destroyErr4RequiresViolation, l0_destroyErr2RequiresViolation, calloc_modelErr0RequiresViolation, calloc_modelErr1RequiresViolation, l4_insertErr3RequiresViolation, l4_insertErr13RequiresViolation, l4_insertErr6RequiresViolation, l4_insertErr8RequiresViolation, l4_insertErr10RequiresViolation, l4_insertErr1RequiresViolation, l4_insertErr5RequiresViolation, l4_insertErr9RequiresViolation, l4_insertErr12RequiresViolation, l4_insertErr4RequiresViolation, l4_insertErr2RequiresViolation, l4_insertErr0RequiresViolation, l4_insertErr11RequiresViolation, l4_insertErr7RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr0RequiresViolation, l1_destroyErr2RequiresViolation, l1_destroyErr4RequiresViolation, l1_destroyErr0RequiresViolation, l1_destroyErr1RequiresViolation, l1_destroyErr5RequiresViolation, l1_destroyErr3RequiresViolation, l2_destroyErr1RequiresViolation, l2_destroyErr0RequiresViolation, l2_destroyErr2RequiresViolation, l2_destroyErr4RequiresViolation, l2_destroyErr5RequiresViolation, l2_destroyErr3RequiresViolation]=== [2018-02-03 23:31:59,535 INFO L82 PathProgramCache]: Analyzing trace with hash 668249593, now seen corresponding path program 3 times [2018-02-03 23:31:59,535 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-03 23:31:59,535 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-03 23:31:59,536 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:59,536 INFO L107 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-02-03 23:31:59,536 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-03 23:31:59,547 ERROR L243 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-02-03 23:31:59,548 INFO L266 seRefinementStrategy]: Advancing trace checker [2018-02-03 23:31:59,548 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-02-03 23:31:59,556 INFO L109 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-02-03 23:31:59,699 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-02-03 23:31:59,700 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-02-03 23:31:59,704 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-03 23:31:59,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-02-03 23:31:59,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:59,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2018-02-03 23:31:59,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:59,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2018-02-03 23:31:59,781 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:59,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-02-03 23:31:59,783 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:31:59,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-03 23:31:59,802 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:70, output treesize:66 [2018-02-03 23:32:04,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-02-03 23:32:04,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:04,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-02-03 23:32:04,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:04,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-02-03 23:32:04,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:04,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-02-03 23:32:04,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:05,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-02-03 23:32:05,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:49, output treesize:37 [2018-02-03 23:32:09,519 WARN L143 SmtUtils]: Spent 509ms on a formula simplification that was a NOOP. DAG size: 29 [2018-02-03 23:32:13,577 WARN L143 SmtUtils]: Spent 4030ms on a formula simplification that was a NOOP. DAG size: 34 [2018-02-03 23:32:17,646 WARN L143 SmtUtils]: Spent 4038ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-03 23:32:21,697 WARN L143 SmtUtils]: Spent 4013ms on a formula simplification that was a NOOP. DAG size: 37 [2018-02-03 23:32:26,201 WARN L146 SmtUtils]: Spent 4466ms on a formula simplification. DAG size of input: 39 DAG size of output 37 [2018-02-03 23:32:27,306 WARN L1033 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((v_prenex_39 Int) (v_prenex_41 Int) (v_prenex_42 Int)) (and (= (mod (* v_prenex_39 v_prenex_42) 4294967296) (+ (select |c_#length| v_prenex_41) 4294967296)) (< 2147483647 (mod (* v_prenex_42 v_prenex_39) 4294967296))))) (.cse4 (exists ((|v_calloc_model_#in~nmemb_BEFORE_CALL_6| Int) (v_calloc_model_~size_BEFORE_CALL_5 Int) (v_calloc_model_~ptr~0.base_BEFORE_CALL_3 Int)) (and (<= (mod (* |v_calloc_model_#in~nmemb_BEFORE_CALL_6| v_calloc_model_~size_BEFORE_CALL_5) 4294967296) 2147483647) (= (select |c_#length| v_calloc_model_~ptr~0.base_BEFORE_CALL_3) (mod (* v_calloc_model_~size_BEFORE_CALL_5 |v_calloc_model_#in~nmemb_BEFORE_CALL_6|) 4294967296)))))) (or (and (exists ((v_prenex_45 Int) (v_prenex_40 Int)) (let ((.cse0 (mod (* |c_calloc_model_#in~nmemb| v_prenex_40) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_45)) (< 2147483647 .cse0) (<= .cse0 4294967299) (< 4294967298 .cse0) (= |c_#length| (store |c_old(#length)| v_prenex_45 (+ .cse0 (- 4294967296))))))) .cse1) (and (exists ((v_prenex_38 Int) (v_prenex_34 Int)) (let ((.cse2 (mod (* |c_calloc_model_#in~nmemb| v_prenex_34) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_38)) (< 2 .cse2) (<= .cse2 3) (= (store |c_old(#length)| v_prenex_38 .cse2) |c_#length|) (<= .cse2 2147483647)))) (exists ((v_prenex_37 Int) (v_prenex_36 Int) (v_prenex_35 Int)) (and (<= (mod (* v_prenex_37 v_prenex_35) 4294967296) 2147483647) (= (select |c_#length| v_prenex_36) (mod (* v_prenex_35 v_prenex_37) 4294967296))))) (and .cse1 (exists ((v_prenex_44 Int) (v_prenex_43 Int)) (let ((.cse3 (mod (* |c_calloc_model_#in~nmemb| v_prenex_43) 4294967296))) (and (= 0 (select |c_old(#valid)| v_prenex_44)) (< 2147483647 .cse3) (= |c_#length| (store |c_old(#length)| v_prenex_44 (+ .cse3 (- 4294967296)))) (< 2 .cse3) (<= .cse3 3) (<= .cse3 2147483647))))) (and .cse4 (exists ((v_prenex_30 Int) (v_prenex_31 Int)) (let ((.cse5 (mod (* |c_calloc_model_#in~nmemb| v_prenex_30) 4294967296))) (and (< 2 .cse5) (<= .cse5 3) (<= .cse5 2147483647) (= (store |c_old(#length)| v_prenex_31 (+ .cse5 (- 4294967296))) |c_#length|) (= 0 (select |c_old(#valid)| v_prenex_31)) (< 2147483647 .cse5))))) (and .cse4 (exists ((calloc_model_~size Int) (calloc_model_~ptr~0.base Int)) (let ((.cse6 (mod (* |c_calloc_model_#in~nmemb| calloc_model_~size) 4294967296))) (and (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (< 2147483647 .cse6) (= (store |c_old(#length)| calloc_model_~ptr~0.base (+ .cse6 (- 4294967296))) |c_#length|) (<= .cse6 4294967299) (< 4294967298 .cse6))))) (and (exists ((v_prenex_26 Int) (v_prenex_28 Int) (v_prenex_25 Int)) (and (< 2147483647 (mod (* v_prenex_25 v_prenex_26) 4294967296)) (= (mod (* v_prenex_26 v_prenex_25) 4294967296) (+ (select |c_#length| v_prenex_28) 4294967296)))) (exists ((v_prenex_33 Int) (v_prenex_32 Int)) (let ((.cse7 (mod (* |c_calloc_model_#in~nmemb| v_prenex_32) 4294967296))) (and (= |c_#length| (store |c_old(#length)| v_prenex_33 .cse7)) (< 2 .cse7) (<= .cse7 3) (<= .cse7 2147483647) (= 0 (select |c_old(#valid)| v_prenex_33)))))))) is different from true [2018-02-03 23:32:27,465 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_38 Int) (v_prenex_34 Int)) (let ((.cse0 (mod v_prenex_34 4294967296))) (and (<= .cse0 3) (= (select |c_old(#valid)| v_prenex_38) 0) (< 2 .cse0) (= |c_#length| (store |c_old(#length)| v_prenex_38 .cse0)) (<= .cse0 2147483647)))) is different from true [2018-02-03 23:32:27,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:27,473 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:27,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 25 [2018-02-03 23:32:27,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:27,483 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:27,484 INFO L700 Elim1Store]: detected not equals via solver [2018-02-03 23:32:27,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-03 23:32:27,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-03 23:32:27,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-03 23:32:27,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:26 [2018-02-03 23:32:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 531 backedges. 260 proven. 35 refuted. 0 times theorem prover too weak. 231 trivial. 5 not checked. [2018-02-03 23:32:29,056 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-03 23:32:29,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-02-03 23:32:29,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-02-03 23:32:29,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-02-03 23:32:29,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=715, Unknown=13, NotChecked=110, Total=930 [2018-02-03 23:32:29,057 INFO L87 Difference]: Start difference. First operand 241 states and 256 transitions. Second operand 31 states. [2018-02-03 23:32:34,338 WARN L146 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 78 DAG size of output 40 [2018-02-03 23:32:39,020 WARN L146 SmtUtils]: Spent 4216ms on a formula simplification. DAG size of input: 83 DAG size of output 48 [2018-02-03 23:33:01,986 WARN L146 SmtUtils]: Spent 19172ms on a formula simplification. DAG size of input: 202 DAG size of output 56 [2018-02-03 23:33:10,514 WARN L146 SmtUtils]: Spent 678ms on a formula simplification. DAG size of input: 40 DAG size of output 34 [2018-02-03 23:33:17,999 WARN L146 SmtUtils]: Spent 7405ms on a formula simplification. DAG size of input: 83 DAG size of output 63 [2018-02-03 23:33:24,051 WARN L146 SmtUtils]: Spent 5090ms on a formula simplification. DAG size of input: 53 DAG size of output 42 Received shutdown request... [2018-02-03 23:35:22,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-02-03 23:35:22,479 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-03 23:35:22,484 WARN L185 ceAbstractionStarter]: Timeout [2018-02-03 23:35:22,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.02 11:35:22 BoogieIcfgContainer [2018-02-03 23:35:22,484 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-03 23:35:22,485 INFO L168 Benchmark]: Toolchain (without parser) took 228661.15 ms. Allocated memory was 399.0 MB in the beginning and 699.4 MB in the end (delta: 300.4 MB). Free memory was 355.9 MB in the beginning and 505.8 MB in the end (delta: -150.0 MB). Peak memory consumption was 150.4 MB. Max. memory is 5.3 GB. [2018-02-03 23:35:22,486 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-03 23:35:22,486 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.95 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 342.5 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-02-03 23:35:22,486 INFO L168 Benchmark]: Boogie Preprocessor took 29.28 ms. Allocated memory is still 399.0 MB. Free memory was 342.5 MB in the beginning and 341.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-03 23:35:22,486 INFO L168 Benchmark]: RCFGBuilder took 500.06 ms. Allocated memory is still 399.0 MB. Free memory was 341.2 MB in the beginning and 284.1 MB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 5.3 GB. [2018-02-03 23:35:22,486 INFO L168 Benchmark]: TraceAbstraction took 227953.99 ms. Allocated memory was 399.0 MB in the beginning and 699.4 MB in the end (delta: 300.4 MB). Free memory was 284.1 MB in the beginning and 505.8 MB in the end (delta: -221.7 MB). Peak memory consumption was 78.7 MB. Max. memory is 5.3 GB. [2018-02-03 23:35:22,487 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.14 ms. Allocated memory is still 399.0 MB. Free memory is still 362.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 174.95 ms. Allocated memory is still 399.0 MB. Free memory was 355.9 MB in the beginning and 342.5 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 29.28 ms. Allocated memory is still 399.0 MB. Free memory was 342.5 MB in the beginning and 341.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 500.06 ms. Allocated memory is still 399.0 MB. Free memory was 341.2 MB in the beginning and 284.1 MB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 227953.99 ms. Allocated memory was 399.0 MB in the beginning and 699.4 MB in the end (delta: 300.4 MB). Free memory was 284.1 MB in the beginning and 505.8 MB in the end (delta: -221.7 MB). Peak memory consumption was 78.7 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 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 837). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 838). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 822). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 821). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 829). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 827). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 828). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 801). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 803). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 802). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 874]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 874). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 880). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 791). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 793). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 792). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 811). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 813). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 812). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 868). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 742). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 783). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 780). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 779). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 782). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 781). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 876). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 857). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 858). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 847). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 849). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 848). Cancelled while BasicCegarLoop was constructing difference of abstraction (241states) and interpolant automaton (currently 29 states, 31 states before enhancement), while ReachableStatesComputation was computing reachable states (247 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 16 procedures, 250 locations, 83 error locations. TIMEOUT Result, 227.9s OverallTime, 9 OverallIterations, 18 TraceHistogramMax, 189.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2055 SDtfs, 619 SDslu, 8293 SDs, 0 SdLazy, 3911 SolverSat, 188 SolverUnsat, 95 SolverUnknown, 0 SolverNotchecked, 134.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 824 GetRequests, 707 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 88.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 68 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 35.1s InterpolantComputationTime, 788 NumberOfCodeBlocks, 706 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 779 ConstructedInterpolants, 47 QuantifiedInterpolants, 519589 SizeOfPredicates, 42 NumberOfNonLiveVariables, 3563 ConjunctsInSsa, 236 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 1721/1800 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-03_23-35-22-493.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0237_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-03_23-35-22-493.csv Completed graceful shutdown