java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf -i ../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 12:07:26,975 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 12:07:26,978 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 12:07:26,992 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 12:07:26,992 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 12:07:26,994 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 12:07:26,995 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 12:07:26,996 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 12:07:26,999 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 12:07:27,000 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 12:07:27,001 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 12:07:27,001 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 12:07:27,002 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 12:07:27,003 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 12:07:27,003 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 12:07:27,006 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 12:07:27,008 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 12:07:27,010 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 12:07:27,011 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 12:07:27,012 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 12:07:27,015 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 12:07:27,015 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 12:07:27,015 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 12:07:27,016 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 12:07:27,017 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 12:07:27,019 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 12:07:27,019 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 12:07:27,019 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 12:07:27,020 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 12:07:27,020 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 12:07:27,021 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 12:07:27,021 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf [2018-01-24 12:07:27,031 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 12:07:27,031 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 12:07:27,032 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 12:07:27,032 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 12:07:27,032 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 12:07:27,033 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 12:07:27,033 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 12:07:27,033 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 12:07:27,034 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 12:07:27,034 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 12:07:27,034 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 12:07:27,034 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 12:07:27,034 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 12:07:27,035 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 12:07:27,035 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 12:07:27,035 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 12:07:27,035 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 12:07:27,035 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 12:07:27,036 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 12:07:27,036 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 12:07:27,036 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 12:07:27,036 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 12:07:27,036 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 12:07:27,036 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:07:27,037 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 12:07:27,037 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 12:07:27,037 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 12:07:27,037 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 12:07:27,037 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-24 12:07:27,038 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 12:07:27,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 12:07:27,038 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 12:07:27,039 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 12:07:27,039 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 12:07:27,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 12:07:27,087 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 12:07:27,091 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 12:07:27,093 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 12:07:27,094 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 12:07:27,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/split_list_test05_false-valid-deref.i [2018-01-24 12:07:27,277 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 12:07:27,283 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 12:07:27,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 12:07:27,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 12:07:27,291 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 12:07:27,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:07:27" (1/1) ... [2018-01-24 12:07:27,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e82129b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:07:27, skipping insertion in model container [2018-01-24 12:07:27,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 12:07:27" (1/1) ... [2018-01-24 12:07:27,314 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:07:27,356 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 12:07:27,487 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:07:27,516 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 12:07:27,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:07:27 WrapperNode [2018-01-24 12:07:27,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 12:07:27,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 12:07:27,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 12:07:27,531 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 12:07:27,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:07:27" (1/1) ... [2018-01-24 12:07:27,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:07:27" (1/1) ... [2018-01-24 12:07:27,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:07:27" (1/1) ... [2018-01-24 12:07:27,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:07:27" (1/1) ... [2018-01-24 12:07:27,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:07:27" (1/1) ... [2018-01-24 12:07:27,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:07:27" (1/1) ... [2018-01-24 12:07:27,578 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:07:27" (1/1) ... [2018-01-24 12:07:27,582 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 12:07:27,583 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 12:07:27,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 12:07:27,583 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 12:07:27,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:07:27" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 12:07:27,635 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 12:07:27,635 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 12:07:27,635 INFO L136 BoogieDeclarations]: Found implementation of procedure containsHead [2018-01-24 12:07:27,635 INFO L136 BoogieDeclarations]: Found implementation of procedure containsBody [2018-01-24 12:07:27,635 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 12:07:27,635 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 12:07:27,635 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 12:07:27,635 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 12:07:27,636 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 12:07:27,636 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 12:07:27,636 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 12:07:27,636 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 12:07:27,636 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 12:07:27,636 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 12:07:27,636 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2018-01-24 12:07:27,636 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 12:07:27,636 INFO L128 BoogieDeclarations]: Found specification of procedure containsHead [2018-01-24 12:07:27,636 INFO L128 BoogieDeclarations]: Found specification of procedure containsBody [2018-01-24 12:07:27,637 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 12:07:27,637 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 12:07:27,637 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 12:07:27,637 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 12:07:28,437 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 12:07:28,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:07:28 BoogieIcfgContainer [2018-01-24 12:07:28,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 12:07:28,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 12:07:28,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 12:07:28,442 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 12:07:28,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 12:07:27" (1/3) ... [2018-01-24 12:07:28,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7ae07e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:07:28, skipping insertion in model container [2018-01-24 12:07:28,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 12:07:27" (2/3) ... [2018-01-24 12:07:28,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7ae07e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 12:07:28, skipping insertion in model container [2018-01-24 12:07:28,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 12:07:28" (3/3) ... [2018-01-24 12:07:28,446 INFO L105 eAbstractionObserver]: Analyzing ICFG split_list_test05_false-valid-deref.i [2018-01-24 12:07:28,455 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 12:07:28,464 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 141 error locations. [2018-01-24 12:07:28,516 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 12:07:28,516 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 12:07:28,516 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 12:07:28,516 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 12:07:28,516 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 12:07:28,517 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 12:07:28,517 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 12:07:28,517 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 12:07:28,517 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 12:07:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states. [2018-01-24 12:07:28,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:07:28,543 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:07:28,544 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:07:28,544 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-01-24 12:07:28,547 INFO L82 PathProgramCache]: Analyzing trace with hash 479486545, now seen corresponding path program 1 times [2018-01-24 12:07:28,549 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:07:28,549 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:07:28,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:28,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:28,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:28,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:07:28,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:07:28,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:07:28,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:07:28,769 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:07:28,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:07:28,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:07:28,782 INFO L87 Difference]: Start difference. First operand 332 states. Second operand 4 states. [2018-01-24 12:07:29,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:07:29,441 INFO L93 Difference]: Finished difference Result 707 states and 818 transitions. [2018-01-24 12:07:29,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:07:29,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:07:29,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:07:29,455 INFO L225 Difference]: With dead ends: 707 [2018-01-24 12:07:29,455 INFO L226 Difference]: Without dead ends: 384 [2018-01-24 12:07:29,461 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:07:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-01-24 12:07:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 344. [2018-01-24 12:07:29,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-01-24 12:07:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 388 transitions. [2018-01-24 12:07:29,514 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 388 transitions. Word has length 8 [2018-01-24 12:07:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:07:29,514 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 388 transitions. [2018-01-24 12:07:29,514 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:07:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 388 transitions. [2018-01-24 12:07:29,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 12:07:29,515 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:07:29,515 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:07:29,515 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-01-24 12:07:29,515 INFO L82 PathProgramCache]: Analyzing trace with hash 479486546, now seen corresponding path program 1 times [2018-01-24 12:07:29,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:07:29,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:07:29,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:29,517 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:29,517 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:29,540 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:07:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:07:29,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:07:29,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:07:29,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:07:29,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:07:29,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:07:29,612 INFO L87 Difference]: Start difference. First operand 344 states and 388 transitions. Second operand 4 states. [2018-01-24 12:07:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:07:29,842 INFO L93 Difference]: Finished difference Result 348 states and 394 transitions. [2018-01-24 12:07:29,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:07:29,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 12:07:29,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:07:29,845 INFO L225 Difference]: With dead ends: 348 [2018-01-24 12:07:29,845 INFO L226 Difference]: Without dead ends: 346 [2018-01-24 12:07:29,846 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:07:29,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-01-24 12:07:29,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 342. [2018-01-24 12:07:29,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-01-24 12:07:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 386 transitions. [2018-01-24 12:07:29,873 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 386 transitions. Word has length 8 [2018-01-24 12:07:29,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:07:29,875 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 386 transitions. [2018-01-24 12:07:29,875 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:07:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 386 transitions. [2018-01-24 12:07:29,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:07:29,876 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:07:29,876 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:07:29,876 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-01-24 12:07:29,876 INFO L82 PathProgramCache]: Analyzing trace with hash -2063719306, now seen corresponding path program 1 times [2018-01-24 12:07:29,876 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:07:29,876 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:07:29,877 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:29,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:29,878 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:29,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:07:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:07:29,953 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:07:29,953 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:07:29,953 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:07:29,954 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:07:29,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:07:29,955 INFO L87 Difference]: Start difference. First operand 342 states and 386 transitions. Second operand 4 states. [2018-01-24 12:07:30,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:07:30,312 INFO L93 Difference]: Finished difference Result 342 states and 386 transitions. [2018-01-24 12:07:30,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:07:30,313 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-24 12:07:30,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:07:30,314 INFO L225 Difference]: With dead ends: 342 [2018-01-24 12:07:30,315 INFO L226 Difference]: Without dead ends: 337 [2018-01-24 12:07:30,315 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:07:30,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-01-24 12:07:30,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-01-24 12:07:30,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-01-24 12:07:30,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 381 transitions. [2018-01-24 12:07:30,335 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 381 transitions. Word has length 18 [2018-01-24 12:07:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:07:30,335 INFO L432 AbstractCegarLoop]: Abstraction has 337 states and 381 transitions. [2018-01-24 12:07:30,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:07:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 381 transitions. [2018-01-24 12:07:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 12:07:30,336 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:07:30,336 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:07:30,337 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-01-24 12:07:30,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2063719305, now seen corresponding path program 1 times [2018-01-24 12:07:30,337 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:07:30,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:07:30,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:30,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:30,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:30,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:07:30,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:07:30,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:07:30,436 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 12:07:30,436 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 12:07:30,436 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 12:07:30,436 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 12:07:30,442 INFO L87 Difference]: Start difference. First operand 337 states and 381 transitions. Second operand 4 states. [2018-01-24 12:07:30,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:07:30,636 INFO L93 Difference]: Finished difference Result 337 states and 381 transitions. [2018-01-24 12:07:30,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 12:07:30,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-01-24 12:07:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:07:30,638 INFO L225 Difference]: With dead ends: 337 [2018-01-24 12:07:30,638 INFO L226 Difference]: Without dead ends: 332 [2018-01-24 12:07:30,638 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 12:07:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-01-24 12:07:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2018-01-24 12:07:30,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-01-24 12:07:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 376 transitions. [2018-01-24 12:07:30,653 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 376 transitions. Word has length 18 [2018-01-24 12:07:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:07:30,653 INFO L432 AbstractCegarLoop]: Abstraction has 332 states and 376 transitions. [2018-01-24 12:07:30,653 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 12:07:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 376 transitions. [2018-01-24 12:07:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:07:30,654 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:07:30,654 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:07:30,655 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-01-24 12:07:30,655 INFO L82 PathProgramCache]: Analyzing trace with hash 449211379, now seen corresponding path program 1 times [2018-01-24 12:07:30,655 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:07:30,655 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:07:30,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:30,656 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:30,656 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:30,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:07:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:07:30,781 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:07:30,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 12:07:30,782 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 12:07:30,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 12:07:30,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 12:07:30,783 INFO L87 Difference]: Start difference. First operand 332 states and 376 transitions. Second operand 7 states. [2018-01-24 12:07:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:07:31,824 INFO L93 Difference]: Finished difference Result 368 states and 411 transitions. [2018-01-24 12:07:31,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 12:07:31,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-01-24 12:07:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:07:31,827 INFO L225 Difference]: With dead ends: 368 [2018-01-24 12:07:31,827 INFO L226 Difference]: Without dead ends: 360 [2018-01-24 12:07:31,828 INFO L525 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-01-24 12:07:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-01-24 12:07:31,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 324. [2018-01-24 12:07:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-01-24 12:07:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 368 transitions. [2018-01-24 12:07:31,838 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 368 transitions. Word has length 19 [2018-01-24 12:07:31,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:07:31,838 INFO L432 AbstractCegarLoop]: Abstraction has 324 states and 368 transitions. [2018-01-24 12:07:31,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 12:07:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 368 transitions. [2018-01-24 12:07:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 12:07:31,839 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:07:31,839 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:07:31,839 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-01-24 12:07:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash 449211380, now seen corresponding path program 1 times [2018-01-24 12:07:31,840 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:07:31,840 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:07:31,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:31,841 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:31,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:31,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:31,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:07:32,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:07:32,087 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:07:32,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 12:07:32,088 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 12:07:32,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 12:07:32,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 12:07:32,088 INFO L87 Difference]: Start difference. First operand 324 states and 368 transitions. Second operand 8 states. [2018-01-24 12:07:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:07:32,877 INFO L93 Difference]: Finished difference Result 363 states and 409 transitions. [2018-01-24 12:07:32,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 12:07:32,904 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-01-24 12:07:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:07:32,907 INFO L225 Difference]: With dead ends: 363 [2018-01-24 12:07:32,907 INFO L226 Difference]: Without dead ends: 354 [2018-01-24 12:07:32,908 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-01-24 12:07:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-01-24 12:07:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 315. [2018-01-24 12:07:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-01-24 12:07:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 358 transitions. [2018-01-24 12:07:32,925 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 358 transitions. Word has length 19 [2018-01-24 12:07:32,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:07:32,925 INFO L432 AbstractCegarLoop]: Abstraction has 315 states and 358 transitions. [2018-01-24 12:07:32,926 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 12:07:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 358 transitions. [2018-01-24 12:07:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 12:07:32,927 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:07:32,927 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:07:32,927 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-01-24 12:07:32,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1619802097, now seen corresponding path program 1 times [2018-01-24 12:07:32,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:07:32,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:07:32,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:32,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:32,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:32,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:07:33,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:07:33,183 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:07:33,183 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 12:07:33,184 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 12:07:33,184 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 12:07:33,184 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-24 12:07:33,184 INFO L87 Difference]: Start difference. First operand 315 states and 358 transitions. Second operand 9 states. [2018-01-24 12:07:33,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:07:33,683 INFO L93 Difference]: Finished difference Result 643 states and 734 transitions. [2018-01-24 12:07:33,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 12:07:33,684 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-24 12:07:33,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:07:33,686 INFO L225 Difference]: With dead ends: 643 [2018-01-24 12:07:33,686 INFO L226 Difference]: Without dead ends: 338 [2018-01-24 12:07:33,688 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-01-24 12:07:33,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-01-24 12:07:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 326. [2018-01-24 12:07:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-01-24 12:07:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 371 transitions. [2018-01-24 12:07:33,701 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 371 transitions. Word has length 28 [2018-01-24 12:07:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:07:33,702 INFO L432 AbstractCegarLoop]: Abstraction has 326 states and 371 transitions. [2018-01-24 12:07:33,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 12:07:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 371 transitions. [2018-01-24 12:07:33,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-24 12:07:33,703 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:07:33,703 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:07:33,703 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-01-24 12:07:33,703 INFO L82 PathProgramCache]: Analyzing trace with hash -82034476, now seen corresponding path program 1 times [2018-01-24 12:07:33,703 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:07:33,703 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:07:33,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:33,704 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:33,704 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:33,724 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:07:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:07:34,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 12:07:34,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-01-24 12:07:34,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 12:07:34,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 12:07:34,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-01-24 12:07:34,110 INFO L87 Difference]: Start difference. First operand 326 states and 371 transitions. Second operand 13 states. [2018-01-24 12:07:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:07:35,210 INFO L93 Difference]: Finished difference Result 671 states and 761 transitions. [2018-01-24 12:07:35,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 12:07:35,211 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-01-24 12:07:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:07:35,213 INFO L225 Difference]: With dead ends: 671 [2018-01-24 12:07:35,213 INFO L226 Difference]: Without dead ends: 366 [2018-01-24 12:07:35,215 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2018-01-24 12:07:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-01-24 12:07:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2018-01-24 12:07:35,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-01-24 12:07:35,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 374 transitions. [2018-01-24 12:07:35,231 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 374 transitions. Word has length 30 [2018-01-24 12:07:35,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:07:35,232 INFO L432 AbstractCegarLoop]: Abstraction has 329 states and 374 transitions. [2018-01-24 12:07:35,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 12:07:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 374 transitions. [2018-01-24 12:07:35,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:07:35,234 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:07:35,234 INFO L322 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-01-24 12:07:35,234 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-01-24 12:07:35,234 INFO L82 PathProgramCache]: Analyzing trace with hash -156377040, now seen corresponding path program 1 times [2018-01-24 12:07:35,235 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:07:35,235 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:07:35,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:35,236 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:35,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:35,271 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:07:35,909 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:07:35,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:07:35,909 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:07:35,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:35,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:07:36,336 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-01-24 12:07:36,340 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-01-24 12:07:36,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:36,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:36,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:07:36,353 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-01-24 12:07:36,446 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-01-24 12:07:36,454 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-01-24 12:07:36,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:36,530 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-01-24 12:07:36,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:07:36,552 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:07:36,575 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 2 xjuncts. [2018-01-24 12:07:36,576 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:44, output treesize:77 [2018-01-24 12:07:36,704 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 74 treesize of output 71 [2018-01-24 12:07:36,715 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:36,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 67 treesize of output 82 [2018-01-24 12:07:36,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:36,762 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:36,775 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 53 treesize of output 59 [2018-01-24 12:07:36,776 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:07:36,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:07:36,849 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 41 treesize of output 36 [2018-01-24 12:07:36,852 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:36,852 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-01-24 12:07:36,852 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:36,861 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:36,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-01-24 12:07:36,893 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:116, output treesize:141 [2018-01-24 12:07:37,258 WARN L143 SmtUtils]: Spent 284ms on a formula simplification that was a NOOP. DAG size: 61 [2018-01-24 12:07:37,275 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:37,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:37,278 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 72 treesize of output 66 [2018-01-24 12:07:37,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:37,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:07:37,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:165, output treesize:66 [2018-01-24 12:07:37,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:37,480 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:37,481 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:37,482 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-01-24 12:07:37,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:37,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:07:37,498 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:77, output treesize:85 [2018-01-24 12:07:37,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 75 [2018-01-24 12:07:37,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-24 12:07:37,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:37,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:37,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:07:37,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:100, output treesize:85 [2018-01-24 12:07:37,727 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-01-24 12:07:37,729 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-01-24 12:07:37,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:37,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:37,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:07:37,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:98, output treesize:85 [2018-01-24 12:07:37,808 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-01-24 12:07:37,811 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-01-24 12:07:37,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:37,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:37,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-24 12:07:37,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:94 [2018-01-24 12:07:38,047 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 80 treesize of output 65 [2018-01-24 12:07:38,051 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-01-24 12:07:38,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:38,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:38,065 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-01-24 12:07:38,066 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:38,083 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:07:38,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-01-24 12:07:38,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:38,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:38,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:07:38,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:103, output treesize:28 [2018-01-24 12:07:38,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:07:38,199 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:07:38,199 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2018-01-24 12:07:38,199 INFO L409 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-01-24 12:07:38,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-01-24 12:07:38,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1356, Unknown=0, NotChecked=0, Total=1482 [2018-01-24 12:07:38,201 INFO L87 Difference]: Start difference. First operand 329 states and 374 transitions. Second operand 39 states. [2018-01-24 12:07:42,108 WARN L146 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 72 DAG size of output 45 [2018-01-24 12:07:42,601 WARN L146 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 117 DAG size of output 68 [2018-01-24 12:07:47,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:07:47,304 INFO L93 Difference]: Finished difference Result 479 states and 580 transitions. [2018-01-24 12:07:47,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-24 12:07:47,304 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 47 [2018-01-24 12:07:47,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:07:47,309 INFO L225 Difference]: With dead ends: 479 [2018-01-24 12:07:47,309 INFO L226 Difference]: Without dead ends: 478 [2018-01-24 12:07:47,310 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=556, Invalid=3604, Unknown=0, NotChecked=0, Total=4160 [2018-01-24 12:07:47,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-01-24 12:07:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 334. [2018-01-24 12:07:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-01-24 12:07:47,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 378 transitions. [2018-01-24 12:07:47,334 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 378 transitions. Word has length 47 [2018-01-24 12:07:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:07:47,334 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 378 transitions. [2018-01-24 12:07:47,334 INFO L433 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-01-24 12:07:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 378 transitions. [2018-01-24 12:07:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 12:07:47,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:07:47,335 INFO L322 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-01-24 12:07:47,336 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-01-24 12:07:47,336 INFO L82 PathProgramCache]: Analyzing trace with hash -156377039, now seen corresponding path program 1 times [2018-01-24 12:07:47,336 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:07:47,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:07:47,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:47,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:47,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:47,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:07:47,775 WARN L146 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 17 DAG size of output 16 [2018-01-24 12:07:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:07:48,252 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:07:48,293 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 12:07:48,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:48,329 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:07:48,458 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-01-24 12:07:48,460 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-01-24 12:07:48,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:48,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:48,470 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-01-24 12:07:48,471 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-01-24 12:07:48,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:48,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:48,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:48,478 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-01-24 12:07:48,520 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-01-24 12:07:48,523 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-01-24 12:07:48,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:48,546 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-01-24 12:07:48,546 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:07:48,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:07:48,585 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-01-24 12:07:48,588 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-01-24 12:07:48,589 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:48,612 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-01-24 12:07:48,612 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-24 12:07:48,625 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:07:48,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-01-24 12:07:48,647 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:60, output treesize:203 [2018-01-24 12:07:48,747 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 162 treesize of output 151 [2018-01-24 12:07:48,754 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:48,755 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 155 treesize of output 182 [2018-01-24 12:07:48,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:48,826 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:48,837 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 129 treesize of output 141 [2018-01-24 12:07:48,838 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-01-24 12:07:48,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:07:48,978 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 112 treesize of output 93 [2018-01-24 12:07:48,982 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:48,983 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:48,983 INFO L682 Elim1Store]: detected equality via solver [2018-01-24 12:07:48,985 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 83 treesize of output 54 [2018-01-24 12:07:48,986 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:48,996 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,013 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 152 treesize of output 152 [2018-01-24 12:07:49,017 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:49,018 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 145 treesize of output 172 [2018-01-24 12:07:49,018 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,081 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:49,091 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 139 [2018-01-24 12:07:49,093 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-24 12:07:49,132 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:07:49,191 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 67 treesize of output 62 [2018-01-24 12:07:49,193 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:49,194 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-01-24 12:07:49,194 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,206 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,252 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 63 treesize of output 58 [2018-01-24 12:07:49,255 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:49,255 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-01-24 12:07:49,256 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,266 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:07:49,304 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 4 variables, input treesize:230, output treesize:257 [2018-01-24 12:07:49,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:49,388 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:49,389 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 147 treesize of output 141 [2018-01-24 12:07:49,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,440 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:272, output treesize:141 [2018-01-24 12:07:49,581 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:49,582 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:49,583 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:49,583 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-01-24 12:07:49,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2018-01-24 12:07:49,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:152, output treesize:144 [2018-01-24 12:07:49,741 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-01-24 12:07:49,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-24 12:07:49,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,783 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-01-24 12:07:49,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-01-24 12:07:49,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,817 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:174, output treesize:144 [2018-01-24 12:07:49,833 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-01-24 12:07:49,837 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-01-24 12:07:49,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,901 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-01-24 12:07:49,906 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-01-24 12:07:49,907 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,923 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,944 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:170, output treesize:144 [2018-01-24 12:07:49,957 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-01-24 12:07:49,961 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-01-24 12:07:49,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:49,976 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:50,008 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-01-24 12:07:50,010 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-01-24 12:07:50,011 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:50,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:50,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-24 12:07:50,047 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:170, output treesize:162 [2018-01-24 12:07:50,143 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 142 treesize of output 116 [2018-01-24 12:07:50,150 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 79 treesize of output 52 [2018-01-24 12:07:50,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:50,166 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-01-24 12:07:50,166 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:50,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:50,178 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-01-24 12:07:50,179 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:50,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:50,203 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-01-24 12:07:50,205 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-01-24 12:07:50,205 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:50,218 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:50,218 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-01-24 12:07:50,219 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:50,225 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 28 treesize of output 13 [2018-01-24 12:07:50,226 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:50,243 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:50,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:07:50,250 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:180, output treesize:22 [2018-01-24 12:07:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 12:07:50,322 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:07:50,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2018-01-24 12:07:50,322 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-24 12:07:50,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-24 12:07:50,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1173, Unknown=0, NotChecked=0, Total=1260 [2018-01-24 12:07:50,323 INFO L87 Difference]: Start difference. First operand 334 states and 378 transitions. Second operand 36 states. [2018-01-24 12:07:51,379 WARN L146 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 126 DAG size of output 113 [2018-01-24 12:07:51,874 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 118 DAG size of output 76 [2018-01-24 12:07:52,042 WARN L146 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 120 DAG size of output 78 [2018-01-24 12:07:52,608 WARN L146 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 129 DAG size of output 87 [2018-01-24 12:07:52,837 WARN L146 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 178 DAG size of output 69 [2018-01-24 12:07:53,047 WARN L146 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 142 DAG size of output 92 [2018-01-24 12:07:57,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:07:57,836 INFO L93 Difference]: Finished difference Result 477 states and 578 transitions. [2018-01-24 12:07:57,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-01-24 12:07:57,836 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 47 [2018-01-24 12:07:57,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:07:57,838 INFO L225 Difference]: With dead ends: 477 [2018-01-24 12:07:57,838 INFO L226 Difference]: Without dead ends: 476 [2018-01-24 12:07:57,839 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=550, Invalid=3482, Unknown=0, NotChecked=0, Total=4032 [2018-01-24 12:07:57,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-01-24 12:07:57,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 333. [2018-01-24 12:07:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-01-24 12:07:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 377 transitions. [2018-01-24 12:07:57,863 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 377 transitions. Word has length 47 [2018-01-24 12:07:57,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:07:57,864 INFO L432 AbstractCegarLoop]: Abstraction has 333 states and 377 transitions. [2018-01-24 12:07:57,864 INFO L433 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-01-24 12:07:57,864 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 377 transitions. [2018-01-24 12:07:57,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-01-24 12:07:57,869 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:07:57,870 INFO L322 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 12:07:57,870 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-01-24 12:07:57,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1032388757, now seen corresponding path program 1 times [2018-01-24 12:07:57,870 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:07:57,870 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:07:57,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:57,871 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:57,871 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:57,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:07:58,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 7 proven. 84 refuted. 0 times theorem prover too weak. 1183 trivial. 0 not checked. [2018-01-24 12:07:58,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:07:58,078 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:07:58,083 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:58,237 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:07:58,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1274 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 1003 trivial. 0 not checked. [2018-01-24 12:07:58,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-24 12:07:58,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2018-01-24 12:07:58,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 12:07:58,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 12:07:58,292 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:07:58,292 INFO L87 Difference]: Start difference. First operand 333 states and 377 transitions. Second operand 3 states. [2018-01-24 12:07:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 12:07:58,347 INFO L93 Difference]: Finished difference Result 637 states and 739 transitions. [2018-01-24 12:07:58,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 12:07:58,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 240 [2018-01-24 12:07:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 12:07:58,350 INFO L225 Difference]: With dead ends: 637 [2018-01-24 12:07:58,350 INFO L226 Difference]: Without dead ends: 334 [2018-01-24 12:07:58,352 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 12:07:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-24 12:07:58,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2018-01-24 12:07:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-01-24 12:07:58,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 378 transitions. [2018-01-24 12:07:58,373 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 378 transitions. Word has length 240 [2018-01-24 12:07:58,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 12:07:58,374 INFO L432 AbstractCegarLoop]: Abstraction has 334 states and 378 transitions. [2018-01-24 12:07:58,374 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 12:07:58,374 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 378 transitions. [2018-01-24 12:07:58,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-01-24 12:07:58,378 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 12:07:58,379 INFO L322 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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] [2018-01-24 12:07:58,379 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-01-24 12:07:58,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1145563202, now seen corresponding path program 1 times [2018-01-24 12:07:58,379 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-24 12:07:58,379 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-24 12:07:58,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:58,380 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:58,380 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 12:07:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:58,533 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 12:07:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1456 backedges. 2 proven. 398 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-01-24 12:07:59,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 12:07:59,486 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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-01-24 12:07:59,501 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 12:07:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 12:07:59,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 12:07:59,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 12:07:59,805 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-01-24 12:07:59,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:59,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:59,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:59,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-01-24 12:07:59,836 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-01-24 12:07:59,837 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:59,838 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-01-24 12:07:59,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:59,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:59,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:07:59,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-01-24 12:07:59,882 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-01-24 12:07:59,884 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-01-24 12:07:59,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:07:59,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:59,906 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:07:59,915 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-01-24 12:07:59,916 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-01-24 12:07:59,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:07:59,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-01-24 12:07:59,967 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:123 [2018-01-24 12:08:00,023 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:08:00,024 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-01-24 12:08:00,026 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-01-24 12:08:00,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:08:00,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:08:00,068 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-01-24 12:08:00,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:08:00,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:08:00,072 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:08:00,073 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:08:00,074 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-01-24 12:08:00,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 12:08:00,086 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 12:08:00,138 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 70 treesize of output 69 [2018-01-24 12:08:00,142 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:08:00,142 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 69 treesize of output 84 [2018-01-24 12:08:00,142 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 12:08:00,174 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:08:00,175 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:08:00,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:08:00,190 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 52 treesize of output 91 [2018-01-24 12:08:00,190 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-24 12:08:00,227 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 12:08:00,264 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-01-24 12:08:00,264 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:159, output treesize:178 [2018-01-24 12:08:00,352 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-24 12:08:00,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 12:08:00,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:08:00,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 12:08:00,406 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 15 treesize of output 8 [2018-01-24 12:08:00,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 12:08:00,422 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-01-24 12:08:00,422 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:198, output treesize:65 [2018-01-24 12:08:00,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:08:00,616 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-24 12:08:00,620 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-01-24 12:08:00,620 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-01-24 12:08:00,797 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-01-24 12:08:00,797 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 7 variables, input treesize:85, output treesize:1 [2018-01-24 12:08:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1456 backedges. 992 proven. 25 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2018-01-24 12:08:00,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-24 12:08:00,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 40 [2018-01-24 12:08:00,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-01-24 12:08:00,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-01-24 12:08:00,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1382, Unknown=11, NotChecked=0, Total=1560 [2018-01-24 12:08:00,898 INFO L87 Difference]: Start difference. First operand 334 states and 378 transitions. Second operand 40 states. [2018-01-24 12:08:03,218 WARN L146 SmtUtils]: Spent 2073ms on a formula simplification. DAG size of input: 44 DAG size of output 42 [2018-01-24 12:08:05,417 WARN L146 SmtUtils]: Spent 2117ms on a formula simplification. DAG size of input: 45 DAG size of output 44 [2018-01-24 12:08:09,978 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 88 DAG size of output 77 [2018-01-24 12:08:14,609 WARN L146 SmtUtils]: Spent 4215ms on a formula simplification. DAG size of input: 55 DAG size of output 46 Received shutdown request... [2018-01-24 12:08:18,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-24 12:08:18,821 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-24 12:08:18,830 WARN L187 ceAbstractionStarter]: Timeout [2018-01-24 12:08:18,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 12:08:18 BoogieIcfgContainer [2018-01-24 12:08:18,830 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 12:08:18,831 INFO L168 Benchmark]: Toolchain (without parser) took 51553.78 ms. Allocated memory was 303.6 MB in the beginning and 774.4 MB in the end (delta: 470.8 MB). Free memory was 263.6 MB in the beginning and 456.8 MB in the end (delta: -193.2 MB). Peak memory consumption was 277.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:08:18,833 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 12:08:18,833 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.13 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 250.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:08:18,833 INFO L168 Benchmark]: Boogie Preprocessor took 51.68 ms. Allocated memory is still 303.6 MB. Free memory was 250.6 MB in the beginning and 247.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:08:18,834 INFO L168 Benchmark]: RCFGBuilder took 855.40 ms. Allocated memory was 303.6 MB in the beginning and 326.6 MB in the end (delta: 23.1 MB). Free memory was 247.7 MB in the beginning and 285.1 MB in the end (delta: -37.4 MB). Peak memory consumption was 73.6 MB. Max. memory is 5.3 GB. [2018-01-24 12:08:18,834 INFO L168 Benchmark]: TraceAbstraction took 50391.55 ms. Allocated memory was 326.6 MB in the beginning and 774.4 MB in the end (delta: 447.7 MB). Free memory was 285.1 MB in the beginning and 456.8 MB in the end (delta: -171.7 MB). Peak memory consumption was 276.0 MB. Max. memory is 5.3 GB. [2018-01-24 12:08:18,836 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.21 ms. Allocated memory is still 303.6 MB. Free memory is still 269.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 246.13 ms. Allocated memory is still 303.6 MB. Free memory was 262.6 MB in the beginning and 250.6 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 51.68 ms. Allocated memory is still 303.6 MB. Free memory was 250.6 MB in the beginning and 247.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 855.40 ms. Allocated memory was 303.6 MB in the beginning and 326.6 MB in the end (delta: 23.1 MB). Free memory was 247.7 MB in the beginning and 285.1 MB in the end (delta: -37.4 MB). Peak memory consumption was 73.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50391.55 ms. Allocated memory was 326.6 MB in the beginning and 774.4 MB in the end (delta: 447.7 MB). Free memory was 285.1 MB in the beginning and 456.8 MB in the end (delta: -171.7 MB). Peak memory consumption was 276.0 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 (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 541). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 611). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 617). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 621). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 612). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 616). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 562). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 611). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 617). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 622). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 627). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 616). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 602). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 600). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 621). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 603). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 626). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 602). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 603). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 599). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 612). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 550). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 560). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 559). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (334states) and interpolant automaton (currently 27 states, 40 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 62. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 332 locations, 141 error locations. TIMEOUT Result, 50.3s OverallTime, 12 OverallIterations, 14 TraceHistogramMax, 39.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3283 SDtfs, 3704 SDslu, 11924 SDs, 0 SdLazy, 18756 SolverSat, 1371 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 20.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 829 GetRequests, 565 SyntacticMatches, 17 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2828 ImplicationChecksByTransitivity, 19.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred 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, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 455 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.2s InterpolantComputationTime, 1348 NumberOfCodeBlocks, 1348 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1332 ConstructedInterpolants, 38 QuantifiedInterpolants, 1118174 SizeOfPredicates, 54 NumberOfNonLiveVariables, 3091 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 16 InterpolantComputations, 9 PerfectInterpolantSequences, 4953/5492 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_12-08-18-848.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/split_list_test05_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_12-08-18-848.csv Completed graceful shutdown