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-ext2/split_list_test05_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 09:11:08,231 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 09:11:08,233 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 09:11:08,242 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 09:11:08,242 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 09:11:08,243 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 09:11:08,244 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 09:11:08,245 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 09:11:08,250 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 09:11:08,250 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 09:11:08,251 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 09:11:08,251 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 09:11:08,251 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 09:11:08,252 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 09:11:08,253 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 09:11:08,255 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 09:11:08,257 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 09:11:08,258 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 09:11:08,260 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 09:11:08,261 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 09:11:08,262 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 09:11:08,262 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 09:11:08,263 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 09:11:08,264 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 09:11:08,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 09:11:08,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 09:11:08,266 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 09:11:08,266 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 09:11:08,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 09:11:08,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 09:11:08,267 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 09:11:08,267 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 09:11:08,277 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 09:11:08,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 09:11:08,279 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 09:11:08,279 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 09:11:08,279 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 09:11:08,279 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 09:11:08,279 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 09:11:08,280 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 09:11:08,280 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 09:11:08,280 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 09:11:08,280 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 09:11:08,280 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 09:11:08,280 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 09:11:08,280 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 09:11:08,281 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 09:11:08,281 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 09:11:08,281 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 09:11:08,281 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 09:11:08,281 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 09:11:08,281 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 09:11:08,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 09:11:08,282 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 09:11:08,282 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-02 09:11:08,282 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-02 09:11:08,282 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-02 09:11:08,310 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 09:11:08,321 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 09:11:08,323 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 09:11:08,324 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 09:11:08,325 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 09:11:08,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05_true-valid-memsafety.i [2018-02-02 09:11:08,485 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 09:11:08,486 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 09:11:08,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 09:11:08,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 09:11:08,490 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 09:11:08,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:11:08" (1/1) ... [2018-02-02 09:11:08,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3643a13b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:08, skipping insertion in model container [2018-02-02 09:11:08,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 09:11:08" (1/1) ... [2018-02-02 09:11:08,505 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:11:08,533 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 09:11:08,639 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:11:08,661 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 09:11:08,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:08 WrapperNode [2018-02-02 09:11:08,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 09:11:08,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 09:11:08,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 09:11:08,672 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 09:11:08,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:08" (1/1) ... [2018-02-02 09:11:08,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:08" (1/1) ... [2018-02-02 09:11:08,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:08" (1/1) ... [2018-02-02 09:11:08,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:08" (1/1) ... [2018-02-02 09:11:08,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:08" (1/1) ... [2018-02-02 09:11:08,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:08" (1/1) ... [2018-02-02 09:11:08,707 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:08" (1/1) ... [2018-02-02 09:11:08,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 09:11:08,710 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 09:11:08,710 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 09:11:08,711 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 09:11:08,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11: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 09:11:08,754 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 09:11:08,754 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 09:11:08,754 INFO L136 BoogieDeclarations]: Found implementation of procedure containsHead [2018-02-02 09:11:08,754 INFO L136 BoogieDeclarations]: Found implementation of procedure containsBody [2018-02-02 09:11:08,754 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-02-02 09:11:08,754 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 09:11:08,754 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 09:11:08,754 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 09:11:08,754 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 09:11:08,754 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 09:11:08,754 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 09:11:08,755 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 09:11:08,755 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 09:11:08,755 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-02 09:11:08,755 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-02-02 09:11:08,755 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 09:11:08,755 INFO L128 BoogieDeclarations]: Found specification of procedure containsHead [2018-02-02 09:11:08,755 INFO L128 BoogieDeclarations]: Found specification of procedure containsBody [2018-02-02 09:11:08,755 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-02-02 09:11:08,755 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 09:11:08,755 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 09:11:08,755 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 09:11:09,386 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 09:11:09,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:11:09 BoogieIcfgContainer [2018-02-02 09:11:09,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 09:11:09,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 09:11:09,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 09:11:09,390 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 09:11:09,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 09:11:08" (1/3) ... [2018-02-02 09:11:09,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9ae778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:11:09, skipping insertion in model container [2018-02-02 09:11:09,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 09:11:08" (2/3) ... [2018-02-02 09:11:09,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9ae778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 09:11:09, skipping insertion in model container [2018-02-02 09:11:09,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 09:11:09" (3/3) ... [2018-02-02 09:11:09,394 INFO L107 eAbstractionObserver]: Analyzing ICFG split_list_test05_true-valid-memsafety.i [2018-02-02 09:11:09,402 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-02 09:11:09,410 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 141 error locations. [2018-02-02 09:11:09,447 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 09:11:09,447 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 09:11:09,447 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-02 09:11:09,448 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-02 09:11:09,448 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 09:11:09,448 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 09:11:09,448 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 09:11:09,448 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 09:11:09,449 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 09:11:09,470 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states. [2018-02-02 09:11:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 09:11:09,478 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:11:09,479 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:11:09,479 INFO L371 AbstractCegarLoop]: === Iteration 1 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 09:11:09,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1352779119, now seen corresponding path program 1 times [2018-02-02 09:11:09,484 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:11:09,484 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:11:09,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:09,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:09,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:09,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:11:09,605 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 09:11:09,607 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:11:09,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:11:09,608 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:11:09,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:11:09,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:11:09,689 INFO L87 Difference]: Start difference. First operand 333 states. Second operand 4 states. [2018-02-02 09:11:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:11:10,106 INFO L93 Difference]: Finished difference Result 388 states and 433 transitions. [2018-02-02 09:11:10,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:11:10,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 09:11:10,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:11:10,116 INFO L225 Difference]: With dead ends: 388 [2018-02-02 09:11:10,117 INFO L226 Difference]: Without dead ends: 385 [2018-02-02 09:11:10,118 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 09:11:10,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-02-02 09:11:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 345. [2018-02-02 09:11:10,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-02-02 09:11:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 389 transitions. [2018-02-02 09:11:10,168 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 389 transitions. Word has length 8 [2018-02-02 09:11:10,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:11:10,168 INFO L432 AbstractCegarLoop]: Abstraction has 345 states and 389 transitions. [2018-02-02 09:11:10,168 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:11:10,169 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 389 transitions. [2018-02-02 09:11:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-02-02 09:11:10,169 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:11:10,169 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:11:10,169 INFO L371 AbstractCegarLoop]: === Iteration 2 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 09:11:10,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1352779118, now seen corresponding path program 1 times [2018-02-02 09:11:10,170 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:11:10,170 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:11:10,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:10,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:10,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:10,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:10,183 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:11:10,233 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 09:11:10,233 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:11:10,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:11:10,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:11:10,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:11:10,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:11:10,235 INFO L87 Difference]: Start difference. First operand 345 states and 389 transitions. Second operand 4 states. [2018-02-02 09:11:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:11:10,436 INFO L93 Difference]: Finished difference Result 347 states and 393 transitions. [2018-02-02 09:11:10,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:11:10,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-02-02 09:11:10,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:11:10,438 INFO L225 Difference]: With dead ends: 347 [2018-02-02 09:11:10,439 INFO L226 Difference]: Without dead ends: 347 [2018-02-02 09:11:10,439 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 09:11:10,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-02-02 09:11:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 343. [2018-02-02 09:11:10,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-02-02 09:11:10,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 387 transitions. [2018-02-02 09:11:10,455 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 387 transitions. Word has length 8 [2018-02-02 09:11:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:11:10,455 INFO L432 AbstractCegarLoop]: Abstraction has 343 states and 387 transitions. [2018-02-02 09:11:10,455 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:11:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 387 transitions. [2018-02-02 09:11:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 09:11:10,456 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:11:10,456 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:11:10,456 INFO L371 AbstractCegarLoop]: === Iteration 3 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 09:11:10,456 INFO L82 PathProgramCache]: Analyzing trace with hash 543788340, now seen corresponding path program 1 times [2018-02-02 09:11:10,456 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:11:10,456 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:11:10,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:10,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:10,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:10,479 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:11:10,506 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 09:11:10,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:11:10,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:11:10,507 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:11:10,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:11:10,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:11:10,508 INFO L87 Difference]: Start difference. First operand 343 states and 387 transitions. Second operand 4 states. [2018-02-02 09:11:10,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:11:10,783 INFO L93 Difference]: Finished difference Result 338 states and 382 transitions. [2018-02-02 09:11:10,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:11:10,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-02 09:11:10,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:11:10,785 INFO L225 Difference]: With dead ends: 338 [2018-02-02 09:11:10,785 INFO L226 Difference]: Without dead ends: 338 [2018-02-02 09:11:10,785 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 09:11:10,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-02-02 09:11:10,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-02-02 09:11:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-02-02 09:11:10,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 382 transitions. [2018-02-02 09:11:10,804 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 382 transitions. Word has length 18 [2018-02-02 09:11:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:11:10,805 INFO L432 AbstractCegarLoop]: Abstraction has 338 states and 382 transitions. [2018-02-02 09:11:10,805 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:11:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 382 transitions. [2018-02-02 09:11:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-02 09:11:10,806 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:11:10,806 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 09:11:10,806 INFO L371 AbstractCegarLoop]: === Iteration 4 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 09:11:10,806 INFO L82 PathProgramCache]: Analyzing trace with hash 543788341, now seen corresponding path program 1 times [2018-02-02 09:11:10,806 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:11:10,806 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:11:10,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:10,807 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:10,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:10,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:11:10,862 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 09:11:10,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:11:10,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-02 09:11:10,862 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-02 09:11:10,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-02 09:11:10,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-02 09:11:10,863 INFO L87 Difference]: Start difference. First operand 338 states and 382 transitions. Second operand 4 states. [2018-02-02 09:11:11,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:11:11,009 INFO L93 Difference]: Finished difference Result 333 states and 377 transitions. [2018-02-02 09:11:11,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-02 09:11:11,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-02-02 09:11:11,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:11:11,011 INFO L225 Difference]: With dead ends: 333 [2018-02-02 09:11:11,011 INFO L226 Difference]: Without dead ends: 333 [2018-02-02 09:11:11,012 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 09:11:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-02-02 09:11:11,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-02-02 09:11:11,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-02-02 09:11:11,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 377 transitions. [2018-02-02 09:11:11,022 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 377 transitions. Word has length 18 [2018-02-02 09:11:11,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:11:11,022 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 377 transitions. [2018-02-02 09:11:11,022 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-02 09:11:11,022 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 377 transitions. [2018-02-02 09:11:11,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:11:11,023 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:11:11,023 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 09:11:11,023 INFO L371 AbstractCegarLoop]: === Iteration 5 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 09:11:11,023 INFO L82 PathProgramCache]: Analyzing trace with hash -322430221, now seen corresponding path program 1 times [2018-02-02 09:11:11,023 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:11:11,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:11:11,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:11,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:11,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:11,046 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:11:11,101 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 09:11:11,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:11:11,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 09:11:11,101 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 09:11:11,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 09:11:11,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-02-02 09:11:11,102 INFO L87 Difference]: Start difference. First operand 333 states and 377 transitions. Second operand 7 states. [2018-02-02 09:11:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:11:11,608 INFO L93 Difference]: Finished difference Result 361 states and 404 transitions. [2018-02-02 09:11:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 09:11:11,609 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-02-02 09:11:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:11:11,610 INFO L225 Difference]: With dead ends: 361 [2018-02-02 09:11:11,611 INFO L226 Difference]: Without dead ends: 361 [2018-02-02 09:11:11,611 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:11:11,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-02-02 09:11:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 325. [2018-02-02 09:11:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-02-02 09:11:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 369 transitions. [2018-02-02 09:11:11,620 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 369 transitions. Word has length 19 [2018-02-02 09:11:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:11:11,620 INFO L432 AbstractCegarLoop]: Abstraction has 325 states and 369 transitions. [2018-02-02 09:11:11,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 09:11:11,621 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 369 transitions. [2018-02-02 09:11:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 09:11:11,621 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:11:11,621 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 09:11:11,623 INFO L371 AbstractCegarLoop]: === Iteration 6 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 09:11:11,623 INFO L82 PathProgramCache]: Analyzing trace with hash -322430220, now seen corresponding path program 1 times [2018-02-02 09:11:11,623 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:11:11,623 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:11:11,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:11,624 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:11,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:11,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:11:11,718 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 09:11:11,718 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:11:11,718 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-02 09:11:11,719 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-02 09:11:11,719 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-02 09:11:11,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-02 09:11:11,720 INFO L87 Difference]: Start difference. First operand 325 states and 369 transitions. Second operand 8 states. [2018-02-02 09:11:12,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:11:12,419 INFO L93 Difference]: Finished difference Result 355 states and 400 transitions. [2018-02-02 09:11:12,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 09:11:12,419 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-02 09:11:12,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:11:12,421 INFO L225 Difference]: With dead ends: 355 [2018-02-02 09:11:12,421 INFO L226 Difference]: Without dead ends: 355 [2018-02-02 09:11:12,421 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-02 09:11:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-02-02 09:11:12,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 316. [2018-02-02 09:11:12,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-02-02 09:11:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 359 transitions. [2018-02-02 09:11:12,428 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 359 transitions. Word has length 19 [2018-02-02 09:11:12,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:11:12,429 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 359 transitions. [2018-02-02 09:11:12,429 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-02 09:11:12,429 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 359 transitions. [2018-02-02 09:11:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-02-02 09:11:12,429 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:11:12,429 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] [2018-02-02 09:11:12,429 INFO L371 AbstractCegarLoop]: === Iteration 7 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 09:11:12,430 INFO L82 PathProgramCache]: Analyzing trace with hash 241232367, now seen corresponding path program 1 times [2018-02-02 09:11:12,430 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:11:12,430 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:11:12,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:12,430 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:12,430 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:12,446 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:11:12,572 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 09:11:12,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:11:12,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-02-02 09:11:12,572 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 09:11:12,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 09:11:12,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 09:11:12,573 INFO L87 Difference]: Start difference. First operand 316 states and 359 transitions. Second operand 10 states. [2018-02-02 09:11:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:11:12,887 INFO L93 Difference]: Finished difference Result 339 states and 385 transitions. [2018-02-02 09:11:12,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 09:11:12,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-02-02 09:11:12,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:11:12,889 INFO L225 Difference]: With dead ends: 339 [2018-02-02 09:11:12,889 INFO L226 Difference]: Without dead ends: 339 [2018-02-02 09:11:12,889 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-02-02 09:11:12,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-02-02 09:11:12,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 327. [2018-02-02 09:11:12,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-02-02 09:11:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 372 transitions. [2018-02-02 09:11:12,897 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 372 transitions. Word has length 28 [2018-02-02 09:11:12,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:11:12,897 INFO L432 AbstractCegarLoop]: Abstraction has 327 states and 372 transitions. [2018-02-02 09:11:12,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 09:11:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 372 transitions. [2018-02-02 09:11:12,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-02-02 09:11:12,898 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:11:12,898 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] [2018-02-02 09:11:12,898 INFO L371 AbstractCegarLoop]: === Iteration 8 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 09:11:12,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2037617902, now seen corresponding path program 1 times [2018-02-02 09:11:12,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:11:12,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:11:12,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:12,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:12,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:12,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:11:13,153 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 09:11:13,153 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 09:11:13,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-02-02 09:11:13,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-02 09:11:13,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-02 09:11:13,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-02-02 09:11:13,154 INFO L87 Difference]: Start difference. First operand 327 states and 372 transitions. Second operand 13 states. [2018-02-02 09:11:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:11:13,691 INFO L93 Difference]: Finished difference Result 367 states and 412 transitions. [2018-02-02 09:11:13,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-02-02 09:11:13,692 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-02-02 09:11:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:11:13,693 INFO L225 Difference]: With dead ends: 367 [2018-02-02 09:11:13,693 INFO L226 Difference]: Without dead ends: 367 [2018-02-02 09:11:13,693 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-02-02 09:11:13,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-02-02 09:11:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 330. [2018-02-02 09:11:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-02-02 09:11:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 375 transitions. [2018-02-02 09:11:13,698 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 375 transitions. Word has length 30 [2018-02-02 09:11:13,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:11:13,698 INFO L432 AbstractCegarLoop]: Abstraction has 330 states and 375 transitions. [2018-02-02 09:11:13,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-02 09:11:13,698 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 375 transitions. [2018-02-02 09:11:13,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:11:13,699 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:11:13,699 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 09:11:13,700 INFO L371 AbstractCegarLoop]: === Iteration 9 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 09:11:13,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1742025584, now seen corresponding path program 1 times [2018-02-02 09:11:13,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:11:13,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:11:13,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:13,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:13,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:13,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:11:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:11:14,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:11:14,210 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 09:11:14,218 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:14,272 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:11:14,467 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 09:11:14,470 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 09:11:14,470 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:14,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:14,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:14,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-02-02 09:11:14,512 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 23 treesize of output 35 [2018-02-02 09:11:14,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-02 09:11:14,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:14,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-02-02 09:11:14,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 09:11:14,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:11:14,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:11:14,570 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:70 [2018-02-02 09:11:14,644 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 33 treesize of output 28 [2018-02-02 09:11:14,676 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:14,678 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 18 treesize of output 27 [2018-02-02 09:11:14,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:14,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:14,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 65 [2018-02-02 09:11:14,717 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:14,718 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 61 treesize of output 76 [2018-02-02 09:11:14,718 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:14,771 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:14,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 53 [2018-02-02 09:11:14,782 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-02-02 09:11:14,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:11:14,820 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 3 xjuncts. [2018-02-02 09:11:14,821 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:102, output treesize:115 [2018-02-02 09:11:14,921 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:14,922 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:14,923 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 63 treesize of output 57 [2018-02-02 09:11:14,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:14,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:11:14,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:130, output treesize:57 [2018-02-02 09:11:15,102 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:15,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:15,104 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:15,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-02-02 09:11:15,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:15,115 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 09:11:15,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:76 [2018-02-02 09:11:15,227 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 77 treesize of output 75 [2018-02-02 09:11:15,230 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 09:11:15,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:15,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:15,248 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 09:11:15,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:76 [2018-02-02 09:11:15,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-02-02 09:11:15,312 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 09:11:15,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:15,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:15,330 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 09:11:15,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:76 [2018-02-02 09:11:15,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 73 [2018-02-02 09:11:15,369 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 09:11:15,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:15,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:15,386 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 09:11:15,386 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:89, output treesize:85 [2018-02-02 09:11:15,434 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 58 [2018-02-02 09:11:15,436 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 7 treesize of output 1 [2018-02-02 09:11:15,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:15,443 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:15,443 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 15 treesize of output 8 [2018-02-02 09:11:15,444 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:15,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-02-02 09:11:15,449 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:15,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:15,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-02-02 09:11:15,456 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:94, output treesize:28 [2018-02-02 09:11:15,493 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:11:15,511 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:11:15,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 38 [2018-02-02 09:11:15,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 09:11:15,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 09:11:15,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 09:11:15,512 INFO L87 Difference]: Start difference. First operand 330 states and 375 transitions. Second operand 39 states. [2018-02-02 09:11:20,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:11:20,271 INFO L93 Difference]: Finished difference Result 480 states and 583 transitions. [2018-02-02 09:11:20,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-02-02 09:11:20,271 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 47 [2018-02-02 09:11:20,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:11:20,274 INFO L225 Difference]: With dead ends: 480 [2018-02-02 09:11:20,274 INFO L226 Difference]: Without dead ends: 480 [2018-02-02 09:11:20,275 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=578, Invalid=3582, Unknown=0, NotChecked=0, Total=4160 [2018-02-02 09:11:20,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-02-02 09:11:20,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 335. [2018-02-02 09:11:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-02 09:11:20,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 379 transitions. [2018-02-02 09:11:20,287 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 379 transitions. Word has length 47 [2018-02-02 09:11:20,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:11:20,288 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 379 transitions. [2018-02-02 09:11:20,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 09:11:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 379 transitions. [2018-02-02 09:11:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-02-02 09:11:20,289 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:11:20,289 INFO L351 BasicCegarLoop]: trace histogram [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] [2018-02-02 09:11:20,289 INFO L371 AbstractCegarLoop]: === Iteration 10 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 09:11:20,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1742025585, now seen corresponding path program 1 times [2018-02-02 09:11:20,289 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:11:20,289 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:11:20,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:20,290 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:20,290 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:20,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:20,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:11:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:11:20,828 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:11:20,828 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 09:11:20,833 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:20,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:11:21,001 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 09:11:21,003 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 09:11:21,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,032 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 09:11:21,033 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 09:11:21,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,061 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 09:11:21,061 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:48, output treesize:40 [2018-02-02 09:11:21,100 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 23 treesize of output 35 [2018-02-02 09:11:21,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-02 09:11:21,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-02-02 09:11:21,118 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 09:11:21,126 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:11:21,151 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 23 treesize of output 35 [2018-02-02 09:11:21,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-02-02 09:11:21,153 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-02-02 09:11:21,173 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 09:11:21,183 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:11:21,204 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 4 xjuncts. [2018-02-02 09:11:21,205 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:66, output treesize:212 [2018-02-02 09:11:21,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 157 [2018-02-02 09:11:21,301 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:21,302 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 161 treesize of output 188 [2018-02-02 09:11:21,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,371 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:21,372 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:21,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 161 [2018-02-02 09:11:21,380 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-02-02 09:11:21,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:11:21,538 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 107 treesize of output 90 [2018-02-02 09:11:21,541 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:21,541 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:11:21,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 49 [2018-02-02 09:11:21,543 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,552 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,564 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 158 treesize of output 158 [2018-02-02 09:11:21,576 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:21,577 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 151 treesize of output 178 [2018-02-02 09:11:21,577 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:21,623 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:21,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 133 treesize of output 159 [2018-02-02 09:11:21,632 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-02-02 09:11:21,665 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:11:21,716 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 70 treesize of output 65 [2018-02-02 09:11:21,718 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:21,718 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 18 treesize of output 27 [2018-02-02 09:11:21,719 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,729 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,773 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 66 treesize of output 61 [2018-02-02 09:11:21,775 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:21,776 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 18 treesize of output 27 [2018-02-02 09:11:21,776 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,797 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:21,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-02-02 09:11:21,840 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:244, output treesize:267 [2018-02-02 09:11:22,179 WARN L143 SmtUtils]: Spent 278ms on a formula simplification that was a NOOP. DAG size: 87 [2018-02-02 09:11:22,186 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:22,187 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:22,187 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 156 treesize of output 150 [2018-02-02 09:11:22,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:11:22,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:291, output treesize:150 [2018-02-02 09:11:22,363 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:22,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-02-02 09:11:22,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:22,382 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:22,383 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:22,383 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 22 treesize of output 25 [2018-02-02 09:11:22,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:11:22,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:161, output treesize:153 [2018-02-02 09:11:22,525 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 139 treesize of output 137 [2018-02-02 09:11:22,527 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 09:11:22,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,559 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 151 [2018-02-02 09:11:22,562 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 09:11:22,562 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,592 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 09:11:22,593 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:183, output treesize:153 [2018-02-02 09:11:22,612 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 149 [2018-02-02 09:11:22,614 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 09:11:22,614 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,628 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,656 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 137 treesize of output 135 [2018-02-02 09:11:22,659 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 09:11:22,659 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,671 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:11:22,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:179, output treesize:153 [2018-02-02 09:11:22,699 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 149 [2018-02-02 09:11:22,701 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 09:11:22,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,736 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 137 treesize of output 135 [2018-02-02 09:11:22,738 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 09:11:22,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,767 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 09:11:22,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:179, output treesize:171 [2018-02-02 09:11:22,844 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 142 treesize of output 123 [2018-02-02 09:11:22,847 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:11:22,847 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 79 treesize of output 59 [2018-02-02 09:11:22,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,861 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 7 treesize of output 1 [2018-02-02 09:11:22,861 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,871 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:22,872 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 27 treesize of output 20 [2018-02-02 09:11:22,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,905 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2018-02-02 09:11:22,907 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 7 treesize of output 1 [2018-02-02 09:11:22,907 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,915 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:22,916 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 23 treesize of output 16 [2018-02-02 09:11:22,916 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,921 INFO L682 Elim1Store]: detected equality via solver [2018-02-02 09:11:22,922 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 28 treesize of output 20 [2018-02-02 09:11:22,922 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,925 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:22,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:11:22,932 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:189, output treesize:22 [2018-02-02 09:11:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 09:11:23,000 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:11:23,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-02-02 09:11:23,001 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-02-02 09:11:23,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-02-02 09:11:23,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1381, Unknown=0, NotChecked=0, Total=1482 [2018-02-02 09:11:23,002 INFO L87 Difference]: Start difference. First operand 335 states and 379 transitions. Second operand 39 states. [2018-02-02 09:11:25,837 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 94 DAG size of output 69 [2018-02-02 09:11:26,104 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 143 DAG size of output 133 [2018-02-02 09:11:27,515 WARN L146 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 135 DAG size of output 85 [2018-02-02 09:11:27,736 WARN L146 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 138 DAG size of output 87 [2018-02-02 09:11:28,346 WARN L146 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 147 DAG size of output 96 [2018-02-02 09:11:28,742 WARN L146 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 160 DAG size of output 101 [2018-02-02 09:11:33,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:11:33,704 INFO L93 Difference]: Finished difference Result 478 states and 581 transitions. [2018-02-02 09:11:33,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-02-02 09:11:33,705 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 47 [2018-02-02 09:11:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:11:33,707 INFO L225 Difference]: With dead ends: 478 [2018-02-02 09:11:33,707 INFO L226 Difference]: Without dead ends: 478 [2018-02-02 09:11:33,708 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 819 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=590, Invalid=3965, Unknown=1, NotChecked=0, Total=4556 [2018-02-02 09:11:33,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-02-02 09:11:33,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 334. [2018-02-02 09:11:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-02-02 09:11:33,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 378 transitions. [2018-02-02 09:11:33,726 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 378 transitions. Word has length 47 [2018-02-02 09:11:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:11:33,726 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 378 transitions. [2018-02-02 09:11:33,727 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-02-02 09:11:33,727 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 378 transitions. [2018-02-02 09:11:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-02-02 09:11:33,729 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:11:33,729 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:33,729 INFO L371 AbstractCegarLoop]: === Iteration 11 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 09:11:33,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1012855197, now seen corresponding path program 1 times [2018-02-02 09:11:33,730 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:11:33,730 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:11:33,730 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:33,730 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:33,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:33,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:11:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 7 proven. 91 refuted. 0 times theorem prover too weak. 1372 trivial. 0 not checked. [2018-02-02 09:11:33,857 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:11:33,857 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 09:11:33,872 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:34,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:34,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:11:34,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1470 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked. [2018-02-02 09:11:34,098 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-02 09:11:34,098 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-02-02 09:11:34,099 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-02-02 09:11:34,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-02-02 09:11:34,099 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-02-02 09:11:34,100 INFO L87 Difference]: Start difference. First operand 334 states and 378 transitions. Second operand 3 states. [2018-02-02 09:11:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 09:11:34,120 INFO L93 Difference]: Finished difference Result 335 states and 379 transitions. [2018-02-02 09:11:34,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-02-02 09:11:34,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2018-02-02 09:11:34,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 09:11:34,122 INFO L225 Difference]: With dead ends: 335 [2018-02-02 09:11:34,122 INFO L226 Difference]: Without dead ends: 335 [2018-02-02 09:11:34,123 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 256 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 09:11:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-02-02 09:11:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-02-02 09:11:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-02-02 09:11:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 379 transitions. [2018-02-02 09:11:34,129 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 379 transitions. Word has length 255 [2018-02-02 09:11:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 09:11:34,129 INFO L432 AbstractCegarLoop]: Abstraction has 335 states and 379 transitions. [2018-02-02 09:11:34,129 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-02-02 09:11:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 379 transitions. [2018-02-02 09:11:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-02-02 09:11:34,134 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 09:11:34,134 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:11:34,134 INFO L371 AbstractCegarLoop]: === Iteration 12 === [containsHeadErr10RequiresViolation, containsHeadErr28RequiresViolation, containsHeadErr33RequiresViolation, containsHeadErr38RequiresViolation, containsHeadErr18RequiresViolation, containsHeadErr5RequiresViolation, containsHeadErr0RequiresViolation, containsHeadErr7RequiresViolation, containsHeadErr2RequiresViolation, containsHeadErr26RequiresViolation, containsHeadErr17RequiresViolation, containsHeadErr40RequiresViolation, containsHeadErr36RequiresViolation, containsHeadErr27RequiresViolation, containsHeadErr13RequiresViolation, containsHeadErr30RequiresViolation, containsHeadErr20RequiresViolation, containsHeadErr23RequiresViolation, containsHeadErr8RequiresViolation, containsHeadErr1RequiresViolation, containsHeadErr14RequiresViolation, containsHeadErr37RequiresViolation, containsHeadErr19RequiresViolation, containsHeadErr11RequiresViolation, containsHeadErr4RequiresViolation, containsHeadErr29RequiresViolation, containsHeadErr32RequiresViolation, containsHeadErr9RequiresViolation, containsHeadErr16RequiresViolation, containsHeadErr39RequiresViolation, containsHeadErr24RequiresViolation, containsHeadErr34RequiresViolation, containsHeadErr3RequiresViolation, containsHeadErr12RequiresViolation, containsHeadErr31RequiresViolation, containsHeadErr35RequiresViolation, containsHeadErr21RequiresViolation, containsHeadErr41RequiresViolation, containsHeadErr22RequiresViolation, containsHeadErr25RequiresViolation, containsHeadErr6RequiresViolation, containsHeadErr15RequiresViolation, containsBodyErr15RequiresViolation, containsBodyErr30RequiresViolation, containsBodyErr1RequiresViolation, containsBodyErr20RequiresViolation, containsBodyErr9RequiresViolation, containsBodyErr10RequiresViolation, containsBodyErr25RequiresViolation, containsBodyErr12RequiresViolation, containsBodyErr35RequiresViolation, containsBodyErr22RequiresViolation, containsBodyErr40RequiresViolation, containsBodyErr3RequiresViolation, containsBodyErr2RequiresViolation, containsBodyErr28RequiresViolation, containsBodyErr6RequiresViolation, containsBodyErr38RequiresViolation, containsBodyErr18RequiresViolation, containsBodyErr21RequiresViolation, containsBodyErr41RequiresViolation, containsBodyErr31RequiresViolation, containsBodyErr29RequiresViolation, containsBodyErr11RequiresViolation, containsBodyErr39RequiresViolation, containsBodyErr24RequiresViolation, containsBodyErr16RequiresViolation, containsBodyErr34RequiresViolation, containsBodyErr0RequiresViolation, containsBodyErr14RequiresViolation, containsBodyErr19RequiresViolation, containsBodyErr5RequiresViolation, containsBodyErr37RequiresViolation, containsBodyErr13RequiresViolation, containsBodyErr32RequiresViolation, containsBodyErr27RequiresViolation, containsBodyErr7RequiresViolation, containsBodyErr36RequiresViolation, containsBodyErr17RequiresViolation, containsBodyErr8RequiresViolation, containsBodyErr4RequiresViolation, containsBodyErr33RequiresViolation, containsBodyErr26RequiresViolation, containsBodyErr23RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr28RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr30EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr8RequiresViolation, appendErr14RequiresViolation, appendErr5RequiresViolation, appendErr17RequiresViolation, appendErr19RequiresViolation, appendErr22RequiresViolation, appendErr12RequiresViolation, appendErr3RequiresViolation, appendErr16RequiresViolation, appendErr2RequiresViolation, appendErr6RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr23RequiresViolation, appendErr4RequiresViolation, appendErr10RequiresViolation, appendErr20RequiresViolation, appendErr11RequiresViolation, appendErr25RequiresViolation, appendErr7RequiresViolation, appendErr24RequiresViolation, appendErr15RequiresViolation, appendErr1RequiresViolation, appendErr21RequiresViolation, appendErr18RequiresViolation]=== [2018-02-02 09:11:34,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1995744797, now seen corresponding path program 1 times [2018-02-02 09:11:34,134 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-02 09:11:34,135 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-02 09:11:34,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:34,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:34,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-02 09:11:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:34,259 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 09:11:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 2 proven. 430 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2018-02-02 09:11:35,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-02 09:11:35,317 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 09:11:35,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-02 09:11:35,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 09:11:35,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-02 09:11:35,593 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 09:11:35,595 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 8 treesize of output 7 [2018-02-02 09:11:35,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:35,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:35,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:35,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-02-02 09:11:35,633 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 21 treesize of output 16 [2018-02-02 09:11:35,634 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:35,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-02-02 09:11:35,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:35,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:35,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:35,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-02-02 09:11:35,683 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 40 [2018-02-02 09:11:35,686 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 31 treesize of output 30 [2018-02-02 09:11:35,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:35,707 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:35,709 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:35,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 53 [2018-02-02 09:11:35,719 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-02-02 09:11:35,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-02-02 09:11:35,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-02-02 09:11:35,777 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:123 [2018-02-02 09:11:35,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 44 treesize of output 37 [2018-02-02 09:11:35,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:35,834 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:35,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:35,835 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:35,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 60 [2018-02-02 09:11:35,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:35,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:35,880 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:35,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 44 treesize of output 45 [2018-02-02 09:11:35,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2018-02-02 09:11:35,883 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:35,888 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-02 09:11:35,922 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 71 [2018-02-02 09:11:35,924 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:35,925 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:35,926 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:35,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 103 [2018-02-02 09:11:35,932 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-02-02 09:11:35,971 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:35,971 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 61 treesize of output 74 [2018-02-02 09:11:35,971 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:35,991 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-02-02 09:11:36,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-02-02 09:11:36,017 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:169, output treesize:190 [2018-02-02 09:11:36,074 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-02-02 09:11:36,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:36,099 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:36,100 INFO L700 Elim1Store]: detected not equals via solver [2018-02-02 09:11:36,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-02-02 09:11:36,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-02-02 09:11:36,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:11:36,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:210, output treesize:65 [2018-02-02 09:11:36,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:11:36,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-02 09:11:36,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-02-02 09:11:36,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-02-02 09:11:36,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1680 backedges. 1028 proven. 25 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2018-02-02 09:11:36,429 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-02 09:11:36,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 40 [2018-02-02 09:11:36,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-02-02 09:11:36,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-02-02 09:11:36,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1397, Unknown=6, NotChecked=0, Total=1560 [2018-02-02 09:11:36,430 INFO L87 Difference]: Start difference. First operand 335 states and 379 transitions. Second operand 40 states. [2018-02-02 09:11:40,870 WARN L146 SmtUtils]: Spent 4147ms on a formula simplification. DAG size of input: 79 DAG size of output 46 [2018-02-02 09:11:49,908 WARN L146 SmtUtils]: Spent 2078ms on a formula simplification. DAG size of input: 68 DAG size of output 45 [2018-02-02 09:11:54,109 WARN L146 SmtUtils]: Spent 2053ms on a formula simplification. DAG size of input: 67 DAG size of output 43 [2018-02-02 09:12:10,865 WARN L146 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 104 DAG size of output 87 Received shutdown request... [2018-02-02 09:12:15,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-02-02 09:12:15,067 WARN L491 AbstractCegarLoop]: Verification canceled [2018-02-02 09:12:15,073 WARN L185 ceAbstractionStarter]: Timeout [2018-02-02 09:12:15,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 09:12:15 BoogieIcfgContainer [2018-02-02 09:12:15,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 09:12:15,075 INFO L168 Benchmark]: Toolchain (without parser) took 66589.41 ms. Allocated memory was 397.9 MB in the beginning and 973.6 MB in the end (delta: 575.7 MB). Free memory was 354.8 MB in the beginning and 461.5 MB in the end (delta: -106.7 MB). Peak memory consumption was 469.0 MB. Max. memory is 5.3 GB. [2018-02-02 09:12:15,075 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 397.9 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 09:12:15,076 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.82 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 342.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. [2018-02-02 09:12:15,076 INFO L168 Benchmark]: Boogie Preprocessor took 38.61 ms. Allocated memory is still 397.9 MB. Free memory was 342.9 MB in the beginning and 340.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 09:12:15,076 INFO L168 Benchmark]: RCFGBuilder took 676.16 ms. Allocated memory is still 397.9 MB. Free memory was 340.3 MB in the beginning and 265.9 MB in the end (delta: 74.3 MB). Peak memory consumption was 74.3 MB. Max. memory is 5.3 GB. [2018-02-02 09:12:15,076 INFO L168 Benchmark]: TraceAbstraction took 65686.86 ms. Allocated memory was 397.9 MB in the beginning and 973.6 MB in the end (delta: 575.7 MB). Free memory was 265.9 MB in the beginning and 461.5 MB in the end (delta: -195.6 MB). Peak memory consumption was 380.1 MB. Max. memory is 5.3 GB. [2018-02-02 09:12:15,077 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.12 ms. Allocated memory is still 397.9 MB. Free memory is still 361.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 184.82 ms. Allocated memory is still 397.9 MB. Free memory was 354.8 MB in the beginning and 342.9 MB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.61 ms. Allocated memory is still 397.9 MB. Free memory was 342.9 MB in the beginning and 340.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 676.16 ms. Allocated memory is still 397.9 MB. Free memory was 340.3 MB in the beginning and 265.9 MB in the end (delta: 74.3 MB). Peak memory consumption was 74.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 65686.86 ms. Allocated memory was 397.9 MB in the beginning and 973.6 MB in the end (delta: 575.7 MB). Free memory was 265.9 MB in the beginning and 461.5 MB in the end (delta: -195.6 MB). Peak memory consumption was 380.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 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 615). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 619). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 628). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 610). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 624). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 609). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 601). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 615). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 625). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 614). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 603). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 601). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 619). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 604). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 624). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 603). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 604). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 610). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (335states) and interpolant automaton (currently 36 states, 40 states before enhancement), while ReachableStatesComputation was computing reachable states (73 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 333 locations, 141 error locations. TIMEOUT Result, 65.6s OverallTime, 12 OverallIterations, 15 TraceHistogramMax, 57.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3296 SDtfs, 3779 SDslu, 11383 SDs, 0 SdLazy, 18924 SolverSat, 1470 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 36.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 866 GetRequests, 595 SyntacticMatches, 12 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3224 ImplicationChecksByTransitivity, 22.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=345occurred in iteration=1, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 457 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1412 NumberOfCodeBlocks, 1412 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1396 ConstructedInterpolants, 55 QuantifiedInterpolants, 1233064 SizeOfPredicates, 55 NumberOfNonLiveVariables, 3262 ConjunctsInSsa, 161 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 5754/6332 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/split_list_test05_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_09-12-15-085.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_09-12-15-085.csv Completed graceful shutdown