java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:32:14,863 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:32:14,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:32:14,877 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:32:14,878 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:32:14,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:32:14,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:32:14,882 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:32:14,884 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:32:14,885 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:32:14,885 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:32:14,886 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:32:14,886 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:32:14,888 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:32:14,889 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:32:14,891 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:32:14,894 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:32:14,896 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:32:14,898 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:32:14,899 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:32:14,902 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:32:14,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:32:14,902 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:32:14,903 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:32:14,904 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:32:14,906 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:32:14,906 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:32:14,907 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:32:14,907 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:32:14,907 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:32:14,908 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:32:14,908 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:32:14,918 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:32:14,919 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:32:14,920 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:32:14,920 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:32:14,920 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:32:14,920 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:32:14,921 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:32:14,921 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:32:14,922 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:32:14,922 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:32:14,922 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:32:14,922 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:32:14,922 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:32:14,923 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:32:14,923 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:32:14,923 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:32:14,923 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:32:14,923 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:32:14,924 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:32:14,924 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:32:14,924 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:32:14,924 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:32:14,924 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:32:14,925 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:32:14,925 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:32:14,925 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:32:14,925 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:32:14,926 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:32:14,926 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:32:14,926 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:32:14,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:32:14,926 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:32:14,927 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:32:14,927 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:32:14,963 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:32:14,976 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:32:14,980 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:32:14,982 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:32:14,982 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:32:14,983 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-01-24 12:32:15,215 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:32:15,219 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:32:15,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:32:15,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:32:15,225 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:32:15,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:32:15" (1/1) ... [2018-01-24 12:32:15,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2808578e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:32:15, skipping insertion in model container [2018-01-24 12:32:15,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:32:15" (1/1) ... [2018-01-24 12:32:15,248 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:32:15,300 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:32:15,428 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:32:15,457 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:32:15,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:32:15 WrapperNode [2018-01-24 12:32:15,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:32:15,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:32:15,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:32:15,473 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:32:15,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:32:15" (1/1) ... [2018-01-24 12:32:15,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:32:15" (1/1) ... [2018-01-24 12:32:15,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:32:15" (1/1) ... [2018-01-24 12:32:15,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:32:15" (1/1) ... [2018-01-24 12:32:15,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:32:15" (1/1) ... [2018-01-24 12:32:15,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:32:15" (1/1) ... [2018-01-24 12:32:15,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:32:15" (1/1) ... [2018-01-24 12:32:15,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:32:15,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:32:15,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:32:15,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:32:15,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:32:15" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:32:15,567 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:32:15,567 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:32:15,567 INFO L136 BoogieDeclarations]: Found implementation of procedure fail [2018-01-24 12:32:15,568 INFO L136 BoogieDeclarations]: Found implementation of procedure inspect [2018-01-24 12:32:15,568 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-01-24 12:32:15,568 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-01-24 12:32:15,568 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-01-24 12:32:15,568 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-01-24 12:32:15,568 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-01-24 12:32:15,568 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-01-24 12:32:15,568 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-01-24 12:32:15,568 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-01-24 12:32:15,568 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort_pass [2018-01-24 12:32:15,569 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-01-24 12:32:15,569 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:32:15,569 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:32:15,569 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:32:15,569 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:32:15,569 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:32:15,569 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:32:15,569 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:32:15,569 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:32:15,569 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 12:32:15,570 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:32:15,570 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-24 12:32:15,570 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:32:15,570 INFO L128 BoogieDeclarations]: Found specification of procedure fail [2018-01-24 12:32:15,570 INFO L128 BoogieDeclarations]: Found specification of procedure inspect [2018-01-24 12:32:15,570 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-01-24 12:32:15,570 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-01-24 12:32:15,570 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-01-24 12:32:15,571 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-01-24 12:32:15,571 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-01-24 12:32:15,571 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-01-24 12:32:15,571 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-01-24 12:32:15,571 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-01-24 12:32:15,571 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort_pass [2018-01-24 12:32:15,571 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-01-24 12:32:15,571 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:32:15,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:32:15,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:32:16,292 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:32:16,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:32:16 BoogieIcfgContainer [2018-01-24 12:32:16,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:32:16,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:32:16,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:32:16,296 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:32:16,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:32:15" (1/3) ... [2018-01-24 12:32:16,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f88f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:32:16, skipping insertion in model container [2018-01-24 12:32:16,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:32:15" (2/3) ... [2018-01-24 12:32:16,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f88f96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:32:16, skipping insertion in model container [2018-01-24 12:32:16,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:32:16" (3/3) ... [2018-01-24 12:32:16,300 INFO L105 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux_true-unreach-call_true-valid-memsafety.i [2018-01-24 12:32:16,306 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:32:16,313 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 73 error locations. [2018-01-24 12:32:16,376 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:32:16,376 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:32:16,376 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:32:16,376 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:32:16,376 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:32:16,377 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:32:16,377 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:32:16,377 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:32:16,378 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:32:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states. [2018-01-24 12:32:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 12:32:16,411 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:16,412 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 12:32:16,413 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:16,418 INFO L82 PathProgramCache]: Analyzing trace with hash 19743518, now seen corresponding path program 1 times [2018-01-24 12:32:16,420 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:16,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:16,462 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:16,463 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:16,463 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:16,501 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:16,648 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:16,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:32:16,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:32:16,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:32:16,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:32:16,669 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 3 states. [2018-01-24 12:32:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:16,950 INFO L93 Difference]: Finished difference Result 520 states and 695 transitions. [2018-01-24 12:32:16,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:32:16,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 12:32:16,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:16,966 INFO L225 Difference]: With dead ends: 520 [2018-01-24 12:32:16,966 INFO L226 Difference]: Without dead ends: 244 [2018-01-24 12:32:16,973 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:32:16,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-01-24 12:32:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2018-01-24 12:32:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-01-24 12:32:17,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 252 transitions. [2018-01-24 12:32:17,037 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 252 transitions. Word has length 4 [2018-01-24 12:32:17,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:17,037 INFO L432 AbstractCegarLoop]: Abstraction has 243 states and 252 transitions. [2018-01-24 12:32:17,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:32:17,037 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 252 transitions. [2018-01-24 12:32:17,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-01-24 12:32:17,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:17,038 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-01-24 12:32:17,038 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:17,039 INFO L82 PathProgramCache]: Analyzing trace with hash 19743519, now seen corresponding path program 1 times [2018-01-24 12:32:17,039 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:17,039 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:17,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:17,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:17,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:17,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:17,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:17,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 12:32:17,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:32:17,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:32:17,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:32:17,132 INFO L87 Difference]: Start difference. First operand 243 states and 252 transitions. Second operand 3 states. [2018-01-24 12:32:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:17,311 INFO L93 Difference]: Finished difference Result 247 states and 257 transitions. [2018-01-24 12:32:17,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:32:17,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-01-24 12:32:17,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:17,316 INFO L225 Difference]: With dead ends: 247 [2018-01-24 12:32:17,316 INFO L226 Difference]: Without dead ends: 245 [2018-01-24 12:32:17,317 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:32:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-01-24 12:32:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 241. [2018-01-24 12:32:17,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-01-24 12:32:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 250 transitions. [2018-01-24 12:32:17,341 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 250 transitions. Word has length 4 [2018-01-24 12:32:17,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:17,341 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 250 transitions. [2018-01-24 12:32:17,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:32:17,342 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 250 transitions. [2018-01-24 12:32:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:32:17,342 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:17,342 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:17,343 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:17,343 INFO L82 PathProgramCache]: Analyzing trace with hash -935456334, now seen corresponding path program 1 times [2018-01-24 12:32:17,343 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:17,343 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:17,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:17,344 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:17,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:17,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:17,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:17,421 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:32:17,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:32:17,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:32:17,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:32:17,421 INFO L87 Difference]: Start difference. First operand 241 states and 250 transitions. Second operand 4 states. [2018-01-24 12:32:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:17,592 INFO L93 Difference]: Finished difference Result 241 states and 250 transitions. [2018-01-24 12:32:17,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:32:17,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 12:32:17,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:17,595 INFO L225 Difference]: With dead ends: 241 [2018-01-24 12:32:17,595 INFO L226 Difference]: Without dead ends: 238 [2018-01-24 12:32:17,596 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:32:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-24 12:32:17,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-01-24 12:32:17,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-24 12:32:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 247 transitions. [2018-01-24 12:32:17,613 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 247 transitions. Word has length 16 [2018-01-24 12:32:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:17,614 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 247 transitions. [2018-01-24 12:32:17,614 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:32:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 247 transitions. [2018-01-24 12:32:17,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-24 12:32:17,615 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:17,615 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:17,615 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:17,616 INFO L82 PathProgramCache]: Analyzing trace with hash -935456333, now seen corresponding path program 1 times [2018-01-24 12:32:17,616 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:17,616 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:17,617 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:17,617 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:17,618 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:17,640 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:17,705 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:17,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:32:17,705 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:32:17,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:32:17,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:32:17,706 INFO L87 Difference]: Start difference. First operand 238 states and 247 transitions. Second operand 4 states. [2018-01-24 12:32:17,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:17,854 INFO L93 Difference]: Finished difference Result 238 states and 247 transitions. [2018-01-24 12:32:17,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:32:17,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-01-24 12:32:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:17,856 INFO L225 Difference]: With dead ends: 238 [2018-01-24 12:32:17,857 INFO L226 Difference]: Without dead ends: 235 [2018-01-24 12:32:17,857 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:32:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-01-24 12:32:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-01-24 12:32:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-01-24 12:32:17,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 244 transitions. [2018-01-24 12:32:17,874 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 244 transitions. Word has length 16 [2018-01-24 12:32:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:17,875 INFO L432 AbstractCegarLoop]: Abstraction has 235 states and 244 transitions. [2018-01-24 12:32:17,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:32:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 244 transitions. [2018-01-24 12:32:17,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:32:17,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:17,876 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:17,876 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:17,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1863730920, now seen corresponding path program 1 times [2018-01-24 12:32:17,877 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:17,877 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:17,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:17,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:17,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:17,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:18,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:18,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:18,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:32:18,021 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:32:18,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:32:18,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:32:18,022 INFO L87 Difference]: Start difference. First operand 235 states and 244 transitions. Second operand 7 states. [2018-01-24 12:32:18,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:18,345 INFO L93 Difference]: Finished difference Result 244 states and 252 transitions. [2018-01-24 12:32:18,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 12:32:18,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 12:32:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:18,347 INFO L225 Difference]: With dead ends: 244 [2018-01-24 12:32:18,347 INFO L226 Difference]: Without dead ends: 243 [2018-01-24 12:32:18,348 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:32:18,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-24 12:32:18,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-01-24 12:32:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-01-24 12:32:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 251 transitions. [2018-01-24 12:32:18,358 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 251 transitions. Word has length 19 [2018-01-24 12:32:18,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:18,359 INFO L432 AbstractCegarLoop]: Abstraction has 241 states and 251 transitions. [2018-01-24 12:32:18,359 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:32:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 251 transitions. [2018-01-24 12:32:18,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:32:18,359 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:18,360 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:18,360 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:18,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1863730921, now seen corresponding path program 1 times [2018-01-24 12:32:18,360 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:18,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:18,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:18,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:18,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:18,382 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:18,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:18,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 12:32:18,523 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:32:18,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:32:18,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:32:18,524 INFO L87 Difference]: Start difference. First operand 241 states and 251 transitions. Second operand 9 states. [2018-01-24 12:32:19,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:19,050 INFO L93 Difference]: Finished difference Result 242 states and 251 transitions. [2018-01-24 12:32:19,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 12:32:19,051 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-01-24 12:32:19,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:19,052 INFO L225 Difference]: With dead ends: 242 [2018-01-24 12:32:19,052 INFO L226 Difference]: Without dead ends: 238 [2018-01-24 12:32:19,053 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:32:19,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-24 12:32:19,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-01-24 12:32:19,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-24 12:32:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 246 transitions. [2018-01-24 12:32:19,068 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 246 transitions. Word has length 19 [2018-01-24 12:32:19,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:19,068 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 246 transitions. [2018-01-24 12:32:19,068 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:32:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 246 transitions. [2018-01-24 12:32:19,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:32:19,069 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:19,070 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:19,070 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:19,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1366173164, now seen corresponding path program 1 times [2018-01-24 12:32:19,070 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:19,070 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:19,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:19,071 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:19,071 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:19,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:19,201 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:19,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:32:19,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 12:32:19,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 12:32:19,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-24 12:32:19,202 INFO L87 Difference]: Start difference. First operand 238 states and 246 transitions. Second operand 10 states. [2018-01-24 12:32:19,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:19,650 INFO L93 Difference]: Finished difference Result 265 states and 275 transitions. [2018-01-24 12:32:19,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:32:19,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-01-24 12:32:19,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:19,652 INFO L225 Difference]: With dead ends: 265 [2018-01-24 12:32:19,652 INFO L226 Difference]: Without dead ends: 264 [2018-01-24 12:32:19,653 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:32:19,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-24 12:32:19,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 256. [2018-01-24 12:32:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-01-24 12:32:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 273 transitions. [2018-01-24 12:32:19,666 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 273 transitions. Word has length 22 [2018-01-24 12:32:19,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:19,666 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 273 transitions. [2018-01-24 12:32:19,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 12:32:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 273 transitions. [2018-01-24 12:32:19,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 12:32:19,667 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:19,667 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:19,667 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1366173165, now seen corresponding path program 1 times [2018-01-24 12:32:19,667 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:19,668 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:19,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:19,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:19,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:19,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:19,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:19,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:19,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:32:19,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:32:19,900 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:32:19,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:32:19,901 INFO L87 Difference]: Start difference. First operand 256 states and 273 transitions. Second operand 11 states. [2018-01-24 12:32:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:20,757 INFO L93 Difference]: Finished difference Result 485 states and 501 transitions. [2018-01-24 12:32:20,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:32:20,758 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-01-24 12:32:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:20,760 INFO L225 Difference]: With dead ends: 485 [2018-01-24 12:32:20,760 INFO L226 Difference]: Without dead ends: 484 [2018-01-24 12:32:20,761 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-01-24 12:32:20,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-01-24 12:32:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 400. [2018-01-24 12:32:20,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-01-24 12:32:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 473 transitions. [2018-01-24 12:32:20,781 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 473 transitions. Word has length 22 [2018-01-24 12:32:20,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:20,781 INFO L432 AbstractCegarLoop]: Abstraction has 400 states and 473 transitions. [2018-01-24 12:32:20,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:32:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 473 transitions. [2018-01-24 12:32:20,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:32:20,782 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:20,782 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:20,783 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:20,783 INFO L82 PathProgramCache]: Analyzing trace with hash -598304902, now seen corresponding path program 1 times [2018-01-24 12:32:20,783 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:20,783 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:20,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:20,784 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:20,784 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:20,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:20,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:20,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:32:20,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:32:20,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:32:20,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:32:20,909 INFO L87 Difference]: Start difference. First operand 400 states and 473 transitions. Second operand 7 states. [2018-01-24 12:32:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:21,610 INFO L93 Difference]: Finished difference Result 414 states and 487 transitions. [2018-01-24 12:32:21,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:32:21,611 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-01-24 12:32:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:21,613 INFO L225 Difference]: With dead ends: 414 [2018-01-24 12:32:21,613 INFO L226 Difference]: Without dead ends: 412 [2018-01-24 12:32:21,614 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:32:21,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-01-24 12:32:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 271. [2018-01-24 12:32:21,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-24 12:32:21,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 288 transitions. [2018-01-24 12:32:21,632 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 288 transitions. Word has length 23 [2018-01-24 12:32:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:21,633 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 288 transitions. [2018-01-24 12:32:21,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:32:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 288 transitions. [2018-01-24 12:32:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 12:32:21,633 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:21,633 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:21,634 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:21,634 INFO L82 PathProgramCache]: Analyzing trace with hash -598304901, now seen corresponding path program 1 times [2018-01-24 12:32:21,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:21,634 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:21,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:21,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:21,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:21,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:21,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:21,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:21,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:21,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:32:21,778 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:32:21,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:32:21,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:32:21,778 INFO L87 Difference]: Start difference. First operand 271 states and 288 transitions. Second operand 8 states. [2018-01-24 12:32:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:22,126 INFO L93 Difference]: Finished difference Result 277 states and 288 transitions. [2018-01-24 12:32:22,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:32:22,126 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-24 12:32:22,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:22,129 INFO L225 Difference]: With dead ends: 277 [2018-01-24 12:32:22,129 INFO L226 Difference]: Without dead ends: 275 [2018-01-24 12:32:22,129 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:32:22,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-01-24 12:32:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 271. [2018-01-24 12:32:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-01-24 12:32:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 284 transitions. [2018-01-24 12:32:22,151 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 284 transitions. Word has length 23 [2018-01-24 12:32:22,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:22,151 INFO L432 AbstractCegarLoop]: Abstraction has 271 states and 284 transitions. [2018-01-24 12:32:22,151 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:32:22,151 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 284 transitions. [2018-01-24 12:32:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:32:22,152 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:22,152 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:22,153 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:22,153 INFO L82 PathProgramCache]: Analyzing trace with hash 554606109, now seen corresponding path program 1 times [2018-01-24 12:32:22,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:22,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:22,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:22,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:22,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:22,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:22,173 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:22,219 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:22,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 12:32:22,220 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 12:32:22,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 12:32:22,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:32:22,221 INFO L87 Difference]: Start difference. First operand 271 states and 284 transitions. Second operand 5 states. [2018-01-24 12:32:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:22,488 INFO L93 Difference]: Finished difference Result 271 states and 284 transitions. [2018-01-24 12:32:22,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:32:22,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-24 12:32:22,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:22,491 INFO L225 Difference]: With dead ends: 271 [2018-01-24 12:32:22,491 INFO L226 Difference]: Without dead ends: 270 [2018-01-24 12:32:22,492 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 12:32:22,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-01-24 12:32:22,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-01-24 12:32:22,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-01-24 12:32:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 281 transitions. [2018-01-24 12:32:22,508 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 281 transitions. Word has length 25 [2018-01-24 12:32:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:22,509 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 281 transitions. [2018-01-24 12:32:22,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 12:32:22,509 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 281 transitions. [2018-01-24 12:32:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 12:32:22,510 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:22,510 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:22,510 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:22,510 INFO L82 PathProgramCache]: Analyzing trace with hash 554606110, now seen corresponding path program 1 times [2018-01-24 12:32:22,510 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:22,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:22,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:22,511 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:22,511 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:22,527 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:22,640 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:22,640 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:32:22,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:32:22,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:32:22,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:32:22,641 INFO L87 Difference]: Start difference. First operand 270 states and 281 transitions. Second operand 8 states. [2018-01-24 12:32:22,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:22,918 INFO L93 Difference]: Finished difference Result 273 states and 281 transitions. [2018-01-24 12:32:22,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:32:22,918 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-24 12:32:22,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:22,919 INFO L225 Difference]: With dead ends: 273 [2018-01-24 12:32:22,919 INFO L226 Difference]: Without dead ends: 272 [2018-01-24 12:32:22,920 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:32:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-01-24 12:32:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-01-24 12:32:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-01-24 12:32:22,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 279 transitions. [2018-01-24 12:32:22,939 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 279 transitions. Word has length 25 [2018-01-24 12:32:22,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:22,939 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 279 transitions. [2018-01-24 12:32:22,939 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:32:22,939 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 279 transitions. [2018-01-24 12:32:22,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:32:22,941 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:22,941 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:22,941 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:22,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1199658537, now seen corresponding path program 1 times [2018-01-24 12:32:22,942 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:22,942 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:22,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:22,943 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:22,943 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:22,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:23,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:23,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:23,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 12:32:23,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 12:32:23,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 12:32:23,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:32:23,176 INFO L87 Difference]: Start difference. First operand 270 states and 279 transitions. Second operand 11 states. [2018-01-24 12:32:23,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:23,664 INFO L93 Difference]: Finished difference Result 270 states and 279 transitions. [2018-01-24 12:32:23,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:32:23,665 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2018-01-24 12:32:23,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:23,666 INFO L225 Difference]: With dead ends: 270 [2018-01-24 12:32:23,666 INFO L226 Difference]: Without dead ends: 269 [2018-01-24 12:32:23,667 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-01-24 12:32:23,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-01-24 12:32:23,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-01-24 12:32:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-01-24 12:32:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 278 transitions. [2018-01-24 12:32:23,686 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 278 transitions. Word has length 48 [2018-01-24 12:32:23,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:23,686 INFO L432 AbstractCegarLoop]: Abstraction has 269 states and 278 transitions. [2018-01-24 12:32:23,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 12:32:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 278 transitions. [2018-01-24 12:32:23,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-24 12:32:23,688 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:23,688 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:23,688 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:23,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1199658536, now seen corresponding path program 1 times [2018-01-24 12:32:23,689 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:23,689 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:23,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:23,690 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:23,690 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:23,707 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:23,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:23,774 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:32:23,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:32:23,775 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:32:23,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:32:23,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:32:23,776 INFO L87 Difference]: Start difference. First operand 269 states and 278 transitions. Second operand 7 states. [2018-01-24 12:32:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:24,187 INFO L93 Difference]: Finished difference Result 269 states and 278 transitions. [2018-01-24 12:32:24,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 12:32:24,187 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-01-24 12:32:24,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:24,189 INFO L225 Difference]: With dead ends: 269 [2018-01-24 12:32:24,189 INFO L226 Difference]: Without dead ends: 264 [2018-01-24 12:32:24,190 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-01-24 12:32:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-24 12:32:24,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-01-24 12:32:24,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-01-24 12:32:24,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 273 transitions. [2018-01-24 12:32:24,211 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 273 transitions. Word has length 48 [2018-01-24 12:32:24,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:24,212 INFO L432 AbstractCegarLoop]: Abstraction has 264 states and 273 transitions. [2018-01-24 12:32:24,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:32:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 273 transitions. [2018-01-24 12:32:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:32:24,213 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:24,217 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:24,217 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:24,218 INFO L82 PathProgramCache]: Analyzing trace with hash 652522709, now seen corresponding path program 1 times [2018-01-24 12:32:24,218 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:24,218 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:24,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:24,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:24,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:24,256 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:24,782 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:32:24,782 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:32:24,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:24,869 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:32:24,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:32:24,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:24,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:24,943 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:32:24,998 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 5 treesize of output 1 [2018-01-24 12:32:24,999 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:25,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:25,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-01-24 12:32:25,247 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 5 treesize of output 1 [2018-01-24 12:32:25,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:25,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:32:25,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-01-24 12:32:25,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:32:25,695 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 8 treesize of output 7 [2018-01-24 12:32:25,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:25,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:25,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:32:25,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-01-24 12:32:25,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-01-24 12:32:25,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 22 treesize of output 21 [2018-01-24 12:32:25,964 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:25,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:26,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:26,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2018-01-24 12:32:26,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 58 [2018-01-24 12:32:26,068 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:26,069 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 56 treesize of output 69 [2018-01-24 12:32:26,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:26,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:26,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:32:26,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:61 [2018-01-24 12:32:26,189 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:26,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:26,191 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 15 treesize of output 8 [2018-01-24 12:32:26,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:26,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:32:26,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:66, output treesize:60 [2018-01-24 12:32:26,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:26,268 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:26,269 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:26,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-01-24 12:32:26,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:26,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:32:26,282 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:77 [2018-01-24 12:32:26,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 75 [2018-01-24 12:32:26,395 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 12 treesize of output 1 [2018-01-24 12:32:26,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:26,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:26,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:32:26,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:77 [2018-01-24 12:32:26,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 43 [2018-01-24 12:32:26,602 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:26,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2018-01-24 12:32:26,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:26,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-01-24 12:32:26,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:26,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:26,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:32:26,638 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:81, output treesize:28 [2018-01-24 12:32:26,774 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:26,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:32:26,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 45 [2018-01-24 12:32:26,801 INFO L409 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-01-24 12:32:26,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-01-24 12:32:26,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1884, Unknown=0, NotChecked=0, Total=2070 [2018-01-24 12:32:26,802 INFO L87 Difference]: Start difference. First operand 264 states and 273 transitions. Second operand 46 states. [2018-01-24 12:32:32,701 WARN L146 SmtUtils]: Spent 4070ms on a formula simplification. DAG size of input: 63 DAG size of output 57 [2018-01-24 12:32:36,809 WARN L146 SmtUtils]: Spent 4057ms on a formula simplification. DAG size of input: 92 DAG size of output 66 [2018-01-24 12:32:37,588 WARN L146 SmtUtils]: Spent 725ms on a formula simplification. DAG size of input: 101 DAG size of output 73 [2018-01-24 12:32:41,703 WARN L146 SmtUtils]: Spent 4035ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-01-24 12:32:45,799 WARN L146 SmtUtils]: Spent 4043ms on a formula simplification. DAG size of input: 75 DAG size of output 54 [2018-01-24 12:32:46,427 WARN L146 SmtUtils]: Spent 576ms on a formula simplification. DAG size of input: 50 DAG size of output 40 [2018-01-24 12:32:47,183 WARN L146 SmtUtils]: Spent 592ms on a formula simplification. DAG size of input: 54 DAG size of output 44 [2018-01-24 12:32:47,803 WARN L146 SmtUtils]: Spent 563ms on a formula simplification. DAG size of input: 42 DAG size of output 42 [2018-01-24 12:32:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:50,549 INFO L93 Difference]: Finished difference Result 444 states and 466 transitions. [2018-01-24 12:32:50,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-01-24 12:32:50,549 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 52 [2018-01-24 12:32:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:50,552 INFO L225 Difference]: With dead ends: 444 [2018-01-24 12:32:50,552 INFO L226 Difference]: Without dead ends: 443 [2018-01-24 12:32:50,554 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=810, Invalid=5510, Unknown=0, NotChecked=0, Total=6320 [2018-01-24 12:32:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-01-24 12:32:50,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 365. [2018-01-24 12:32:50,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-01-24 12:32:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 407 transitions. [2018-01-24 12:32:50,590 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 407 transitions. Word has length 52 [2018-01-24 12:32:50,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:50,590 INFO L432 AbstractCegarLoop]: Abstraction has 365 states and 407 transitions. [2018-01-24 12:32:50,590 INFO L433 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-01-24 12:32:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 407 transitions. [2018-01-24 12:32:50,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:32:50,592 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:50,592 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:50,592 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:50,592 INFO L82 PathProgramCache]: Analyzing trace with hash 652522710, now seen corresponding path program 1 times [2018-01-24 12:32:50,593 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:50,593 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:50,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:50,594 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:50,594 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:50,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:32:51,222 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:51,223 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:32:51,223 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:32:51,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:51,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:32:51,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:32:51,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 12:32:51,347 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 5 treesize of output 1 [2018-01-24 12:32:51,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-01-24 12:32:51,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 12:32:51,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-01-24 12:32:51,449 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 5 treesize of output 1 [2018-01-24 12:32:51,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:32:51,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-01-24 12:32:51,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:32:51,667 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 8 treesize of output 7 [2018-01-24 12:32:51,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,671 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:32:51,683 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 8 treesize of output 7 [2018-01-24 12:32:51,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:32:51,691 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-01-24 12:32:51,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 49 [2018-01-24 12:32:51,865 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 34 treesize of output 33 [2018-01-24 12:32:51,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2018-01-24 12:32:51,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 37 treesize of output 36 [2018-01-24 12:32:51,911 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,927 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:51,939 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:69 [2018-01-24 12:32:52,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 138 treesize of output 127 [2018-01-24 12:32:52,015 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:52,016 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:52,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:52,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 150 [2018-01-24 12:32:52,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:32:52,040 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:32:52,084 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:52,084 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 125 treesize of output 146 [2018-01-24 12:32:52,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 115 [2018-01-24 12:32:52,139 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:52,140 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 114 treesize of output 135 [2018-01-24 12:32:52,140 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,185 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,199 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:153, output treesize:137 [2018-01-24 12:32:52,256 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:52,257 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:52,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 8 [2018-01-24 12:32:52,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:142, output treesize:136 [2018-01-24 12:32:52,339 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 31 treesize of output 22 [2018-01-24 12:32:52,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:52,358 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:52,359 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-01-24 12:32:52,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:147, output treesize:132 [2018-01-24 12:32:52,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 134 [2018-01-24 12:32:52,526 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 130 treesize of output 118 [2018-01-24 12:32:52,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,575 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:52,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 96 treesize of output 124 [2018-01-24 12:32:52,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-24 12:32:52,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:32:52,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 106 [2018-01-24 12:32:52,701 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:52,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 80 [2018-01-24 12:32:52,704 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,720 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 153 [2018-01-24 12:32:52,745 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:52,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 159 [2018-01-24 12:32:52,763 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-01-24 12:32:52,870 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 132 treesize of output 120 [2018-01-24 12:32:52,870 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,913 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:32:52,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 106 [2018-01-24 12:32:52,922 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:32:52,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 80 [2018-01-24 12:32:52,924 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,935 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:52,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-01-24 12:32:52,981 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:162, output treesize:291 [2018-01-24 12:32:53,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2018-01-24 12:32:53,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 53 treesize of output 64 [2018-01-24 12:32:53,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:53,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 64 treesize of output 29 [2018-01-24 12:32:53,263 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:53,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:53,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-01-24 12:32:53,301 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 29 treesize of output 16 [2018-01-24 12:32:53,302 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:53,310 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 9 treesize of output 1 [2018-01-24 12:32:53,310 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:53,315 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:53,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 74 [2018-01-24 12:32:53,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 53 treesize of output 64 [2018-01-24 12:32:53,340 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:53,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 64 treesize of output 29 [2018-01-24 12:32:53,373 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:53,382 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:53,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-01-24 12:32:53,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 16 [2018-01-24 12:32:53,400 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:53,406 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 9 treesize of output 1 [2018-01-24 12:32:53,407 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 12:32:53,410 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:53,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:32:53,426 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:181, output treesize:12 [2018-01-24 12:32:53,544 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:32:53,564 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:32:53,564 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25] total 46 [2018-01-24 12:32:53,565 INFO L409 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-01-24 12:32:53,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-01-24 12:32:53,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2009, Unknown=0, NotChecked=0, Total=2162 [2018-01-24 12:32:53,566 INFO L87 Difference]: Start difference. First operand 365 states and 407 transitions. Second operand 47 states. [2018-01-24 12:32:55,451 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 114 DAG size of output 78 [2018-01-24 12:32:55,661 WARN L146 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 121 DAG size of output 87 [2018-01-24 12:32:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:32:59,906 INFO L93 Difference]: Finished difference Result 443 states and 465 transitions. [2018-01-24 12:32:59,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-24 12:32:59,906 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 52 [2018-01-24 12:32:59,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:32:59,908 INFO L225 Difference]: With dead ends: 443 [2018-01-24 12:32:59,908 INFO L226 Difference]: Without dead ends: 442 [2018-01-24 12:32:59,909 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=726, Invalid=5126, Unknown=0, NotChecked=0, Total=5852 [2018-01-24 12:32:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-01-24 12:32:59,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 338. [2018-01-24 12:32:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-01-24 12:32:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 379 transitions. [2018-01-24 12:32:59,941 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 379 transitions. Word has length 52 [2018-01-24 12:32:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:32:59,941 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 379 transitions. [2018-01-24 12:32:59,941 INFO L433 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-01-24 12:32:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 379 transitions. [2018-01-24 12:32:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-24 12:32:59,942 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:32:59,942 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:32:59,943 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:32:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1566668974, now seen corresponding path program 1 times [2018-01-24 12:32:59,943 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:32:59,943 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:32:59,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:59,944 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:32:59,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:32:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:32:59,964 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:33:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:33:00,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:33:00,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 12:33:00,243 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 12:33:00,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 12:33:00,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-01-24 12:33:00,243 INFO L87 Difference]: Start difference. First operand 338 states and 379 transitions. Second operand 14 states. [2018-01-24 12:33:01,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:33:01,188 INFO L93 Difference]: Finished difference Result 352 states and 395 transitions. [2018-01-24 12:33:01,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 12:33:01,188 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 52 [2018-01-24 12:33:01,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:33:01,189 INFO L225 Difference]: With dead ends: 352 [2018-01-24 12:33:01,190 INFO L226 Difference]: Without dead ends: 350 [2018-01-24 12:33:01,190 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2018-01-24 12:33:01,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-01-24 12:33:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 336. [2018-01-24 12:33:01,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-01-24 12:33:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 375 transitions. [2018-01-24 12:33:01,220 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 375 transitions. Word has length 52 [2018-01-24 12:33:01,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:33:01,220 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 375 transitions. [2018-01-24 12:33:01,220 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 12:33:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 375 transitions. [2018-01-24 12:33:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 12:33:01,221 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:33:01,221 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:33:01,221 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:33:01,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1071557105, now seen corresponding path program 1 times [2018-01-24 12:33:01,222 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:33:01,222 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:33:01,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:33:01,223 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:33:01,223 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:33:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:33:01,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:33:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:33:02,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:33:02,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-01-24 12:33:02,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-24 12:33:02,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-24 12:33:02,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=538, Unknown=0, NotChecked=0, Total=600 [2018-01-24 12:33:02,260 INFO L87 Difference]: Start difference. First operand 336 states and 375 transitions. Second operand 25 states. [2018-01-24 12:33:05,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:33:05,885 INFO L93 Difference]: Finished difference Result 545 states and 606 transitions. [2018-01-24 12:33:05,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-01-24 12:33:05,885 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 61 [2018-01-24 12:33:05,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:33:05,887 INFO L225 Difference]: With dead ends: 545 [2018-01-24 12:33:05,887 INFO L226 Difference]: Without dead ends: 544 [2018-01-24 12:33:05,888 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=341, Invalid=2415, Unknown=0, NotChecked=0, Total=2756 [2018-01-24 12:33:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-01-24 12:33:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 458. [2018-01-24 12:33:05,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-01-24 12:33:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 538 transitions. [2018-01-24 12:33:05,931 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 538 transitions. Word has length 61 [2018-01-24 12:33:05,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:33:05,932 INFO L432 AbstractCegarLoop]: Abstraction has 458 states and 538 transitions. [2018-01-24 12:33:05,932 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-24 12:33:05,932 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 538 transitions. [2018-01-24 12:33:05,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-01-24 12:33:05,933 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:33:05,933 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:33:05,933 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sort_passErr1RequiresViolation, gl_sort_passErr3RequiresViolation, gl_sort_passErr0RequiresViolation, gl_sort_passErr2RequiresViolation, inspectErr7RequiresViolation, inspectErr20RequiresViolation, inspectErr15RequiresViolation, inspectErr25RequiresViolation, inspectErr28RequiresViolation, inspectErr2RequiresViolation, inspectErr18RequiresViolation, inspectErr9RequiresViolation, inspectErr0RequiresViolation, inspectErr12RequiresViolation, inspectErr6RequiresViolation, inspectErr3RequiresViolation, inspectErr19RequiresViolation, inspectErr22RequiresViolation, inspectErr11RequiresViolation, inspectErr29RequiresViolation, inspectErr16RequiresViolation, inspectErr24RequiresViolation, inspectErr26RequiresViolation, inspectErr21RequiresViolation, inspectErr13RequiresViolation, inspectErr27RequiresViolation, inspectErr17RequiresViolation, inspectErr23RequiresViolation, inspectErr4RequiresViolation, inspectErr5RequiresViolation, inspectErr8RequiresViolation, inspectErr10RequiresViolation, inspectErr14RequiresViolation, inspectErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_insertErr5RequiresViolation, gl_insertErr3RequiresViolation, gl_insertErr4RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr2RequiresViolation, gl_insertErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation]=== [2018-01-24 12:33:05,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1071557104, now seen corresponding path program 1 times [2018-01-24 12:33:05,934 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:33:05,934 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:33:05,934 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:33:05,935 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:33:05,935 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:33:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:33:05,975 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:33:07,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:33:07,411 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:33:07,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-01-24 12:33:07,412 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-24 12:33:07,412 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-24 12:33:07,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2018-01-24 12:33:07,412 INFO L87 Difference]: Start difference. First operand 458 states and 538 transitions. Second operand 24 states. Received shutdown request... [2018-01-24 12:33:08,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 12:33:08,234 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:33:08,243 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:33:08,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:33:08 BoogieIcfgContainer [2018-01-24 12:33:08,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:33:08,244 INFO L168 Benchmark]: Toolchain (without parser) took 53028.46 ms. Allocated memory was 301.5 MB in the beginning and 760.2 MB in the end (delta: 458.8 MB). Free memory was 260.5 MB in the beginning and 437.3 MB in the end (delta: -176.8 MB). Peak memory consumption was 282.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:33:08,246 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:33:08,246 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.48 ms. Allocated memory is still 301.5 MB. Free memory was 259.5 MB in the beginning and 246.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:33:08,246 INFO L168 Benchmark]: Boogie Preprocessor took 43.19 ms. Allocated memory is still 301.5 MB. Free memory was 246.6 MB in the beginning and 243.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:33:08,246 INFO L168 Benchmark]: RCFGBuilder took 776.89 ms. Allocated memory is still 301.5 MB. Free memory was 243.6 MB in the beginning and 186.5 MB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 5.3 GB. [2018-01-24 12:33:08,247 INFO L168 Benchmark]: TraceAbstraction took 51949.22 ms. Allocated memory was 301.5 MB in the beginning and 760.2 MB in the end (delta: 458.8 MB). Free memory was 185.5 MB in the beginning and 437.3 MB in the end (delta: -251.8 MB). Peak memory consumption was 206.9 MB. Max. memory is 5.3 GB. [2018-01-24 12:33:08,248 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.34 ms. Allocated memory is still 301.5 MB. Free memory is still 267.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 252.48 ms. Allocated memory is still 301.5 MB. Free memory was 259.5 MB in the beginning and 246.6 MB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.19 ms. Allocated memory is still 301.5 MB. Free memory was 246.6 MB in the beginning and 243.6 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 776.89 ms. Allocated memory is still 301.5 MB. Free memory was 243.6 MB in the beginning and 186.5 MB in the end (delta: 57.1 MB). Peak memory consumption was 57.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 51949.22 ms. Allocated memory was 301.5 MB in the beginning and 760.2 MB in the end (delta: 458.8 MB). Free memory was 185.5 MB in the beginning and 437.3 MB in the end (delta: -251.8 MB). Peak memory consumption was 206.9 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 867). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 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 (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 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 (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 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 (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 869). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 870). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 839). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 883). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 912). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 912). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 917). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 919). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 917). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 919). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 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 (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 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 (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 853). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 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 (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 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 (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 852). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 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 (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 844). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 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 (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 851). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 854). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 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 (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 852). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 860). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 854). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 859). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 845). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 845). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 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 (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 851). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 853). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 843). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 879). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 879). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 936]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 936). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 874). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 875). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 875). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 874). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 893). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 893). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 893). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 891). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 893). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 891). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 906). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 906). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 905). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 905). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 907). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 907). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 906). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 906). Cancelled while BasicCegarLoop was constructing difference of abstraction (458states) and interpolant automaton (currently 18 states, 24 states before enhancement), while ReachableStatesComputation was computing reachable states (43 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 268 locations, 73 error locations. TIMEOUT Result, 51.8s OverallTime, 19 OverallIterations, 2 TraceHistogramMax, 41.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3403 SDtfs, 8838 SDslu, 10811 SDs, 0 SdLazy, 23338 SolverSat, 1307 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 108 SyntacticMatches, 20 SemanticMatches, 377 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3345 ImplicationChecksByTransitivity, 30.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=458occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 528 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 696 NumberOfCodeBlocks, 696 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 675 ConstructedInterpolants, 41 QuantifiedInterpolants, 621370 SizeOfPredicates, 57 NumberOfNonLiveVariables, 650 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 21 InterpolantComputations, 17 PerfectInterpolantSequences, 12/52 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-33-08-259.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/bubble_sort_linux_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-33-08-259.csv Completed graceful shutdown