java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memsafety/test-0134_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 08:57:08,425 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 08:57:08,427 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 08:57:08,440 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 08:57:08,440 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 08:57:08,441 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 08:57:08,442 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 08:57:08,445 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 08:57:08,446 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 08:57:08,446 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 08:57:08,448 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 08:57:08,448 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 08:57:08,449 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 08:57:08,450 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 08:57:08,459 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 08:57:08,461 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 08:57:08,463 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 08:57:08,464 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 08:57:08,465 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 08:57:08,466 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 08:57:08,468 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 08:57:08,468 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 08:57:08,469 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 08:57:08,470 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 08:57:08,470 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 08:57:08,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 08:57:08,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 08:57:08,472 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 08:57:08,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 08:57:08,473 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 08:57:08,473 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 08:57:08,473 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-02 08:57:08,483 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 08:57:08,484 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 08:57:08,485 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 08:57:08,485 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 08:57:08,485 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 08:57:08,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 08:57:08,485 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 08:57:08,486 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 08:57:08,486 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 08:57:08,486 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 08:57:08,486 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 08:57:08,486 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 08:57:08,486 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 08:57:08,486 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 08:57:08,487 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 08:57:08,487 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 08:57:08,487 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 08:57:08,487 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 08:57:08,487 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 08:57:08,487 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 08:57:08,487 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:57:08,488 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 08:57:08,488 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 08:57:08,488 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 08:57:08,488 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 08:57:08,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 08:57:08,526 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 08:57:08,529 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 08:57:08,530 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 08:57:08,531 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 08:57:08,531 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0134_true-valid-memsafety.i [2018-02-02 08:57:08,680 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 08:57:08,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 08:57:08,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 08:57:08,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 08:57:08,688 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 08:57:08,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:57:08" (1/1) ... [2018-02-02 08:57:08,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19495381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:57:08, skipping insertion in model container [2018-02-02 08:57:08,692 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 08:57:08" (1/1) ... [2018-02-02 08:57:08,708 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:57:08,734 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 08:57:08,825 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:57:08,842 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 08:57:08,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:57:08 WrapperNode [2018-02-02 08:57:08,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 08:57:08,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 08:57:08,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 08:57:08,849 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 08:57:08,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:57:08" (1/1) ... [2018-02-02 08:57:08,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:57:08" (1/1) ... [2018-02-02 08:57:08,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:57:08" (1/1) ... [2018-02-02 08:57:08,869 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:57:08" (1/1) ... [2018-02-02 08:57:08,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:57:08" (1/1) ... [2018-02-02 08:57:08,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:57:08" (1/1) ... [2018-02-02 08:57:08,880 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:57:08" (1/1) ... [2018-02-02 08:57:08,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 08:57:08,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 08:57:08,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 08:57:08,882 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 08:57:08,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:57:08" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 08:57:08,917 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 08:57:08,917 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 08:57:08,917 INFO L136 BoogieDeclarations]: Found implementation of procedure list_empty [2018-02-02 08:57:08,917 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_add [2018-02-02 08:57:08,917 INFO L136 BoogieDeclarations]: Found implementation of procedure __list_del [2018-02-02 08:57:08,918 INFO L136 BoogieDeclarations]: Found implementation of procedure list_add [2018-02-02 08:57:08,918 INFO L136 BoogieDeclarations]: Found implementation of procedure list_del [2018-02-02 08:57:08,918 INFO L136 BoogieDeclarations]: Found implementation of procedure list_move [2018-02-02 08:57:08,918 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_insert [2018-02-02 08:57:08,918 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_read [2018-02-02 08:57:08,918 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_destroy [2018-02-02 08:57:08,918 INFO L136 BoogieDeclarations]: Found implementation of procedure val_from_node [2018-02-02 08:57:08,918 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_seek_max [2018-02-02 08:57:08,918 INFO L136 BoogieDeclarations]: Found implementation of procedure gl_sort [2018-02-02 08:57:08,918 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 08:57:08,918 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 08:57:08,918 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 08:57:08,918 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure list_empty [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure __list_add [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure __list_del [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure list_add [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure list_del [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure list_move [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure gl_insert [2018-02-02 08:57:08,919 INFO L128 BoogieDeclarations]: Found specification of procedure gl_read [2018-02-02 08:57:08,920 INFO L128 BoogieDeclarations]: Found specification of procedure gl_destroy [2018-02-02 08:57:08,920 INFO L128 BoogieDeclarations]: Found specification of procedure val_from_node [2018-02-02 08:57:08,920 INFO L128 BoogieDeclarations]: Found specification of procedure gl_seek_max [2018-02-02 08:57:08,920 INFO L128 BoogieDeclarations]: Found specification of procedure gl_sort [2018-02-02 08:57:08,920 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 08:57:08,920 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 08:57:08,920 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 08:57:09,429 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 08:57:09,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:57:09 BoogieIcfgContainer [2018-02-02 08:57:09,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 08:57:09,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 08:57:09,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 08:57:09,433 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 08:57:09,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 08:57:08" (1/3) ... [2018-02-02 08:57:09,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7f9b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:57:09, skipping insertion in model container [2018-02-02 08:57:09,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 08:57:08" (2/3) ... [2018-02-02 08:57:09,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b7f9b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 08:57:09, skipping insertion in model container [2018-02-02 08:57:09,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 08:57:09" (3/3) ... [2018-02-02 08:57:09,436 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0134_true-valid-memsafety.i [2018-02-02 08:57:09,442 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 08:57:09,452 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 55 error locations. [2018-02-02 08:57:09,481 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 08:57:09,481 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 08:57:09,481 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 08:57:09,481 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 08:57:09,481 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 08:57:09,482 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 08:57:09,482 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 08:57:09,482 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 08:57:09,483 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 08:57:09,496 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states. [2018-02-02 08:57:09,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 08:57:09,503 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:09,504 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 08:57:09,504 INFO L371 AbstractCegarLoop]: === Iteration 1 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:09,507 INFO L82 PathProgramCache]: Analyzing trace with hash 8457694, now seen corresponding path program 1 times [2018-02-02 08:57:09,508 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:09,509 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:09,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:09,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:09,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:09,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:09,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:09,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:57:09,624 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:57:09,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:57:09,683 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:57:09,685 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 3 states. [2018-02-02 08:57:09,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:09,867 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2018-02-02 08:57:09,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:57:09,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 08:57:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:09,878 INFO L225 Difference]: With dead ends: 182 [2018-02-02 08:57:09,878 INFO L226 Difference]: Without dead ends: 179 [2018-02-02 08:57:09,879 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:57:09,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-02-02 08:57:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-02-02 08:57:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-02-02 08:57:09,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 191 transitions. [2018-02-02 08:57:09,916 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 191 transitions. Word has length 4 [2018-02-02 08:57:09,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:09,916 INFO L432 AbstractCegarLoop]: Abstraction has 178 states and 191 transitions. [2018-02-02 08:57:09,916 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:57:09,916 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 191 transitions. [2018-02-02 08:57:09,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-02-02 08:57:09,917 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:09,917 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-02-02 08:57:09,917 INFO L371 AbstractCegarLoop]: === Iteration 2 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:09,917 INFO L82 PathProgramCache]: Analyzing trace with hash 8457695, now seen corresponding path program 1 times [2018-02-02 08:57:09,917 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:09,917 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:09,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:09,918 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:09,918 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:09,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:09,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:09,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:09,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:57:09,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:57:09,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:57:09,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:57:09,979 INFO L87 Difference]: Start difference. First operand 178 states and 191 transitions. Second operand 3 states. [2018-02-02 08:57:10,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:10,069 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2018-02-02 08:57:10,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:57:10,069 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-02-02 08:57:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:10,071 INFO L225 Difference]: With dead ends: 180 [2018-02-02 08:57:10,071 INFO L226 Difference]: Without dead ends: 180 [2018-02-02 08:57:10,072 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:57:10,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-02-02 08:57:10,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 176. [2018-02-02 08:57:10,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-02-02 08:57:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 189 transitions. [2018-02-02 08:57:10,085 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 189 transitions. Word has length 4 [2018-02-02 08:57:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:10,085 INFO L432 AbstractCegarLoop]: Abstraction has 176 states and 189 transitions. [2018-02-02 08:57:10,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:57:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 189 transitions. [2018-02-02 08:57:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 08:57:10,086 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:10,086 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:10,086 INFO L371 AbstractCegarLoop]: === Iteration 3 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:10,086 INFO L82 PathProgramCache]: Analyzing trace with hash 809839361, now seen corresponding path program 1 times [2018-02-02 08:57:10,086 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:10,087 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:10,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:10,088 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:10,088 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:10,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:10,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:10,147 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:10,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:57:10,147 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:57:10,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:57:10,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:57:10,148 INFO L87 Difference]: Start difference. First operand 176 states and 189 transitions. Second operand 4 states. [2018-02-02 08:57:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:10,270 INFO L93 Difference]: Finished difference Result 175 states and 188 transitions. [2018-02-02 08:57:10,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:57:10,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 08:57:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:10,271 INFO L225 Difference]: With dead ends: 175 [2018-02-02 08:57:10,271 INFO L226 Difference]: Without dead ends: 175 [2018-02-02 08:57:10,272 INFO L554 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-02-02 08:57:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-02-02 08:57:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-02-02 08:57:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-02-02 08:57:10,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 188 transitions. [2018-02-02 08:57:10,277 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 188 transitions. Word has length 16 [2018-02-02 08:57:10,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:10,277 INFO L432 AbstractCegarLoop]: Abstraction has 175 states and 188 transitions. [2018-02-02 08:57:10,277 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:57:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 188 transitions. [2018-02-02 08:57:10,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-02-02 08:57:10,278 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:10,278 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:10,278 INFO L371 AbstractCegarLoop]: === Iteration 4 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:10,278 INFO L82 PathProgramCache]: Analyzing trace with hash 809839362, now seen corresponding path program 1 times [2018-02-02 08:57:10,278 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:10,278 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:10,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:10,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:10,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:10,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:10,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:10,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:10,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 08:57:10,365 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 08:57:10,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 08:57:10,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 08:57:10,366 INFO L87 Difference]: Start difference. First operand 175 states and 188 transitions. Second operand 4 states. [2018-02-02 08:57:10,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:10,461 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2018-02-02 08:57:10,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 08:57:10,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-02-02 08:57:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:10,462 INFO L225 Difference]: With dead ends: 174 [2018-02-02 08:57:10,462 INFO L226 Difference]: Without dead ends: 174 [2018-02-02 08:57:10,462 INFO L554 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-02-02 08:57:10,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-02-02 08:57:10,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-02-02 08:57:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 08:57:10,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 187 transitions. [2018-02-02 08:57:10,470 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 187 transitions. Word has length 16 [2018-02-02 08:57:10,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:10,470 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 187 transitions. [2018-02-02 08:57:10,470 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 08:57:10,471 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2018-02-02 08:57:10,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 08:57:10,471 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:10,471 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:10,471 INFO L371 AbstractCegarLoop]: === Iteration 5 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319294, now seen corresponding path program 1 times [2018-02-02 08:57:10,474 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:10,475 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:10,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:10,476 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:10,476 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:10,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:10,581 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:10,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:57:10,581 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:57:10,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:57:10,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:57:10,582 INFO L87 Difference]: Start difference. First operand 174 states and 187 transitions. Second operand 7 states. [2018-02-02 08:57:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:10,815 INFO L93 Difference]: Finished difference Result 182 states and 194 transitions. [2018-02-02 08:57:10,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:57:10,815 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 08:57:10,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:10,817 INFO L225 Difference]: With dead ends: 182 [2018-02-02 08:57:10,817 INFO L226 Difference]: Without dead ends: 182 [2018-02-02 08:57:10,817 INFO L554 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-02-02 08:57:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-02-02 08:57:10,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-02-02 08:57:10,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-02-02 08:57:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 194 transitions. [2018-02-02 08:57:10,825 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 194 transitions. Word has length 19 [2018-02-02 08:57:10,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:10,825 INFO L432 AbstractCegarLoop]: Abstraction has 180 states and 194 transitions. [2018-02-02 08:57:10,833 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:57:10,833 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 194 transitions. [2018-02-02 08:57:10,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 08:57:10,834 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:10,834 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:10,834 INFO L371 AbstractCegarLoop]: === Iteration 6 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:10,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1093319295, now seen corresponding path program 1 times [2018-02-02 08:57:10,834 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:10,835 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:10,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:10,835 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:10,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:10,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:10,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:10,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:10,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:10,960 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:57:10,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:57:10,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:57:10,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:57:10,961 INFO L87 Difference]: Start difference. First operand 180 states and 194 transitions. Second operand 9 states. [2018-02-02 08:57:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:11,279 INFO L93 Difference]: Finished difference Result 177 states and 189 transitions. [2018-02-02 08:57:11,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 08:57:11,279 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-02-02 08:57:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:11,280 INFO L225 Difference]: With dead ends: 177 [2018-02-02 08:57:11,280 INFO L226 Difference]: Without dead ends: 177 [2018-02-02 08:57:11,280 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:57:11,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-02-02 08:57:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-02-02 08:57:11,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-02-02 08:57:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 189 transitions. [2018-02-02 08:57:11,285 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 189 transitions. Word has length 19 [2018-02-02 08:57:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:11,285 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 189 transitions. [2018-02-02 08:57:11,285 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:57:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 189 transitions. [2018-02-02 08:57:11,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 08:57:11,285 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:11,285 INFO L351 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-02-02 08:57:11,285 INFO L371 AbstractCegarLoop]: === Iteration 7 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:11,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678693, now seen corresponding path program 1 times [2018-02-02 08:57:11,286 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:11,286 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:11,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:11,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:11,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:11,305 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:11,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:11,393 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:11,394 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 08:57:11,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:57:11,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:57:11,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:57:11,394 INFO L87 Difference]: Start difference. First operand 177 states and 189 transitions. Second operand 10 states. [2018-02-02 08:57:11,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:11,689 INFO L93 Difference]: Finished difference Result 203 states and 217 transitions. [2018-02-02 08:57:11,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:57:11,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-02-02 08:57:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:11,690 INFO L225 Difference]: With dead ends: 203 [2018-02-02 08:57:11,690 INFO L226 Difference]: Without dead ends: 203 [2018-02-02 08:57:11,691 INFO L554 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-02-02 08:57:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-02 08:57:11,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 195. [2018-02-02 08:57:11,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 08:57:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2018-02-02 08:57:11,702 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 22 [2018-02-02 08:57:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:11,702 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2018-02-02 08:57:11,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:57:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2018-02-02 08:57:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-02-02 08:57:11,702 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:11,702 INFO L351 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-02-02 08:57:11,702 INFO L371 AbstractCegarLoop]: === Iteration 8 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:11,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1956678692, now seen corresponding path program 1 times [2018-02-02 08:57:11,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:11,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:11,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:11,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:11,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:11,716 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:11,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:11,861 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 08:57:11,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:57:11,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:57:11,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:57:11,861 INFO L87 Difference]: Start difference. First operand 195 states and 216 transitions. Second operand 11 states. [2018-02-02 08:57:12,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:12,764 INFO L93 Difference]: Finished difference Result 362 states and 386 transitions. [2018-02-02 08:57:12,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 08:57:12,764 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-02-02 08:57:12,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:12,766 INFO L225 Difference]: With dead ends: 362 [2018-02-02 08:57:12,766 INFO L226 Difference]: Without dead ends: 362 [2018-02-02 08:57:12,766 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2018-02-02 08:57:12,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-02-02 08:57:12,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 290. [2018-02-02 08:57:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-02-02 08:57:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 356 transitions. [2018-02-02 08:57:12,777 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 356 transitions. Word has length 22 [2018-02-02 08:57:12,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:12,777 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 356 transitions. [2018-02-02 08:57:12,777 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:57:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 356 transitions. [2018-02-02 08:57:12,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:57:12,777 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:12,778 INFO L351 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-02-02 08:57:12,778 INFO L371 AbstractCegarLoop]: === Iteration 9 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:12,778 INFO L82 PathProgramCache]: Analyzing trace with hash -527497365, now seen corresponding path program 1 times [2018-02-02 08:57:12,778 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:12,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:12,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:12,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:12,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:12,790 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:12,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:12,851 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:12,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 08:57:12,852 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 08:57:12,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 08:57:12,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 08:57:12,852 INFO L87 Difference]: Start difference. First operand 290 states and 356 transitions. Second operand 7 states. [2018-02-02 08:57:13,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:13,033 INFO L93 Difference]: Finished difference Result 302 states and 364 transitions. [2018-02-02 08:57:13,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:57:13,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 08:57:13,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:13,034 INFO L225 Difference]: With dead ends: 302 [2018-02-02 08:57:13,035 INFO L226 Difference]: Without dead ends: 302 [2018-02-02 08:57:13,035 INFO L554 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-02-02 08:57:13,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-02-02 08:57:13,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 206. [2018-02-02 08:57:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 08:57:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 227 transitions. [2018-02-02 08:57:13,041 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 227 transitions. Word has length 23 [2018-02-02 08:57:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:13,042 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 227 transitions. [2018-02-02 08:57:13,042 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 08:57:13,042 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 227 transitions. [2018-02-02 08:57:13,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 08:57:13,042 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:13,043 INFO L351 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-02-02 08:57:13,043 INFO L371 AbstractCegarLoop]: === Iteration 10 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:13,043 INFO L82 PathProgramCache]: Analyzing trace with hash -527497364, now seen corresponding path program 1 times [2018-02-02 08:57:13,043 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:13,043 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:13,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:13,044 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:13,044 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:13,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:13,128 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:13,128 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:57:13,128 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:57:13,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:57:13,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:57:13,128 INFO L87 Difference]: Start difference. First operand 206 states and 227 transitions. Second operand 8 states. [2018-02-02 08:57:13,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:13,333 INFO L93 Difference]: Finished difference Result 210 states and 223 transitions. [2018-02-02 08:57:13,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:57:13,334 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-02-02 08:57:13,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:13,335 INFO L225 Difference]: With dead ends: 210 [2018-02-02 08:57:13,335 INFO L226 Difference]: Without dead ends: 210 [2018-02-02 08:57:13,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:57:13,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-02-02 08:57:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 206. [2018-02-02 08:57:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-02-02 08:57:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2018-02-02 08:57:13,339 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 23 [2018-02-02 08:57:13,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:13,339 INFO L432 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2018-02-02 08:57:13,339 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:57:13,339 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2018-02-02 08:57:13,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:57:13,339 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:13,339 INFO L351 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-02-02 08:57:13,340 INFO L371 AbstractCegarLoop]: === Iteration 11 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:13,340 INFO L82 PathProgramCache]: Analyzing trace with hash -118827570, now seen corresponding path program 1 times [2018-02-02 08:57:13,340 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:13,340 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:13,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:13,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:13,341 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:13,347 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:13,378 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:13,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:57:13,378 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:57:13,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:57:13,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:57:13,379 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand 5 states. [2018-02-02 08:57:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:13,503 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2018-02-02 08:57:13,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:57:13,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-02-02 08:57:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:13,505 INFO L225 Difference]: With dead ends: 205 [2018-02-02 08:57:13,505 INFO L226 Difference]: Without dead ends: 205 [2018-02-02 08:57:13,505 INFO L554 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-02-02 08:57:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-02-02 08:57:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-02-02 08:57:13,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 08:57:13,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 220 transitions. [2018-02-02 08:57:13,513 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 220 transitions. Word has length 25 [2018-02-02 08:57:13,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:13,513 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 220 transitions. [2018-02-02 08:57:13,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:57:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 220 transitions. [2018-02-02 08:57:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 08:57:13,514 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:13,514 INFO L351 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-02-02 08:57:13,514 INFO L371 AbstractCegarLoop]: === Iteration 12 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:13,514 INFO L82 PathProgramCache]: Analyzing trace with hash -118827569, now seen corresponding path program 1 times [2018-02-02 08:57:13,514 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:13,514 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:13,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:13,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:13,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:13,523 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:13,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:13,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:57:13,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:57:13,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:57:13,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:57:13,611 INFO L87 Difference]: Start difference. First operand 205 states and 220 transitions. Second operand 8 states. [2018-02-02 08:57:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:13,761 INFO L93 Difference]: Finished difference Result 207 states and 218 transitions. [2018-02-02 08:57:13,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 08:57:13,761 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-02-02 08:57:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:13,762 INFO L225 Difference]: With dead ends: 207 [2018-02-02 08:57:13,762 INFO L226 Difference]: Without dead ends: 207 [2018-02-02 08:57:13,762 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:57:13,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-02-02 08:57:13,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-02-02 08:57:13,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-02-02 08:57:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 218 transitions. [2018-02-02 08:57:13,765 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 218 transitions. Word has length 25 [2018-02-02 08:57:13,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:13,766 INFO L432 AbstractCegarLoop]: Abstraction has 205 states and 218 transitions. [2018-02-02 08:57:13,766 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:57:13,766 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 218 transitions. [2018-02-02 08:57:13,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 08:57:13,766 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:13,766 INFO L351 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] [2018-02-02 08:57:13,766 INFO L371 AbstractCegarLoop]: === Iteration 13 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:13,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858492, now seen corresponding path program 1 times [2018-02-02 08:57:13,767 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:13,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:13,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:13,768 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:13,768 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:13,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:13,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:13,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:57:13,819 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:57:13,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:57:13,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:57:13,819 INFO L87 Difference]: Start difference. First operand 205 states and 218 transitions. Second operand 9 states. [2018-02-02 08:57:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:14,144 INFO L93 Difference]: Finished difference Result 204 states and 217 transitions. [2018-02-02 08:57:14,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:57:14,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2018-02-02 08:57:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:14,146 INFO L225 Difference]: With dead ends: 204 [2018-02-02 08:57:14,147 INFO L226 Difference]: Without dead ends: 204 [2018-02-02 08:57:14,147 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:57:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-02-02 08:57:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-02-02 08:57:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-02-02 08:57:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 217 transitions. [2018-02-02 08:57:14,152 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 217 transitions. Word has length 41 [2018-02-02 08:57:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:14,152 INFO L432 AbstractCegarLoop]: Abstraction has 204 states and 217 transitions. [2018-02-02 08:57:14,152 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:57:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 217 transitions. [2018-02-02 08:57:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-02-02 08:57:14,153 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:14,153 INFO L351 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] [2018-02-02 08:57:14,153 INFO L371 AbstractCegarLoop]: === Iteration 14 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:14,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1902858493, now seen corresponding path program 1 times [2018-02-02 08:57:14,153 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:14,153 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:14,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:14,154 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:14,154 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:14,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:14,278 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:14,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 08:57:14,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:57:14,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:57:14,279 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:57:14,279 INFO L87 Difference]: Start difference. First operand 204 states and 217 transitions. Second operand 11 states. [2018-02-02 08:57:14,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:14,741 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2018-02-02 08:57:14,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:57:14,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-02-02 08:57:14,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:14,742 INFO L225 Difference]: With dead ends: 203 [2018-02-02 08:57:14,742 INFO L226 Difference]: Without dead ends: 203 [2018-02-02 08:57:14,742 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-02-02 08:57:14,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-02-02 08:57:14,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-02-02 08:57:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-02-02 08:57:14,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 216 transitions. [2018-02-02 08:57:14,745 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 216 transitions. Word has length 41 [2018-02-02 08:57:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:14,746 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 216 transitions. [2018-02-02 08:57:14,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:57:14,746 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 216 transitions. [2018-02-02 08:57:14,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 08:57:14,746 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:14,746 INFO L351 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] [2018-02-02 08:57:14,747 INFO L371 AbstractCegarLoop]: === Iteration 15 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:14,747 INFO L82 PathProgramCache]: Analyzing trace with hash 873260496, now seen corresponding path program 1 times [2018-02-02 08:57:14,747 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:14,747 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:14,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:14,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:14,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:14,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:14,761 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:14,958 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:14,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:57:14,959 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -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-02-02 08:57:14,965 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:15,018 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:57:15,278 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-02-02 08:57:15,280 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-02-02 08:57:15,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:15,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:15,285 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-02-02 08:57:15,285 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2018-02-02 08:57:15,364 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:15,365 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:15,366 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:15,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 42 [2018-02-02 08:57:15,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:15,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:15,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:35 [2018-02-02 08:57:15,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-02-02 08:57:15,426 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-02-02 08:57:15,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:15,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:15,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:57:15,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:35 [2018-02-02 08:57:15,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-02-02 08:57:15,526 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 19 treesize of output 10 [2018-02-02 08:57:15,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:15,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:15,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 08:57:15,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:24 [2018-02-02 08:57:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:15,641 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:57:15,641 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 33 [2018-02-02 08:57:15,641 INFO L409 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-02-02 08:57:15,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-02-02 08:57:15,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-02-02 08:57:15,641 INFO L87 Difference]: Start difference. First operand 203 states and 216 transitions. Second operand 34 states. [2018-02-02 08:57:17,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:17,623 INFO L93 Difference]: Finished difference Result 291 states and 309 transitions. [2018-02-02 08:57:17,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 08:57:17,624 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2018-02-02 08:57:17,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:17,625 INFO L225 Difference]: With dead ends: 291 [2018-02-02 08:57:17,625 INFO L226 Difference]: Without dead ends: 291 [2018-02-02 08:57:17,626 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=348, Invalid=2304, Unknown=0, NotChecked=0, Total=2652 [2018-02-02 08:57:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-02-02 08:57:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 212. [2018-02-02 08:57:17,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-02-02 08:57:17,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 224 transitions. [2018-02-02 08:57:17,633 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 224 transitions. Word has length 48 [2018-02-02 08:57:17,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:17,633 INFO L432 AbstractCegarLoop]: Abstraction has 212 states and 224 transitions. [2018-02-02 08:57:17,633 INFO L433 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-02-02 08:57:17,633 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 224 transitions. [2018-02-02 08:57:17,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 08:57:17,634 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:17,634 INFO L351 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] [2018-02-02 08:57:17,634 INFO L371 AbstractCegarLoop]: === Iteration 16 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:17,634 INFO L82 PathProgramCache]: Analyzing trace with hash 873260497, now seen corresponding path program 1 times [2018-02-02 08:57:17,634 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:17,635 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:17,635 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:17,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:17,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:17,661 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:18,034 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:18,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:57:18,034 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -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-02-02 08:57:18,039 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:18,077 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:57:18,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:57:18,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-02-02 08:57:18,283 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-02-02 08:57:18,284 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-02-02 08:57:18,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,294 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-02-02 08:57:18,295 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-02-02 08:57:18,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,303 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-02-02 08:57:18,303 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-02-02 08:57:18,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:18,415 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:18,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-02-02 08:57:18,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,425 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 16 treesize of output 15 [2018-02-02 08:57:18,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,432 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:36 [2018-02-02 08:57:18,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-02-02 08:57:18,535 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-02-02 08:57:18,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-02-02 08:57:18,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-02-02 08:57:18,559 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,566 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 1 xjuncts. [2018-02-02 08:57:18,567 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:66, output treesize:36 [2018-02-02 08:57:18,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-02-02 08:57:18,673 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 13 treesize of output 5 [2018-02-02 08:57:18,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-02-02 08:57:18,682 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 16 treesize of output 7 [2018-02-02 08:57:18,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:18,690 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 1 xjuncts. [2018-02-02 08:57:18,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:17 [2018-02-02 08:57:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:18,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:57:18,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 35 [2018-02-02 08:57:18,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-02-02 08:57:18,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-02-02 08:57:18,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1134, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 08:57:18,768 INFO L87 Difference]: Start difference. First operand 212 states and 224 transitions. Second operand 36 states. [2018-02-02 08:57:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:20,618 INFO L93 Difference]: Finished difference Result 273 states and 287 transitions. [2018-02-02 08:57:20,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-02-02 08:57:20,618 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 48 [2018-02-02 08:57:20,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:20,619 INFO L225 Difference]: With dead ends: 273 [2018-02-02 08:57:20,619 INFO L226 Difference]: Without dead ends: 273 [2018-02-02 08:57:20,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=399, Invalid=2907, Unknown=0, NotChecked=0, Total=3306 [2018-02-02 08:57:20,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-02-02 08:57:20,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 195. [2018-02-02 08:57:20,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-02-02 08:57:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 210 transitions. [2018-02-02 08:57:20,626 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 210 transitions. Word has length 48 [2018-02-02 08:57:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:20,626 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 210 transitions. [2018-02-02 08:57:20,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-02-02 08:57:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 210 transitions. [2018-02-02 08:57:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 08:57:20,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:20,628 INFO L351 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-02-02 08:57:20,628 INFO L371 AbstractCegarLoop]: === Iteration 17 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:20,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1302970133, now seen corresponding path program 1 times [2018-02-02 08:57:20,628 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:20,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:20,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:20,629 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:20,629 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:20,648 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:20,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:20,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:20,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:57:20,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:57:20,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:57:20,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:57:20,677 INFO L87 Difference]: Start difference. First operand 195 states and 210 transitions. Second operand 3 states. [2018-02-02 08:57:20,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:20,755 INFO L93 Difference]: Finished difference Result 193 states and 208 transitions. [2018-02-02 08:57:20,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:57:20,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-02 08:57:20,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:20,757 INFO L225 Difference]: With dead ends: 193 [2018-02-02 08:57:20,757 INFO L226 Difference]: Without dead ends: 193 [2018-02-02 08:57:20,757 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:57:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-02-02 08:57:20,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-02-02 08:57:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 08:57:20,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 208 transitions. [2018-02-02 08:57:20,765 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 208 transitions. Word has length 48 [2018-02-02 08:57:20,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:20,765 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 208 transitions. [2018-02-02 08:57:20,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:57:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 208 transitions. [2018-02-02 08:57:20,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-02-02 08:57:20,769 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:20,770 INFO L351 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-02-02 08:57:20,770 INFO L371 AbstractCegarLoop]: === Iteration 18 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:20,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1302970134, now seen corresponding path program 1 times [2018-02-02 08:57:20,770 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:20,770 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:20,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:20,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:20,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:20,796 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:20,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:20,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 08:57:20,845 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 08:57:20,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 08:57:20,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:57:20,846 INFO L87 Difference]: Start difference. First operand 193 states and 208 transitions. Second operand 3 states. [2018-02-02 08:57:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:20,908 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2018-02-02 08:57:20,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 08:57:20,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-02-02 08:57:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:20,910 INFO L225 Difference]: With dead ends: 191 [2018-02-02 08:57:20,910 INFO L226 Difference]: Without dead ends: 191 [2018-02-02 08:57:20,910 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 08:57:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-02-02 08:57:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-02-02 08:57:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-02-02 08:57:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 206 transitions. [2018-02-02 08:57:20,914 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 206 transitions. Word has length 48 [2018-02-02 08:57:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:20,917 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 206 transitions. [2018-02-02 08:57:20,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 08:57:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 206 transitions. [2018-02-02 08:57:20,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 08:57:20,918 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:20,918 INFO L351 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] [2018-02-02 08:57:20,918 INFO L371 AbstractCegarLoop]: === Iteration 19 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:20,918 INFO L82 PathProgramCache]: Analyzing trace with hash 467934037, now seen corresponding path program 1 times [2018-02-02 08:57:20,918 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:20,918 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:20,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:20,919 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:20,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:20,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:21,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:21,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 08:57:21,004 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-02-02 08:57:21,004 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-02-02 08:57:21,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:57:21,005 INFO L87 Difference]: Start difference. First operand 191 states and 206 transitions. Second operand 11 states. [2018-02-02 08:57:21,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:21,821 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2018-02-02 08:57:21,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-02-02 08:57:21,821 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-02-02 08:57:21,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:21,822 INFO L225 Difference]: With dead ends: 275 [2018-02-02 08:57:21,822 INFO L226 Difference]: Without dead ends: 275 [2018-02-02 08:57:21,822 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2018-02-02 08:57:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-02-02 08:57:21,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 193. [2018-02-02 08:57:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-02-02 08:57:21,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 209 transitions. [2018-02-02 08:57:21,827 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 209 transitions. Word has length 55 [2018-02-02 08:57:21,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:21,827 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 209 transitions. [2018-02-02 08:57:21,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-02-02 08:57:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 209 transitions. [2018-02-02 08:57:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-02-02 08:57:21,828 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:21,828 INFO L351 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] [2018-02-02 08:57:21,828 INFO L371 AbstractCegarLoop]: === Iteration 20 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:21,828 INFO L82 PathProgramCache]: Analyzing trace with hash 467934038, now seen corresponding path program 1 times [2018-02-02 08:57:21,829 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:21,829 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:21,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:21,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:21,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:21,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:21,843 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:22,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:22,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:22,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 08:57:22,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:57:22,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:57:22,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:57:22,043 INFO L87 Difference]: Start difference. First operand 193 states and 209 transitions. Second operand 12 states. [2018-02-02 08:57:22,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:22,778 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2018-02-02 08:57:22,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-02 08:57:22,778 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-02-02 08:57:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:22,779 INFO L225 Difference]: With dead ends: 223 [2018-02-02 08:57:22,779 INFO L226 Difference]: Without dead ends: 223 [2018-02-02 08:57:22,779 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2018-02-02 08:57:22,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-02-02 08:57:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 196. [2018-02-02 08:57:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 08:57:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 211 transitions. [2018-02-02 08:57:22,782 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 211 transitions. Word has length 55 [2018-02-02 08:57:22,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:22,782 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 211 transitions. [2018-02-02 08:57:22,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:57:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 211 transitions. [2018-02-02 08:57:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-02-02 08:57:22,782 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:22,782 INFO L351 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] [2018-02-02 08:57:22,782 INFO L371 AbstractCegarLoop]: === Iteration 21 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1242217214, now seen corresponding path program 1 times [2018-02-02 08:57:22,783 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:22,783 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:22,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:22,783 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:22,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:22,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:22,792 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:22,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:22,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:22,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 08:57:22,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-02-02 08:57:22,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-02-02 08:57:22,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-02-02 08:57:22,924 INFO L87 Difference]: Start difference. First operand 196 states and 211 transitions. Second operand 16 states. [2018-02-02 08:57:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:23,874 INFO L93 Difference]: Finished difference Result 233 states and 255 transitions. [2018-02-02 08:57:23,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 08:57:23,875 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-02-02 08:57:23,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:23,875 INFO L225 Difference]: With dead ends: 233 [2018-02-02 08:57:23,876 INFO L226 Difference]: Without dead ends: 233 [2018-02-02 08:57:23,876 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2018-02-02 08:57:23,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-02-02 08:57:23,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 196. [2018-02-02 08:57:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-02-02 08:57:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 210 transitions. [2018-02-02 08:57:23,879 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 210 transitions. Word has length 58 [2018-02-02 08:57:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:23,880 INFO L432 AbstractCegarLoop]: Abstraction has 196 states and 210 transitions. [2018-02-02 08:57:23,880 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-02-02 08:57:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 210 transitions. [2018-02-02 08:57:23,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-02-02 08:57:23,881 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:23,881 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:23,881 INFO L371 AbstractCegarLoop]: === Iteration 22 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:23,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1552523800, now seen corresponding path program 1 times [2018-02-02 08:57:23,881 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:23,881 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:23,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:23,882 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:23,882 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:23,894 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:24,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:24,193 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:57:24,193 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:57:24,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:24,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:57:24,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-02-02 08:57:24,362 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 11 treesize of output 3 [2018-02-02 08:57:24,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:24,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:24,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:24,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-02-02 08:57:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:24,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 08:57:24,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 28 [2018-02-02 08:57:24,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 08:57:24,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 08:57:24,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2018-02-02 08:57:24,417 INFO L87 Difference]: Start difference. First operand 196 states and 210 transitions. Second operand 28 states. [2018-02-02 08:57:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:25,800 INFO L93 Difference]: Finished difference Result 204 states and 214 transitions. [2018-02-02 08:57:25,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-02-02 08:57:25,800 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-02-02 08:57:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:25,801 INFO L225 Difference]: With dead ends: 204 [2018-02-02 08:57:25,801 INFO L226 Difference]: Without dead ends: 192 [2018-02-02 08:57:25,802 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=459, Invalid=3201, Unknown=0, NotChecked=0, Total=3660 [2018-02-02 08:57:25,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-02-02 08:57:25,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 174. [2018-02-02 08:57:25,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-02-02 08:57:25,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 182 transitions. [2018-02-02 08:57:25,805 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 182 transitions. Word has length 60 [2018-02-02 08:57:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:25,806 INFO L432 AbstractCegarLoop]: Abstraction has 174 states and 182 transitions. [2018-02-02 08:57:25,806 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 08:57:25,806 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 182 transitions. [2018-02-02 08:57:25,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 08:57:25,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:25,806 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:25,807 INFO L371 AbstractCegarLoop]: === Iteration 23 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:25,807 INFO L82 PathProgramCache]: Analyzing trace with hash 11633541, now seen corresponding path program 1 times [2018-02-02 08:57:25,807 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:25,807 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:25,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:25,808 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:25,808 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:25,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:26,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:57:26,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:26,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-02 08:57:26,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-02 08:57:26,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-02 08:57:26,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-02 08:57:26,059 INFO L87 Difference]: Start difference. First operand 174 states and 182 transitions. Second operand 17 states. [2018-02-02 08:57:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:26,679 INFO L93 Difference]: Finished difference Result 265 states and 287 transitions. [2018-02-02 08:57:26,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-02 08:57:26,680 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 65 [2018-02-02 08:57:26,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:26,681 INFO L225 Difference]: With dead ends: 265 [2018-02-02 08:57:26,681 INFO L226 Difference]: Without dead ends: 265 [2018-02-02 08:57:26,682 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=767, Unknown=0, NotChecked=0, Total=870 [2018-02-02 08:57:26,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-02-02 08:57:26,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 210. [2018-02-02 08:57:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 08:57:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 227 transitions. [2018-02-02 08:57:26,686 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 227 transitions. Word has length 65 [2018-02-02 08:57:26,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:26,687 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 227 transitions. [2018-02-02 08:57:26,687 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-02 08:57:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 227 transitions. [2018-02-02 08:57:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-02-02 08:57:26,687 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:26,688 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:26,688 INFO L371 AbstractCegarLoop]: === Iteration 24 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:26,688 INFO L82 PathProgramCache]: Analyzing trace with hash 11633542, now seen corresponding path program 1 times [2018-02-02 08:57:26,688 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:26,688 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:26,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:26,689 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:26,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:26,713 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:57:27,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:27,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-02 08:57:27,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-02 08:57:27,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-02 08:57:27,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2018-02-02 08:57:27,315 INFO L87 Difference]: Start difference. First operand 210 states and 227 transitions. Second operand 20 states. [2018-02-02 08:57:28,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:28,334 INFO L93 Difference]: Finished difference Result 258 states and 278 transitions. [2018-02-02 08:57:28,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-02 08:57:28,334 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-02-02 08:57:28,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:28,335 INFO L225 Difference]: With dead ends: 258 [2018-02-02 08:57:28,335 INFO L226 Difference]: Without dead ends: 258 [2018-02-02 08:57:28,336 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=1110, Unknown=0, NotChecked=0, Total=1260 [2018-02-02 08:57:28,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-02-02 08:57:28,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 210. [2018-02-02 08:57:28,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-02-02 08:57:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 225 transitions. [2018-02-02 08:57:28,339 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 225 transitions. Word has length 65 [2018-02-02 08:57:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:28,340 INFO L432 AbstractCegarLoop]: Abstraction has 210 states and 225 transitions. [2018-02-02 08:57:28,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-02 08:57:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 225 transitions. [2018-02-02 08:57:28,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 08:57:28,340 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:28,341 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:28,341 INFO L371 AbstractCegarLoop]: === Iteration 25 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:28,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1238238810, now seen corresponding path program 1 times [2018-02-02 08:57:28,341 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:28,341 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:28,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:28,342 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:28,342 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:28,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:57:28,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:28,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:57:28,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:57:28,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:57:28,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:57:28,376 INFO L87 Difference]: Start difference. First operand 210 states and 225 transitions. Second operand 5 states. [2018-02-02 08:57:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:28,506 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2018-02-02 08:57:28,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:57:28,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-02 08:57:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:28,507 INFO L225 Difference]: With dead ends: 217 [2018-02-02 08:57:28,507 INFO L226 Difference]: Without dead ends: 217 [2018-02-02 08:57:28,507 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-02 08:57:28,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-02-02 08:57:28,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2018-02-02 08:57:28,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 08:57:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 232 transitions. [2018-02-02 08:57:28,510 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 232 transitions. Word has length 67 [2018-02-02 08:57:28,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:28,511 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 232 transitions. [2018-02-02 08:57:28,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:57:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 232 transitions. [2018-02-02 08:57:28,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 08:57:28,511 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:28,511 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:28,511 INFO L371 AbstractCegarLoop]: === Iteration 26 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:28,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1238238809, now seen corresponding path program 1 times [2018-02-02 08:57:28,511 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:28,511 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:28,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:28,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:28,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:28,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:57:28,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:28,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 08:57:28,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:57:28,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:57:28,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:57:28,557 INFO L87 Difference]: Start difference. First operand 216 states and 232 transitions. Second operand 5 states. [2018-02-02 08:57:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:28,687 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2018-02-02 08:57:28,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 08:57:28,687 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-02 08:57:28,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:28,688 INFO L225 Difference]: With dead ends: 216 [2018-02-02 08:57:28,688 INFO L226 Difference]: Without dead ends: 216 [2018-02-02 08:57:28,689 INFO L554 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-02-02 08:57:28,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-02-02 08:57:28,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-02-02 08:57:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-02-02 08:57:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 231 transitions. [2018-02-02 08:57:28,692 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 231 transitions. Word has length 67 [2018-02-02 08:57:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:28,693 INFO L432 AbstractCegarLoop]: Abstraction has 216 states and 231 transitions. [2018-02-02 08:57:28,693 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:57:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 231 transitions. [2018-02-02 08:57:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-02-02 08:57:28,694 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:28,694 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:28,694 INFO L371 AbstractCegarLoop]: === Iteration 27 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:28,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1238184798, now seen corresponding path program 1 times [2018-02-02 08:57:28,694 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:28,694 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:28,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:28,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:28,695 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:28,706 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:28,739 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:57:28,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:28,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 08:57:28,740 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 08:57:28,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 08:57:28,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 08:57:28,740 INFO L87 Difference]: Start difference. First operand 216 states and 231 transitions. Second operand 5 states. [2018-02-02 08:57:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:28,755 INFO L93 Difference]: Finished difference Result 222 states and 237 transitions. [2018-02-02 08:57:28,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-02 08:57:28,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-02-02 08:57:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:28,758 INFO L225 Difference]: With dead ends: 222 [2018-02-02 08:57:28,758 INFO L226 Difference]: Without dead ends: 222 [2018-02-02 08:57:28,758 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-02-02 08:57:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-02-02 08:57:28,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-02-02 08:57:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-02-02 08:57:28,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 237 transitions. [2018-02-02 08:57:28,762 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 237 transitions. Word has length 67 [2018-02-02 08:57:28,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:28,763 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 237 transitions. [2018-02-02 08:57:28,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 08:57:28,763 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 237 transitions. [2018-02-02 08:57:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 08:57:28,763 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:28,763 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:28,764 INFO L371 AbstractCegarLoop]: === Iteration 28 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:28,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1101923251, now seen corresponding path program 1 times [2018-02-02 08:57:28,764 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:28,764 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:28,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:28,765 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:28,765 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:28,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:28,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:57:28,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:28,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:57:28,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:57:28,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:57:28,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:57:28,875 INFO L87 Difference]: Start difference. First operand 222 states and 237 transitions. Second operand 9 states. [2018-02-02 08:57:29,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:29,147 INFO L93 Difference]: Finished difference Result 244 states and 262 transitions. [2018-02-02 08:57:29,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:57:29,147 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-02-02 08:57:29,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:29,148 INFO L225 Difference]: With dead ends: 244 [2018-02-02 08:57:29,148 INFO L226 Difference]: Without dead ends: 244 [2018-02-02 08:57:29,148 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:57:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-02-02 08:57:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 237. [2018-02-02 08:57:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 08:57:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 259 transitions. [2018-02-02 08:57:29,153 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 259 transitions. Word has length 70 [2018-02-02 08:57:29,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:29,153 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 259 transitions. [2018-02-02 08:57:29,153 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:57:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 259 transitions. [2018-02-02 08:57:29,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-02-02 08:57:29,154 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:29,154 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:29,154 INFO L371 AbstractCegarLoop]: === Iteration 29 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:29,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1101923252, now seen corresponding path program 1 times [2018-02-02 08:57:29,154 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:29,154 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:29,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:29,155 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:29,155 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:29,167 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:57:29,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:29,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-02-02 08:57:29,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-02 08:57:29,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-02 08:57:29,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-02-02 08:57:29,314 INFO L87 Difference]: Start difference. First operand 237 states and 259 transitions. Second operand 9 states. [2018-02-02 08:57:29,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:29,605 INFO L93 Difference]: Finished difference Result 243 states and 261 transitions. [2018-02-02 08:57:29,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:57:29,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2018-02-02 08:57:29,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:29,607 INFO L225 Difference]: With dead ends: 243 [2018-02-02 08:57:29,607 INFO L226 Difference]: Without dead ends: 243 [2018-02-02 08:57:29,607 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-02-02 08:57:29,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-02-02 08:57:29,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2018-02-02 08:57:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-02-02 08:57:29,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 258 transitions. [2018-02-02 08:57:29,611 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 258 transitions. Word has length 70 [2018-02-02 08:57:29,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:29,612 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 258 transitions. [2018-02-02 08:57:29,612 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-02 08:57:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 258 transitions. [2018-02-02 08:57:29,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 08:57:29,612 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:29,613 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:29,613 INFO L371 AbstractCegarLoop]: === Iteration 30 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:29,613 INFO L82 PathProgramCache]: Analyzing trace with hash -200117613, now seen corresponding path program 1 times [2018-02-02 08:57:29,613 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:29,613 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:29,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:29,614 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:29,614 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:29,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:29,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 08:57:29,738 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:29,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-02 08:57:29,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 08:57:29,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 08:57:29,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-02-02 08:57:29,738 INFO L87 Difference]: Start difference. First operand 237 states and 258 transitions. Second operand 10 states. [2018-02-02 08:57:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:30,025 INFO L93 Difference]: Finished difference Result 249 states and 268 transitions. [2018-02-02 08:57:30,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:57:30,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 71 [2018-02-02 08:57:30,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:30,026 INFO L225 Difference]: With dead ends: 249 [2018-02-02 08:57:30,026 INFO L226 Difference]: Without dead ends: 249 [2018-02-02 08:57:30,027 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-02-02 08:57:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-02-02 08:57:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 244. [2018-02-02 08:57:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 08:57:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 268 transitions. [2018-02-02 08:57:30,029 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 268 transitions. Word has length 71 [2018-02-02 08:57:30,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:30,029 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 268 transitions. [2018-02-02 08:57:30,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 08:57:30,030 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 268 transitions. [2018-02-02 08:57:30,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-02-02 08:57:30,030 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:30,030 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:30,030 INFO L371 AbstractCegarLoop]: === Iteration 31 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:30,030 INFO L82 PathProgramCache]: Analyzing trace with hash -200117612, now seen corresponding path program 1 times [2018-02-02 08:57:30,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:30,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:30,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:30,031 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:30,031 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:30,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:30,162 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 08:57:30,162 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:30,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-02 08:57:30,163 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-02 08:57:30,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-02 08:57:30,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-02 08:57:30,163 INFO L87 Difference]: Start difference. First operand 244 states and 268 transitions. Second operand 12 states. [2018-02-02 08:57:30,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:30,507 INFO L93 Difference]: Finished difference Result 248 states and 266 transitions. [2018-02-02 08:57:30,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 08:57:30,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2018-02-02 08:57:30,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:30,509 INFO L225 Difference]: With dead ends: 248 [2018-02-02 08:57:30,509 INFO L226 Difference]: Without dead ends: 248 [2018-02-02 08:57:30,509 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2018-02-02 08:57:30,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-02-02 08:57:30,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 244. [2018-02-02 08:57:30,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-02-02 08:57:30,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 266 transitions. [2018-02-02 08:57:30,511 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 266 transitions. Word has length 71 [2018-02-02 08:57:30,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:30,512 INFO L432 AbstractCegarLoop]: Abstraction has 244 states and 266 transitions. [2018-02-02 08:57:30,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-02 08:57:30,512 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 266 transitions. [2018-02-02 08:57:30,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-02-02 08:57:30,512 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:30,513 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:30,513 INFO L371 AbstractCegarLoop]: === Iteration 32 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:30,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1908678729, now seen corresponding path program 1 times [2018-02-02 08:57:30,513 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:30,513 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:30,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:30,514 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:30,514 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:30,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-02-02 08:57:30,803 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:30,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 08:57:30,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-02-02 08:57:30,804 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-02-02 08:57:30,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-02-02 08:57:30,804 INFO L87 Difference]: Start difference. First operand 244 states and 266 transitions. Second operand 22 states. [2018-02-02 08:57:32,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:32,002 INFO L93 Difference]: Finished difference Result 294 states and 320 transitions. [2018-02-02 08:57:32,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 08:57:32,002 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-02-02 08:57:32,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:32,003 INFO L225 Difference]: With dead ends: 294 [2018-02-02 08:57:32,003 INFO L226 Difference]: Without dead ends: 294 [2018-02-02 08:57:32,004 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=311, Invalid=2445, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 08:57:32,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-02-02 08:57:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 240. [2018-02-02 08:57:32,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-02-02 08:57:32,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 261 transitions. [2018-02-02 08:57:32,007 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 261 transitions. Word has length 72 [2018-02-02 08:57:32,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:32,007 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 261 transitions. [2018-02-02 08:57:32,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-02-02 08:57:32,007 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 261 transitions. [2018-02-02 08:57:32,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 08:57:32,007 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:32,007 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:32,007 INFO L371 AbstractCegarLoop]: === Iteration 33 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:32,008 INFO L82 PathProgramCache]: Analyzing trace with hash 334330969, now seen corresponding path program 1 times [2018-02-02 08:57:32,008 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:32,008 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:32,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:32,008 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:32,008 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:32,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:32,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:57:32,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:32,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2018-02-02 08:57:32,794 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-02-02 08:57:32,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-02-02 08:57:32,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2018-02-02 08:57:32,794 INFO L87 Difference]: Start difference. First operand 240 states and 261 transitions. Second operand 27 states. [2018-02-02 08:57:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:34,637 INFO L93 Difference]: Finished difference Result 300 states and 326 transitions. [2018-02-02 08:57:34,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-02-02 08:57:34,638 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-02-02 08:57:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:34,639 INFO L225 Difference]: With dead ends: 300 [2018-02-02 08:57:34,639 INFO L226 Difference]: Without dead ends: 300 [2018-02-02 08:57:34,640 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=329, Invalid=2751, Unknown=0, NotChecked=0, Total=3080 [2018-02-02 08:57:34,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-02-02 08:57:34,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 251. [2018-02-02 08:57:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-02-02 08:57:34,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 276 transitions. [2018-02-02 08:57:34,645 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 276 transitions. Word has length 76 [2018-02-02 08:57:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:34,645 INFO L432 AbstractCegarLoop]: Abstraction has 251 states and 276 transitions. [2018-02-02 08:57:34,645 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-02-02 08:57:34,645 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 276 transitions. [2018-02-02 08:57:34,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-02-02 08:57:34,646 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:34,646 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:34,646 INFO L371 AbstractCegarLoop]: === Iteration 34 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash 334330970, now seen corresponding path program 1 times [2018-02-02 08:57:34,646 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:34,646 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:34,646 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:34,647 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:34,647 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:34,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:57:35,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:35,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2018-02-02 08:57:35,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-02-02 08:57:35,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-02-02 08:57:35,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-02-02 08:57:35,421 INFO L87 Difference]: Start difference. First operand 251 states and 276 transitions. Second operand 28 states. [2018-02-02 08:57:37,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:37,564 INFO L93 Difference]: Finished difference Result 342 states and 378 transitions. [2018-02-02 08:57:37,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 08:57:37,903 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 76 [2018-02-02 08:57:37,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:37,905 INFO L225 Difference]: With dead ends: 342 [2018-02-02 08:57:37,905 INFO L226 Difference]: Without dead ends: 342 [2018-02-02 08:57:37,906 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=322, Invalid=2434, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 08:57:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-02-02 08:57:37,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 297. [2018-02-02 08:57:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-02-02 08:57:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 325 transitions. [2018-02-02 08:57:37,910 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 325 transitions. Word has length 76 [2018-02-02 08:57:37,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:37,911 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 325 transitions. [2018-02-02 08:57:37,911 INFO L433 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-02-02 08:57:37,911 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 325 transitions. [2018-02-02 08:57:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 08:57:37,911 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:37,911 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:37,911 INFO L371 AbstractCegarLoop]: === Iteration 35 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:37,911 INFO L82 PathProgramCache]: Analyzing trace with hash -415915384, now seen corresponding path program 1 times [2018-02-02 08:57:37,911 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:37,911 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:37,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:37,912 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:37,912 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:37,924 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:57:37,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:37,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 08:57:37,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 08:57:37,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 08:57:37,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-02-02 08:57:37,973 INFO L87 Difference]: Start difference. First operand 297 states and 325 transitions. Second operand 8 states. [2018-02-02 08:57:38,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:38,157 INFO L93 Difference]: Finished difference Result 343 states and 390 transitions. [2018-02-02 08:57:38,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 08:57:38,157 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-02-02 08:57:38,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:38,158 INFO L225 Difference]: With dead ends: 343 [2018-02-02 08:57:38,158 INFO L226 Difference]: Without dead ends: 343 [2018-02-02 08:57:38,158 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-02-02 08:57:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-02-02 08:57:38,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 330. [2018-02-02 08:57:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 08:57:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 375 transitions. [2018-02-02 08:57:38,161 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 375 transitions. Word has length 81 [2018-02-02 08:57:38,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:38,162 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 375 transitions. [2018-02-02 08:57:38,162 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 08:57:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 375 transitions. [2018-02-02 08:57:38,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-02-02 08:57:38,162 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:38,162 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:38,162 INFO L371 AbstractCegarLoop]: === Iteration 36 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:38,162 INFO L82 PathProgramCache]: Analyzing trace with hash -415915383, now seen corresponding path program 1 times [2018-02-02 08:57:38,162 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:38,162 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:38,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:38,163 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:38,163 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:38,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:38,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:38,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:57:38,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:38,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-02-02 08:57:38,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-02-02 08:57:38,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-02-02 08:57:38,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2018-02-02 08:57:38,568 INFO L87 Difference]: Start difference. First operand 330 states and 375 transitions. Second operand 25 states. [2018-02-02 08:57:39,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:39,994 INFO L93 Difference]: Finished difference Result 369 states and 412 transitions. [2018-02-02 08:57:39,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-02-02 08:57:39,994 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2018-02-02 08:57:39,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:39,995 INFO L225 Difference]: With dead ends: 369 [2018-02-02 08:57:39,995 INFO L226 Difference]: Without dead ends: 369 [2018-02-02 08:57:39,996 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=2516, Unknown=0, NotChecked=0, Total=2756 [2018-02-02 08:57:39,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-02-02 08:57:39,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 339. [2018-02-02 08:57:39,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-02-02 08:57:39,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 385 transitions. [2018-02-02 08:57:39,999 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 385 transitions. Word has length 81 [2018-02-02 08:57:39,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:39,999 INFO L432 AbstractCegarLoop]: Abstraction has 339 states and 385 transitions. [2018-02-02 08:57:39,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-02-02 08:57:39,999 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 385 transitions. [2018-02-02 08:57:40,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 08:57:40,000 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:40,000 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:40,000 INFO L371 AbstractCegarLoop]: === Iteration 37 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:40,000 INFO L82 PathProgramCache]: Analyzing trace with hash 924539713, now seen corresponding path program 1 times [2018-02-02 08:57:40,000 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:40,000 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:40,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:40,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:40,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:40,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:57:40,123 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:40,123 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 08:57:40,124 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-02-02 08:57:40,124 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-02-02 08:57:40,124 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-02-02 08:57:40,124 INFO L87 Difference]: Start difference. First operand 339 states and 385 transitions. Second operand 14 states. [2018-02-02 08:57:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:40,768 INFO L93 Difference]: Finished difference Result 382 states and 436 transitions. [2018-02-02 08:57:40,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-02-02 08:57:40,769 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 85 [2018-02-02 08:57:40,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:40,772 INFO L225 Difference]: With dead ends: 382 [2018-02-02 08:57:40,772 INFO L226 Difference]: Without dead ends: 382 [2018-02-02 08:57:40,772 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650 [2018-02-02 08:57:40,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-02-02 08:57:40,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 366. [2018-02-02 08:57:40,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-02 08:57:40,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 422 transitions. [2018-02-02 08:57:40,780 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 422 transitions. Word has length 85 [2018-02-02 08:57:40,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:40,781 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 422 transitions. [2018-02-02 08:57:40,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-02-02 08:57:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 422 transitions. [2018-02-02 08:57:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-02-02 08:57:40,781 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:40,782 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:40,782 INFO L371 AbstractCegarLoop]: === Iteration 38 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:40,782 INFO L82 PathProgramCache]: Analyzing trace with hash 924539714, now seen corresponding path program 1 times [2018-02-02 08:57:40,782 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:40,782 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:40,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:40,783 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:40,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:40,800 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-02-02 08:57:41,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 08:57:41,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-02-02 08:57:41,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-02-02 08:57:41,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-02-02 08:57:41,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-02-02 08:57:41,205 INFO L87 Difference]: Start difference. First operand 366 states and 422 transitions. Second operand 23 states. [2018-02-02 08:57:42,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 08:57:42,658 INFO L93 Difference]: Finished difference Result 397 states and 453 transitions. [2018-02-02 08:57:42,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-02-02 08:57:42,658 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 85 [2018-02-02 08:57:42,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 08:57:42,659 INFO L225 Difference]: With dead ends: 397 [2018-02-02 08:57:42,660 INFO L226 Difference]: Without dead ends: 397 [2018-02-02 08:57:42,660 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 13 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=363, Invalid=1707, Unknown=0, NotChecked=0, Total=2070 [2018-02-02 08:57:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-02-02 08:57:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 366. [2018-02-02 08:57:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-02-02 08:57:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 421 transitions. [2018-02-02 08:57:42,665 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 421 transitions. Word has length 85 [2018-02-02 08:57:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 08:57:42,665 INFO L432 AbstractCegarLoop]: Abstraction has 366 states and 421 transitions. [2018-02-02 08:57:42,665 INFO L433 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-02-02 08:57:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 421 transitions. [2018-02-02 08:57:42,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-02-02 08:57:42,666 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 08:57:42,666 INFO L351 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 08:57:42,666 INFO L371 AbstractCegarLoop]: === Iteration 39 === [__list_addErr1RequiresViolation, __list_addErr3RequiresViolation, __list_addErr0RequiresViolation, __list_addErr2RequiresViolation, __list_addErr4RequiresViolation, __list_addErr7RequiresViolation, __list_addErr5RequiresViolation, __list_addErr6RequiresViolation, val_from_nodeErr0RequiresViolation, val_from_nodeErr1RequiresViolation, gl_sortErr2RequiresViolation, gl_sortErr0RequiresViolation, gl_sortErr1RequiresViolation, gl_sortErr3RequiresViolation, list_emptyErr0RequiresViolation, list_emptyErr1RequiresViolation, mainErr0EnsuresViolation, __list_delErr0RequiresViolation, __list_delErr2RequiresViolation, __list_delErr3RequiresViolation, __list_delErr1RequiresViolation, gl_destroyErr4RequiresViolation, gl_destroyErr2RequiresViolation, gl_destroyErr0RequiresViolation, gl_destroyErr1RequiresViolation, gl_destroyErr6RequiresViolation, gl_destroyErr7RequiresViolation, gl_destroyErr3RequiresViolation, gl_destroyErr5RequiresViolation, ULTIMATE.initErr3RequiresViolation, ULTIMATE.initErr1RequiresViolation, ULTIMATE.initErr2RequiresViolation, ULTIMATE.initErr0RequiresViolation, list_delErr2RequiresViolation, list_delErr4RequiresViolation, list_delErr3RequiresViolation, list_delErr1RequiresViolation, list_delErr7RequiresViolation, list_delErr5RequiresViolation, list_delErr0RequiresViolation, list_delErr6RequiresViolation, list_moveErr0RequiresViolation, list_moveErr3RequiresViolation, list_moveErr2RequiresViolation, list_moveErr1RequiresViolation, list_addErr1RequiresViolation, list_addErr0RequiresViolation, gl_insertErr0RequiresViolation, gl_insertErr1RequiresViolation, gl_seek_maxErr0RequiresViolation, gl_seek_maxErr2RequiresViolation, gl_seek_maxErr1RequiresViolation, gl_seek_maxErr5RequiresViolation, gl_seek_maxErr3RequiresViolation, gl_seek_maxErr4RequiresViolation]=== [2018-02-02 08:57:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1404039901, now seen corresponding path program 1 times [2018-02-02 08:57:42,666 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 08:57:42,666 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 08:57:42,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:42,666 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:42,667 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 08:57:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:42,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 08:57:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-02-02 08:57:43,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 08:57:43,689 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-02 08:57:43,695 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 08:57:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 08:57:43,750 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 08:57:43,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-02-02 08:57:43,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:43,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:43,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-02-02 08:57:43,791 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-02-02 08:57:43,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:43,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:43,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2018-02-02 08:57:43,902 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-02-02 08:57:43,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:43,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:57:43,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-02-02 08:57:44,102 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 13 treesize of output 10 [2018-02-02 08:57:44,104 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 10 treesize of output 9 [2018-02-02 08:57:44,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,111 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-02-02 08:57:44,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-02-02 08:57:44,177 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 14 [2018-02-02 08:57:44,179 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 14 treesize of output 13 [2018-02-02 08:57:44,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,196 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 34 treesize of output 44 [2018-02-02 08:57:44,201 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 35 treesize of output 34 [2018-02-02 08:57:44,201 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,228 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-02-02 08:57:44,228 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:41 [2018-02-02 08:57:44,446 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:44,447 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:44,448 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-02-02 08:57:44,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:57:44,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:59 [2018-02-02 08:57:44,536 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:44,537 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:44,539 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:44,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 21 [2018-02-02 08:57:44,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:57:44,563 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:64, output treesize:57 [2018-02-02 08:57:44,689 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 58 treesize of output 58 [2018-02-02 08:57:44,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 8 treesize of output 7 [2018-02-02 08:57:44,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 40 [2018-02-02 08:57:44,712 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-02-02 08:57:44,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 08:57:44,724 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:79, output treesize:71 [2018-02-02 08:57:44,795 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2018-02-02 08:57:44,797 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:44,798 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 16 treesize of output 23 [2018-02-02 08:57:44,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,821 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 67 treesize of output 65 [2018-02-02 08:57:44,824 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:44,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 08:57:44,825 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:44,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 08:57:44,844 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:97, output treesize:89 [2018-02-02 08:57:45,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 50 [2018-02-02 08:57:45,705 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 11 treesize of output 3 [2018-02-02 08:57:45,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:45,713 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:45,713 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 13 treesize of output 6 [2018-02-02 08:57:45,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:45,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:45,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-02-02 08:57:45,729 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:108, output treesize:71 [2018-02-02 08:57:45,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2018-02-02 08:57:45,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-02-02 08:57:45,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:46,008 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 08:57:46,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-02-02 08:57:46,009 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:46,023 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 08:57:46,023 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 13 treesize of output 6 [2018-02-02 08:57:46,023 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 08:57:46,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:46,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 08:57:46,042 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:77, output treesize:5 [2018-02-02 08:57:46,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 08:57:46,134 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 08:57:46,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 33] total 66 [2018-02-02 08:57:46,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-02-02 08:57:46,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-02-02 08:57:46,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=4196, Unknown=0, NotChecked=0, Total=4422 [2018-02-02 08:57:46,135 INFO L87 Difference]: Start difference. First operand 366 states and 421 transitions. Second operand 67 states. Received shutdown request... [2018-02-02 08:57:57,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-02-02 08:57:57,885 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 08:57:57,890 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 08:57:57,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 08:57:57 BoogieIcfgContainer [2018-02-02 08:57:57,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 08:57:57,891 INFO L168 Benchmark]: Toolchain (without parser) took 49210.42 ms. Allocated memory was 397.4 MB in the beginning and 1.2 GB in the end (delta: 852.0 MB). Free memory was 354.1 MB in the beginning and 1.2 GB in the end (delta: -825.7 MB). Peak memory consumption was 809.7 MB. Max. memory is 5.3 GB. [2018-02-02 08:57:57,892 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 397.4 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 08:57:57,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.91 ms. Allocated memory is still 397.4 MB. Free memory was 354.1 MB in the beginning and 342.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. [2018-02-02 08:57:57,893 INFO L168 Benchmark]: Boogie Preprocessor took 32.28 ms. Allocated memory is still 397.4 MB. Free memory was 342.0 MB in the beginning and 340.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 08:57:57,893 INFO L168 Benchmark]: RCFGBuilder took 548.43 ms. Allocated memory is still 397.4 MB. Free memory was 340.7 MB in the beginning and 295.5 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 5.3 GB. [2018-02-02 08:57:57,893 INFO L168 Benchmark]: TraceAbstraction took 48459.55 ms. Allocated memory was 397.4 MB in the beginning and 1.2 GB in the end (delta: 852.0 MB). Free memory was 295.5 MB in the beginning and 1.2 GB in the end (delta: -884.3 MB). Peak memory consumption was 751.1 MB. Max. memory is 5.3 GB. [2018-02-02 08:57:57,895 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 397.4 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 166.91 ms. Allocated memory is still 397.4 MB. Free memory was 354.1 MB in the beginning and 342.0 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.28 ms. Allocated memory is still 397.4 MB. Free memory was 342.0 MB in the beginning and 340.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 548.43 ms. Allocated memory is still 397.4 MB. Free memory was 340.7 MB in the beginning and 295.5 MB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 48459.55 ms. Allocated memory was 397.4 MB in the beginning and 1.2 GB in the end (delta: 852.0 MB). Free memory was 295.5 MB in the beginning and 1.2 GB in the end (delta: -884.3 MB). Peak memory consumption was 751.1 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 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 632). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 633). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 707). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 714). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 679). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 681). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was constructing difference of abstraction (366states) and interpolant automaton (currently 21 states, 67 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 84 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 179 locations, 55 error locations. TIMEOUT Result, 48.4s OverallTime, 39 OverallIterations, 2 TraceHistogramMax, 35.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5208 SDtfs, 7255 SDslu, 25842 SDs, 0 SdLazy, 36742 SolverSat, 1896 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 23.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1209 GetRequests, 310 SyntacticMatches, 33 SemanticMatches, 865 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6886 ImplicationChecksByTransitivity, 14.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 874 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 2217 NumberOfCodeBlocks, 2217 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 2174 ConstructedInterpolants, 94 QuantifiedInterpolants, 1473969 SizeOfPredicates, 97 NumberOfNonLiveVariables, 1367 ConjunctsInSsa, 282 ConjunctsInUnsatCore, 43 InterpolantComputations, 36 PerfectInterpolantSequences, 148/183 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0134_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_08-57-57-905.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0134_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_08-57-57-905.csv Completed graceful shutdown