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_SS.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:43:03,306 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:43:03,307 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:43:03,321 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:43:03,321 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:43:03,322 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:43:03,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:43:03,325 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:43:03,327 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:43:03,327 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:43:03,328 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:43:03,328 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:43:03,328 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:43:03,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:43:03,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:43:03,333 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:43:03,335 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:43:03,337 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:43:03,338 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:43:03,339 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:43:03,341 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:43:03,342 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:43:03,342 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:43:03,343 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:43:03,344 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:43:03,345 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:43:03,345 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:43:03,346 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:43:03,346 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:43:03,346 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:43:03,347 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:43:03,347 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_SS.epf [2018-01-30 00:43:03,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:43:03,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:43:03,358 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:43:03,358 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:43:03,358 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:43:03,358 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:43:03,359 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:43:03,359 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:43:03,359 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:43:03,360 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:43:03,360 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:43:03,360 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:43:03,360 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:43:03,360 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:43:03,360 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:43:03,361 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:43:03,361 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:43:03,361 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:43:03,361 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:43:03,361 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:43:03,362 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:43:03,362 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:43:03,362 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:43:03,362 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:43:03,362 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:43:03,363 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:43:03,363 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:43:03,363 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:43:03,363 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:43:03,363 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:43:03,364 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:43:03,364 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:43:03,364 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:43:03,365 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:43:03,398 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:43:03,410 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:43:03,413 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:43:03,414 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:43:03,414 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:43:03,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i [2018-01-30 00:43:03,572 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:43:03,579 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:43:03,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:43:03,603 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:43:03,609 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:43:03,610 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:43:03" (1/1) ... [2018-01-30 00:43:03,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6157ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:43:03, skipping insertion in model container [2018-01-30 00:43:03,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:43:03" (1/1) ... [2018-01-30 00:43:03,625 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:43:03,667 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:43:03,793 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:43:03,822 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:43:03,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:43:03 WrapperNode [2018-01-30 00:43:03,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:43:03,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:43:03,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:43:03,832 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:43:03,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:43:03" (1/1) ... [2018-01-30 00:43:03,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:43:03" (1/1) ... [2018-01-30 00:43:03,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:43:03" (1/1) ... [2018-01-30 00:43:03,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:43:03" (1/1) ... [2018-01-30 00:43:03,863 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:43:03" (1/1) ... [2018-01-30 00:43:03,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:43:03" (1/1) ... [2018-01-30 00:43:03,872 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:43:03" (1/1) ... [2018-01-30 00:43:03,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:43:03,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:43:03,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:43:03,876 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:43:03,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:43:03" (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-30 00:43:03,925 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:43:03,925 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:43:03,925 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:43:03,925 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 00:43:03,925 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 00:43:03,925 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:43:03,926 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:43:03,926 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:43:03,926 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:43:03,926 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:43:03,926 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:43:03,926 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 00:43:03,926 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:43:03,927 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:43:03,927 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:43:04,548 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:43:04,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:43:04 BoogieIcfgContainer [2018-01-30 00:43:04,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:43:04,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:43:04,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:43:04,554 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:43:04,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:43:03" (1/3) ... [2018-01-30 00:43:04,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a48a447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:43:04, skipping insertion in model container [2018-01-30 00:43:04,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:43:03" (2/3) ... [2018-01-30 00:43:04,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a48a447 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:43:04, skipping insertion in model container [2018-01-30 00:43:04,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:43:04" (3/3) ... [2018-01-30 00:43:04,557 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-01-30 00:43:04,564 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:43:04,571 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-01-30 00:43:04,612 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:43:04,613 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:43:04,613 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:43:04,613 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:43:04,613 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:43:04,613 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:43:04,613 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:43:04,613 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:43:04,614 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:43:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states. [2018-01-30 00:43:04,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 00:43:04,640 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:04,641 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:04,641 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:04,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1248295384, now seen corresponding path program 1 times [2018-01-30 00:43:04,646 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:04,647 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:04,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:04,687 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:04,687 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:04,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:04,805 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-30 00:43:04,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:04,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:43:04,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:43:04,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:43:04,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:43:04,897 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 4 states. [2018-01-30 00:43:05,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:05,155 INFO L93 Difference]: Finished difference Result 504 states and 633 transitions. [2018-01-30 00:43:05,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:43:05,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-30 00:43:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:05,170 INFO L225 Difference]: With dead ends: 504 [2018-01-30 00:43:05,171 INFO L226 Difference]: Without dead ends: 243 [2018-01-30 00:43:05,176 INFO L553 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-30 00:43:05,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-01-30 00:43:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2018-01-30 00:43:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-30 00:43:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 222 transitions. [2018-01-30 00:43:05,229 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 222 transitions. Word has length 9 [2018-01-30 00:43:05,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:05,230 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 222 transitions. [2018-01-30 00:43:05,230 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:43:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 222 transitions. [2018-01-30 00:43:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-30 00:43:05,231 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:05,231 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:05,231 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:05,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1248295385, now seen corresponding path program 1 times [2018-01-30 00:43:05,231 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:05,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:05,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:05,233 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:05,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:05,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:05,306 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-30 00:43:05,307 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:05,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 00:43:05,308 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 00:43:05,309 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 00:43:05,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 00:43:05,309 INFO L87 Difference]: Start difference. First operand 209 states and 222 transitions. Second operand 4 states. [2018-01-30 00:43:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:05,487 INFO L93 Difference]: Finished difference Result 246 states and 259 transitions. [2018-01-30 00:43:05,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 00:43:05,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-01-30 00:43:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:05,490 INFO L225 Difference]: With dead ends: 246 [2018-01-30 00:43:05,490 INFO L226 Difference]: Without dead ends: 236 [2018-01-30 00:43:05,492 INFO L553 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-30 00:43:05,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-01-30 00:43:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 225. [2018-01-30 00:43:05,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-30 00:43:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 245 transitions. [2018-01-30 00:43:05,508 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 245 transitions. Word has length 9 [2018-01-30 00:43:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:05,508 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 245 transitions. [2018-01-30 00:43:05,508 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 00:43:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 245 transitions. [2018-01-30 00:43:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 00:43:05,509 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:05,509 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:05,510 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:05,510 INFO L82 PathProgramCache]: Analyzing trace with hash 8277577, now seen corresponding path program 1 times [2018-01-30 00:43:05,510 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:05,510 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:05,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:05,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:05,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:05,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:05,595 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-30 00:43:05,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:05,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:43:05,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:43:05,595 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:43:05,595 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:43:05,596 INFO L87 Difference]: Start difference. First operand 225 states and 245 transitions. Second operand 5 states. [2018-01-30 00:43:06,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:06,097 INFO L93 Difference]: Finished difference Result 387 states and 416 transitions. [2018-01-30 00:43:06,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:43:06,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-30 00:43:06,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:06,101 INFO L225 Difference]: With dead ends: 387 [2018-01-30 00:43:06,101 INFO L226 Difference]: Without dead ends: 386 [2018-01-30 00:43:06,102 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:43:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-01-30 00:43:06,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 224. [2018-01-30 00:43:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-01-30 00:43:06,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 244 transitions. [2018-01-30 00:43:06,121 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 244 transitions. Word has length 19 [2018-01-30 00:43:06,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:06,121 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 244 transitions. [2018-01-30 00:43:06,122 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:43:06,122 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 244 transitions. [2018-01-30 00:43:06,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-30 00:43:06,123 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:06,123 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:06,123 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:06,124 INFO L82 PathProgramCache]: Analyzing trace with hash 8277578, now seen corresponding path program 1 times [2018-01-30 00:43:06,124 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:06,124 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:06,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:06,125 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:06,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:06,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:06,207 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-30 00:43:06,208 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:06,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:43:06,208 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:43:06,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:43:06,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:43:06,209 INFO L87 Difference]: Start difference. First operand 224 states and 244 transitions. Second operand 5 states. [2018-01-30 00:43:06,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:06,455 INFO L93 Difference]: Finished difference Result 420 states and 459 transitions. [2018-01-30 00:43:06,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:43:06,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-30 00:43:06,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:06,459 INFO L225 Difference]: With dead ends: 420 [2018-01-30 00:43:06,459 INFO L226 Difference]: Without dead ends: 419 [2018-01-30 00:43:06,459 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:43:06,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-01-30 00:43:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 223. [2018-01-30 00:43:06,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-01-30 00:43:06,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 243 transitions. [2018-01-30 00:43:06,470 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 243 transitions. Word has length 19 [2018-01-30 00:43:06,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:06,470 INFO L432 AbstractCegarLoop]: Abstraction has 223 states and 243 transitions. [2018-01-30 00:43:06,471 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:43:06,471 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 243 transitions. [2018-01-30 00:43:06,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 00:43:06,472 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:06,472 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:06,472 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:06,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1784181423, now seen corresponding path program 1 times [2018-01-30 00:43:06,472 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:06,473 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:06,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:06,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:06,474 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:06,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:06,595 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-30 00:43:06,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:06,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:43:06,595 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:43:06,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:43:06,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:43:06,596 INFO L87 Difference]: Start difference. First operand 223 states and 243 transitions. Second operand 8 states. [2018-01-30 00:43:07,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:07,172 INFO L93 Difference]: Finished difference Result 390 states and 417 transitions. [2018-01-30 00:43:07,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:43:07,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-30 00:43:07,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:07,174 INFO L225 Difference]: With dead ends: 390 [2018-01-30 00:43:07,175 INFO L226 Difference]: Without dead ends: 389 [2018-01-30 00:43:07,175 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:43:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-30 00:43:07,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 222. [2018-01-30 00:43:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-30 00:43:07,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 242 transitions. [2018-01-30 00:43:07,188 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 242 transitions. Word has length 22 [2018-01-30 00:43:07,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:07,189 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 242 transitions. [2018-01-30 00:43:07,189 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:43:07,189 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 242 transitions. [2018-01-30 00:43:07,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-30 00:43:07,190 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:07,190 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:07,190 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:07,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1784181424, now seen corresponding path program 1 times [2018-01-30 00:43:07,191 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:07,191 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:07,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:07,192 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:07,192 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:07,216 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:07,407 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-30 00:43:07,407 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:07,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:43:07,408 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:43:07,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:43:07,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:43:07,408 INFO L87 Difference]: Start difference. First operand 222 states and 242 transitions. Second operand 8 states. [2018-01-30 00:43:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:08,291 INFO L93 Difference]: Finished difference Result 392 states and 419 transitions. [2018-01-30 00:43:08,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:43:08,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-01-30 00:43:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:08,293 INFO L225 Difference]: With dead ends: 392 [2018-01-30 00:43:08,293 INFO L226 Difference]: Without dead ends: 391 [2018-01-30 00:43:08,294 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:43:08,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-01-30 00:43:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 221. [2018-01-30 00:43:08,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-01-30 00:43:08,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 241 transitions. [2018-01-30 00:43:08,301 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 241 transitions. Word has length 22 [2018-01-30 00:43:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:08,301 INFO L432 AbstractCegarLoop]: Abstraction has 221 states and 241 transitions. [2018-01-30 00:43:08,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:43:08,301 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 241 transitions. [2018-01-30 00:43:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-30 00:43:08,302 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:08,302 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:08,302 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:08,302 INFO L82 PathProgramCache]: Analyzing trace with hash -121765648, now seen corresponding path program 1 times [2018-01-30 00:43:08,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:08,303 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:08,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:08,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:08,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:08,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:08,387 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-30 00:43:08,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:08,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:43:08,388 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:43:08,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:43:08,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:43:08,388 INFO L87 Difference]: Start difference. First operand 221 states and 241 transitions. Second operand 5 states. [2018-01-30 00:43:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:08,575 INFO L93 Difference]: Finished difference Result 523 states and 568 transitions. [2018-01-30 00:43:08,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:43:08,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-30 00:43:08,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:08,579 INFO L225 Difference]: With dead ends: 523 [2018-01-30 00:43:08,580 INFO L226 Difference]: Without dead ends: 333 [2018-01-30 00:43:08,625 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:43:08,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-01-30 00:43:08,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 225. [2018-01-30 00:43:08,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-01-30 00:43:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 245 transitions. [2018-01-30 00:43:08,637 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 245 transitions. Word has length 32 [2018-01-30 00:43:08,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:08,638 INFO L432 AbstractCegarLoop]: Abstraction has 225 states and 245 transitions. [2018-01-30 00:43:08,638 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:43:08,638 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 245 transitions. [2018-01-30 00:43:08,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:43:08,639 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:08,639 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:08,639 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:08,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1718606539, now seen corresponding path program 1 times [2018-01-30 00:43:08,640 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:08,640 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:08,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:08,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:08,641 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:08,653 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:08,710 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-30 00:43:08,710 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:08,710 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:43:08,710 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:43:08,710 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:43:08,711 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:43:08,711 INFO L87 Difference]: Start difference. First operand 225 states and 245 transitions. Second operand 5 states. [2018-01-30 00:43:08,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:08,853 INFO L93 Difference]: Finished difference Result 249 states and 264 transitions. [2018-01-30 00:43:08,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 00:43:08,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-01-30 00:43:08,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:08,855 INFO L225 Difference]: With dead ends: 249 [2018-01-30 00:43:08,855 INFO L226 Difference]: Without dead ends: 237 [2018-01-30 00:43:08,855 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:43:08,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-01-30 00:43:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 218. [2018-01-30 00:43:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-30 00:43:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 238 transitions. [2018-01-30 00:43:08,862 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 238 transitions. Word has length 34 [2018-01-30 00:43:08,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:08,863 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 238 transitions. [2018-01-30 00:43:08,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:43:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 238 transitions. [2018-01-30 00:43:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-30 00:43:08,864 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:08,864 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:08,865 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:08,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1718606538, now seen corresponding path program 1 times [2018-01-30 00:43:08,865 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:08,865 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:08,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:08,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:08,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:08,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:08,963 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-30 00:43:08,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:08,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:43:08,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:43:08,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:43:08,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:43:08,964 INFO L87 Difference]: Start difference. First operand 218 states and 238 transitions. Second operand 7 states. [2018-01-30 00:43:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:09,193 INFO L93 Difference]: Finished difference Result 288 states and 305 transitions. [2018-01-30 00:43:09,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:43:09,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-01-30 00:43:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:09,194 INFO L225 Difference]: With dead ends: 288 [2018-01-30 00:43:09,195 INFO L226 Difference]: Without dead ends: 284 [2018-01-30 00:43:09,195 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:43:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-01-30 00:43:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 256. [2018-01-30 00:43:09,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-01-30 00:43:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 287 transitions. [2018-01-30 00:43:09,203 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 287 transitions. Word has length 34 [2018-01-30 00:43:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:09,204 INFO L432 AbstractCegarLoop]: Abstraction has 256 states and 287 transitions. [2018-01-30 00:43:09,204 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:43:09,204 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 287 transitions. [2018-01-30 00:43:09,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:43:09,205 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:09,205 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:09,205 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:09,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1577645049, now seen corresponding path program 1 times [2018-01-30 00:43:09,206 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:09,206 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:09,206 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:09,207 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:09,207 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:09,218 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:09,254 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-30 00:43:09,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:09,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:43:09,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:43:09,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:43:09,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:43:09,256 INFO L87 Difference]: Start difference. First operand 256 states and 287 transitions. Second operand 6 states. [2018-01-30 00:43:09,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:09,581 INFO L93 Difference]: Finished difference Result 376 states and 424 transitions. [2018-01-30 00:43:09,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:43:09,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-30 00:43:09,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:09,584 INFO L225 Difference]: With dead ends: 376 [2018-01-30 00:43:09,584 INFO L226 Difference]: Without dead ends: 375 [2018-01-30 00:43:09,584 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:43:09,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-01-30 00:43:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 255. [2018-01-30 00:43:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-01-30 00:43:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 286 transitions. [2018-01-30 00:43:09,598 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 286 transitions. Word has length 38 [2018-01-30 00:43:09,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:09,598 INFO L432 AbstractCegarLoop]: Abstraction has 255 states and 286 transitions. [2018-01-30 00:43:09,598 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:43:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 286 transitions. [2018-01-30 00:43:09,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-01-30 00:43:09,599 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:09,599 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:09,600 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:09,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1577645050, now seen corresponding path program 1 times [2018-01-30 00:43:09,600 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:09,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:09,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:09,601 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:09,601 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:09,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:09,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:09,720 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-30 00:43:09,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:09,720 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:43:09,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 00:43:09,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 00:43:09,721 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 00:43:09,721 INFO L87 Difference]: Start difference. First operand 255 states and 286 transitions. Second operand 6 states. [2018-01-30 00:43:10,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:10,113 INFO L93 Difference]: Finished difference Result 410 states and 466 transitions. [2018-01-30 00:43:10,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:43:10,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-01-30 00:43:10,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:10,116 INFO L225 Difference]: With dead ends: 410 [2018-01-30 00:43:10,116 INFO L226 Difference]: Without dead ends: 401 [2018-01-30 00:43:10,117 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2018-01-30 00:43:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-01-30 00:43:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 239. [2018-01-30 00:43:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-01-30 00:43:10,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 269 transitions. [2018-01-30 00:43:10,131 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 269 transitions. Word has length 38 [2018-01-30 00:43:10,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:10,131 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 269 transitions. [2018-01-30 00:43:10,132 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 00:43:10,132 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 269 transitions. [2018-01-30 00:43:10,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-30 00:43:10,133 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:10,133 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:10,133 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:10,133 INFO L82 PathProgramCache]: Analyzing trace with hash 2048061063, now seen corresponding path program 1 times [2018-01-30 00:43:10,133 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:10,133 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:10,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:10,135 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:10,135 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:10,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:10,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:10,190 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-30 00:43:10,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:10,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 00:43:10,191 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:43:10,191 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:43:10,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:43:10,192 INFO L87 Difference]: Start difference. First operand 239 states and 269 transitions. Second operand 5 states. [2018-01-30 00:43:10,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:10,582 INFO L93 Difference]: Finished difference Result 329 states and 356 transitions. [2018-01-30 00:43:10,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 00:43:10,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-30 00:43:10,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:10,584 INFO L225 Difference]: With dead ends: 329 [2018-01-30 00:43:10,584 INFO L226 Difference]: Without dead ends: 264 [2018-01-30 00:43:10,584 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:43:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-01-30 00:43:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 239. [2018-01-30 00:43:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-01-30 00:43:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 267 transitions. [2018-01-30 00:43:10,593 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 267 transitions. Word has length 43 [2018-01-30 00:43:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:10,593 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 267 transitions. [2018-01-30 00:43:10,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:43:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 267 transitions. [2018-01-30 00:43:10,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-30 00:43:10,594 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:10,594 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:10,594 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:10,594 INFO L82 PathProgramCache]: Analyzing trace with hash 751723453, now seen corresponding path program 1 times [2018-01-30 00:43:10,595 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:10,595 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:10,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:10,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:10,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:10,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:10,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:10,677 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-30 00:43:10,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:10,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:43:10,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:43:10,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:43:10,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:43:10,678 INFO L87 Difference]: Start difference. First operand 239 states and 267 transitions. Second operand 5 states. [2018-01-30 00:43:11,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:11,370 INFO L93 Difference]: Finished difference Result 389 states and 436 transitions. [2018-01-30 00:43:11,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:43:11,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-01-30 00:43:11,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:11,372 INFO L225 Difference]: With dead ends: 389 [2018-01-30 00:43:11,373 INFO L226 Difference]: Without dead ends: 388 [2018-01-30 00:43:11,373 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:43:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-01-30 00:43:11,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 238. [2018-01-30 00:43:11,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-30 00:43:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 266 transitions. [2018-01-30 00:43:11,386 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 266 transitions. Word has length 51 [2018-01-30 00:43:11,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:11,386 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 266 transitions. [2018-01-30 00:43:11,386 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:43:11,386 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 266 transitions. [2018-01-30 00:43:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-30 00:43:11,387 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:11,387 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:11,388 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:11,388 INFO L82 PathProgramCache]: Analyzing trace with hash 751723454, now seen corresponding path program 1 times [2018-01-30 00:43:11,388 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:11,388 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:11,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:11,389 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:11,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:11,403 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:11,514 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-30 00:43:11,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:11,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 00:43:11,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 00:43:11,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 00:43:11,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 00:43:11,517 INFO L87 Difference]: Start difference. First operand 238 states and 266 transitions. Second operand 5 states. [2018-01-30 00:43:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:11,843 INFO L93 Difference]: Finished difference Result 425 states and 479 transitions. [2018-01-30 00:43:11,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-30 00:43:11,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-01-30 00:43:11,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:11,845 INFO L225 Difference]: With dead ends: 425 [2018-01-30 00:43:11,846 INFO L226 Difference]: Without dead ends: 424 [2018-01-30 00:43:11,846 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:43:11,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-01-30 00:43:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 237. [2018-01-30 00:43:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-01-30 00:43:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 265 transitions. [2018-01-30 00:43:11,862 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 265 transitions. Word has length 51 [2018-01-30 00:43:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:11,862 INFO L432 AbstractCegarLoop]: Abstraction has 237 states and 265 transitions. [2018-01-30 00:43:11,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 00:43:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 265 transitions. [2018-01-30 00:43:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-01-30 00:43:11,863 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:11,864 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:11,864 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:11,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1643901670, now seen corresponding path program 1 times [2018-01-30 00:43:11,864 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:11,864 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:11,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:11,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:11,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:11,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:12,069 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-30 00:43:12,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:12,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-30 00:43:12,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:43:12,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:43:12,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-30 00:43:12,070 INFO L87 Difference]: Start difference. First operand 237 states and 265 transitions. Second operand 10 states. [2018-01-30 00:43:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:12,618 INFO L93 Difference]: Finished difference Result 531 states and 587 transitions. [2018-01-30 00:43:12,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-30 00:43:12,619 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2018-01-30 00:43:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:12,620 INFO L225 Difference]: With dead ends: 531 [2018-01-30 00:43:12,620 INFO L226 Difference]: Without dead ends: 389 [2018-01-30 00:43:12,621 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-01-30 00:43:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-01-30 00:43:12,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 291. [2018-01-30 00:43:12,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-01-30 00:43:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 323 transitions. [2018-01-30 00:43:12,634 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 323 transitions. Word has length 52 [2018-01-30 00:43:12,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:12,635 INFO L432 AbstractCegarLoop]: Abstraction has 291 states and 323 transitions. [2018-01-30 00:43:12,635 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:43:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 323 transitions. [2018-01-30 00:43:12,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 00:43:12,635 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:12,635 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:12,635 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:12,636 INFO L82 PathProgramCache]: Analyzing trace with hash 634057950, now seen corresponding path program 1 times [2018-01-30 00:43:12,636 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:12,636 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:12,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:12,636 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:12,636 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:12,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:12,918 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-30 00:43:12,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:12,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:43:12,919 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:43:12,919 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:43:12,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:43:12,920 INFO L87 Difference]: Start difference. First operand 291 states and 323 transitions. Second operand 8 states. [2018-01-30 00:43:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:13,373 INFO L93 Difference]: Finished difference Result 322 states and 357 transitions. [2018-01-30 00:43:13,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:43:13,374 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-01-30 00:43:13,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:13,375 INFO L225 Difference]: With dead ends: 322 [2018-01-30 00:43:13,375 INFO L226 Difference]: Without dead ends: 321 [2018-01-30 00:43:13,375 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:43:13,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-01-30 00:43:13,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 290. [2018-01-30 00:43:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-01-30 00:43:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 322 transitions. [2018-01-30 00:43:13,394 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 322 transitions. Word has length 54 [2018-01-30 00:43:13,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:13,394 INFO L432 AbstractCegarLoop]: Abstraction has 290 states and 322 transitions. [2018-01-30 00:43:13,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:43:13,394 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 322 transitions. [2018-01-30 00:43:13,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-30 00:43:13,395 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:13,395 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:13,395 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:13,396 INFO L82 PathProgramCache]: Analyzing trace with hash 634057951, now seen corresponding path program 1 times [2018-01-30 00:43:13,396 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:13,396 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:13,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:13,397 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:13,397 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:13,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:13,543 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-30 00:43:13,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:13,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:43:13,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:43:13,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:43:13,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:43:13,544 INFO L87 Difference]: Start difference. First operand 290 states and 322 transitions. Second operand 8 states. [2018-01-30 00:43:13,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:13,875 INFO L93 Difference]: Finished difference Result 321 states and 356 transitions. [2018-01-30 00:43:13,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:43:13,903 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2018-01-30 00:43:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:13,905 INFO L225 Difference]: With dead ends: 321 [2018-01-30 00:43:13,905 INFO L226 Difference]: Without dead ends: 320 [2018-01-30 00:43:13,905 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:43:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-01-30 00:43:13,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 289. [2018-01-30 00:43:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-01-30 00:43:13,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 321 transitions. [2018-01-30 00:43:13,925 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 321 transitions. Word has length 54 [2018-01-30 00:43:13,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:13,925 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 321 transitions. [2018-01-30 00:43:13,925 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:43:13,926 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 321 transitions. [2018-01-30 00:43:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-30 00:43:13,926 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:13,926 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:13,926 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:13,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1433693438, now seen corresponding path program 1 times [2018-01-30 00:43:13,927 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:13,927 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:13,927 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:13,928 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:13,928 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:13,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:43:14,060 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:43:14,060 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-30 00:43:14,068 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:14,114 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:43:14,229 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-30 00:43:14,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:43:14,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:43:14,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-30 00:43:14,281 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,291 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-30 00:43:14,324 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-30 00:43:14,341 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:43:14,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-30 00:43:14,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,369 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,393 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-30 00:43:14,397 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:43:14,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-01-30 00:43:14,399 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,418 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-30 00:43:14,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-30 00:43:14,503 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:43:14,504 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 18 treesize of output 10 [2018-01-30 00:43:14,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-30 00:43:14,526 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:43:14,527 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 18 treesize of output 10 [2018-01-30 00:43:14,528 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,534 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:43:14,541 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-30 00:43:14,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-01-30 00:43:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:43:14,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:43:14,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 11 [2018-01-30 00:43:14,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-30 00:43:14,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-30 00:43:14,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:43:14,603 INFO L87 Difference]: Start difference. First operand 289 states and 321 transitions. Second operand 11 states. [2018-01-30 00:43:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:15,390 INFO L93 Difference]: Finished difference Result 580 states and 628 transitions. [2018-01-30 00:43:15,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-30 00:43:15,391 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2018-01-30 00:43:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:15,393 INFO L225 Difference]: With dead ends: 580 [2018-01-30 00:43:15,393 INFO L226 Difference]: Without dead ends: 467 [2018-01-30 00:43:15,395 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2018-01-30 00:43:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-01-30 00:43:15,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 351. [2018-01-30 00:43:15,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-01-30 00:43:15,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 395 transitions. [2018-01-30 00:43:15,419 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 395 transitions. Word has length 55 [2018-01-30 00:43:15,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:15,419 INFO L432 AbstractCegarLoop]: Abstraction has 351 states and 395 transitions. [2018-01-30 00:43:15,419 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-30 00:43:15,419 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 395 transitions. [2018-01-30 00:43:15,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-30 00:43:15,420 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:15,420 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:15,420 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:15,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1841279106, now seen corresponding path program 1 times [2018-01-30 00:43:15,421 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:15,421 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:15,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:15,422 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:15,422 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:15,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:43:15,862 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:15,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-30 00:43:15,863 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:43:15,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:43:15,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:43:15,863 INFO L87 Difference]: Start difference. First operand 351 states and 395 transitions. Second operand 17 states. [2018-01-30 00:43:17,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:17,370 INFO L93 Difference]: Finished difference Result 741 states and 805 transitions. [2018-01-30 00:43:17,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:43:17,370 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-01-30 00:43:17,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:17,375 INFO L225 Difference]: With dead ends: 741 [2018-01-30 00:43:17,375 INFO L226 Difference]: Without dead ends: 738 [2018-01-30 00:43:17,376 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=423, Invalid=1137, Unknown=0, NotChecked=0, Total=1560 [2018-01-30 00:43:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-01-30 00:43:17,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 359. [2018-01-30 00:43:17,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-01-30 00:43:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 402 transitions. [2018-01-30 00:43:17,394 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 402 transitions. Word has length 57 [2018-01-30 00:43:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:17,394 INFO L432 AbstractCegarLoop]: Abstraction has 359 states and 402 transitions. [2018-01-30 00:43:17,394 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:43:17,394 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 402 transitions. [2018-01-30 00:43:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-30 00:43:17,395 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:17,395 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:17,395 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:17,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1841279107, now seen corresponding path program 1 times [2018-01-30 00:43:17,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:17,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:17,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:17,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:17,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:17,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:17,828 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-30 00:43:17,829 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:17,829 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-30 00:43:17,829 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:43:17,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:43:17,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-01-30 00:43:17,830 INFO L87 Difference]: Start difference. First operand 359 states and 402 transitions. Second operand 17 states. [2018-01-30 00:43:19,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:19,564 INFO L93 Difference]: Finished difference Result 809 states and 867 transitions. [2018-01-30 00:43:19,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 00:43:19,564 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-01-30 00:43:19,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:19,566 INFO L225 Difference]: With dead ends: 809 [2018-01-30 00:43:19,566 INFO L226 Difference]: Without dead ends: 806 [2018-01-30 00:43:19,567 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=459, Invalid=1263, Unknown=0, NotChecked=0, Total=1722 [2018-01-30 00:43:19,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-01-30 00:43:19,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 368. [2018-01-30 00:43:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-01-30 00:43:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 410 transitions. [2018-01-30 00:43:19,594 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 410 transitions. Word has length 57 [2018-01-30 00:43:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:19,595 INFO L432 AbstractCegarLoop]: Abstraction has 368 states and 410 transitions. [2018-01-30 00:43:19,595 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:43:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 410 transitions. [2018-01-30 00:43:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-01-30 00:43:19,596 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:19,596 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:19,596 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:19,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1234984063, now seen corresponding path program 1 times [2018-01-30 00:43:19,597 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:19,597 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:19,597 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:19,598 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:19,598 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:19,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:19,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:19,696 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:43:19,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:19,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:43:19,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:43:19,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:43:19,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:43:19,698 INFO L87 Difference]: Start difference. First operand 368 states and 410 transitions. Second operand 7 states. [2018-01-30 00:43:19,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:19,865 INFO L93 Difference]: Finished difference Result 445 states and 495 transitions. [2018-01-30 00:43:19,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:43:19,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2018-01-30 00:43:19,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:19,867 INFO L225 Difference]: With dead ends: 445 [2018-01-30 00:43:19,867 INFO L226 Difference]: Without dead ends: 387 [2018-01-30 00:43:19,868 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:43:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-01-30 00:43:19,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 382. [2018-01-30 00:43:19,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-01-30 00:43:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 424 transitions. [2018-01-30 00:43:19,893 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 424 transitions. Word has length 64 [2018-01-30 00:43:19,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:19,893 INFO L432 AbstractCegarLoop]: Abstraction has 382 states and 424 transitions. [2018-01-30 00:43:19,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:43:19,893 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 424 transitions. [2018-01-30 00:43:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-01-30 00:43:19,894 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:19,894 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:19,895 INFO L371 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:19,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1538091124, now seen corresponding path program 1 times [2018-01-30 00:43:19,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:19,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:19,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:19,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:19,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:19,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:20,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:43:20,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:43:20,008 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-30 00:43:20,016 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:20,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:43:20,074 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-30 00:43:20,076 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-30 00:43:20,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 00:43:20,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:43:20,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 00:43:20,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-30 00:43:20,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-01-30 00:43:20,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-01-30 00:43:20,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-30 00:43:20,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:43:20,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-01-30 00:43:20,414 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:43:20,416 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 00:43:20,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2018-01-30 00:43:20,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-30 00:43:20,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:43:20,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-30 00:43:20,439 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-01-30 00:43:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:43:20,566 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:43:20,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-01-30 00:43:20,567 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-30 00:43:20,567 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-30 00:43:20,567 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=227, Unknown=2, NotChecked=0, Total=272 [2018-01-30 00:43:20,567 INFO L87 Difference]: Start difference. First operand 382 states and 424 transitions. Second operand 17 states. [2018-01-30 00:43:22,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:22,063 INFO L93 Difference]: Finished difference Result 775 states and 822 transitions. [2018-01-30 00:43:22,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-01-30 00:43:22,065 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2018-01-30 00:43:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:22,067 INFO L225 Difference]: With dead ends: 775 [2018-01-30 00:43:22,067 INFO L226 Difference]: Without dead ends: 736 [2018-01-30 00:43:22,068 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=284, Invalid=1349, Unknown=7, NotChecked=0, Total=1640 [2018-01-30 00:43:22,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2018-01-30 00:43:22,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 415. [2018-01-30 00:43:22,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-01-30 00:43:22,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 464 transitions. [2018-01-30 00:43:22,085 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 464 transitions. Word has length 67 [2018-01-30 00:43:22,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:22,085 INFO L432 AbstractCegarLoop]: Abstraction has 415 states and 464 transitions. [2018-01-30 00:43:22,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-30 00:43:22,085 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 464 transitions. [2018-01-30 00:43:22,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-01-30 00:43:22,086 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:22,086 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:22,086 INFO L371 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:22,086 INFO L82 PathProgramCache]: Analyzing trace with hash 436185985, now seen corresponding path program 1 times [2018-01-30 00:43:22,086 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:22,086 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:22,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:22,087 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:22,087 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:22,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:43:22,237 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 00:43:22,237 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-30 00:43:22,253 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:22,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 00:43:22,460 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~list~5.base Int)) (and (= 0 (select |c_old(#valid)| main_~list~5.base)) (= |c_#valid| (store |c_old(#valid)| main_~list~5.base 0)) (not (= 0 main_~list~5.base)))) is different from true [2018-01-30 00:43:22,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2018-01-30 00:43:22,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-30 00:43:22,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2018-01-30 00:43:22,496 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 00:43:22,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 00:43:22,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2018-01-30 00:43:22,497 INFO L87 Difference]: Start difference. First operand 415 states and 464 transitions. Second operand 10 states. [2018-01-30 00:43:22,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:22,797 INFO L93 Difference]: Finished difference Result 466 states and 515 transitions. [2018-01-30 00:43:22,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 00:43:22,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2018-01-30 00:43:22,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:22,799 INFO L225 Difference]: With dead ends: 466 [2018-01-30 00:43:22,799 INFO L226 Difference]: Without dead ends: 428 [2018-01-30 00:43:22,800 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=134, Unknown=1, NotChecked=24, Total=210 [2018-01-30 00:43:22,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-01-30 00:43:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2018-01-30 00:43:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-01-30 00:43:22,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 475 transitions. [2018-01-30 00:43:22,828 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 475 transitions. Word has length 68 [2018-01-30 00:43:22,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:22,828 INFO L432 AbstractCegarLoop]: Abstraction has 426 states and 475 transitions. [2018-01-30 00:43:22,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 00:43:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 475 transitions. [2018-01-30 00:43:22,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:43:22,830 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:22,830 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:22,830 INFO L371 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:22,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1422515225, now seen corresponding path program 1 times [2018-01-30 00:43:22,830 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:22,830 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:22,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:22,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:22,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:22,845 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:43:23,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:23,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-30 00:43:23,201 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 00:43:23,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 00:43:23,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:43:23,201 INFO L87 Difference]: Start difference. First operand 426 states and 475 transitions. Second operand 16 states. [2018-01-30 00:43:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:24,268 INFO L93 Difference]: Finished difference Result 714 states and 780 transitions. [2018-01-30 00:43:24,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-01-30 00:43:24,270 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2018-01-30 00:43:24,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:24,272 INFO L225 Difference]: With dead ends: 714 [2018-01-30 00:43:24,273 INFO L226 Difference]: Without dead ends: 713 [2018-01-30 00:43:24,273 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=405, Invalid=1235, Unknown=0, NotChecked=0, Total=1640 [2018-01-30 00:43:24,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2018-01-30 00:43:24,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 437. [2018-01-30 00:43:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-01-30 00:43:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 488 transitions. [2018-01-30 00:43:24,302 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 488 transitions. Word has length 69 [2018-01-30 00:43:24,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:24,302 INFO L432 AbstractCegarLoop]: Abstraction has 437 states and 488 transitions. [2018-01-30 00:43:24,302 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 00:43:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 488 transitions. [2018-01-30 00:43:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-01-30 00:43:24,304 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:24,304 INFO L350 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:24,304 INFO L371 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1422515224, now seen corresponding path program 1 times [2018-01-30 00:43:24,304 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:24,304 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:24,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:24,305 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:24,305 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:43:24,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:43:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-30 00:43:24,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:43:24,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-30 00:43:24,659 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-30 00:43:24,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-30 00:43:24,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-01-30 00:43:24,660 INFO L87 Difference]: Start difference. First operand 437 states and 488 transitions. Second operand 16 states. [2018-01-30 00:43:25,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:43:25,548 INFO L93 Difference]: Finished difference Result 706 states and 772 transitions. [2018-01-30 00:43:25,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-30 00:43:25,548 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 69 [2018-01-30 00:43:25,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:43:25,551 INFO L225 Difference]: With dead ends: 706 [2018-01-30 00:43:25,552 INFO L226 Difference]: Without dead ends: 703 [2018-01-30 00:43:25,553 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=364, Invalid=1118, Unknown=0, NotChecked=0, Total=1482 [2018-01-30 00:43:25,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2018-01-30 00:43:25,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 446. [2018-01-30 00:43:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-01-30 00:43:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 496 transitions. [2018-01-30 00:43:25,581 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 496 transitions. Word has length 69 [2018-01-30 00:43:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:43:25,582 INFO L432 AbstractCegarLoop]: Abstraction has 446 states and 496 transitions. [2018-01-30 00:43:25,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-30 00:43:25,582 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 496 transitions. [2018-01-30 00:43:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-01-30 00:43:25,583 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:43:25,583 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:43:25,583 INFO L371 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr64EnsuresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-30 00:43:25,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1375108426, now seen corresponding path program 1 times [2018-01-30 00:43:25,584 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:43:25,584 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:43:25,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:25,585 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:43:25,585 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:43:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:43:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-30 00:43:25,644 INFO L409 BasicCegarLoop]: Counterexample might be feasible [2018-01-30 00:43:25,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:43:25 BoogieIcfgContainer [2018-01-30 00:43:25,706 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:43:25,707 INFO L168 Benchmark]: Toolchain (without parser) took 22134.76 ms. Allocated memory was 300.4 MB in the beginning and 831.5 MB in the end (delta: 531.1 MB). Free memory was 260.4 MB in the beginning and 684.2 MB in the end (delta: -423.7 MB). Peak memory consumption was 107.4 MB. Max. memory is 5.3 GB. [2018-01-30 00:43:25,708 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 300.4 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:43:25,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.10 ms. Allocated memory is still 300.4 MB. Free memory was 259.5 MB in the beginning and 247.2 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 5.3 GB. [2018-01-30 00:43:25,709 INFO L168 Benchmark]: Boogie Preprocessor took 44.06 ms. Allocated memory is still 300.4 MB. Free memory was 247.2 MB in the beginning and 245.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:43:25,709 INFO L168 Benchmark]: RCFGBuilder took 674.11 ms. Allocated memory is still 300.4 MB. Free memory was 245.1 MB in the beginning and 194.8 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 5.3 GB. [2018-01-30 00:43:25,710 INFO L168 Benchmark]: TraceAbstraction took 21155.08 ms. Allocated memory was 300.4 MB in the beginning and 831.5 MB in the end (delta: 531.1 MB). Free memory was 194.8 MB in the beginning and 684.2 MB in the end (delta: -489.4 MB). Peak memory consumption was 41.7 MB. Max. memory is 5.3 GB. [2018-01-30 00:43:25,712 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 300.4 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.10 ms. Allocated memory is still 300.4 MB. Free memory was 259.5 MB in the beginning and 247.2 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.06 ms. Allocated memory is still 300.4 MB. Free memory was 247.2 MB in the beginning and 245.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 674.11 ms. Allocated memory is still 300.4 MB. Free memory was 245.1 MB in the beginning and 194.8 MB in the end (delta: 50.4 MB). Peak memory consumption was 50.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 21155.08 ms. Allocated memory was 300.4 MB in the beginning and 831.5 MB in the end (delta: 531.1 MB). Free memory was 194.8 MB in the beginning and 684.2 MB in the end (delta: -489.4 MB). Peak memory consumption was 41.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L991] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={10:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L992] FCALL list->next = ((void*)0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, list={10:0}, malloc(sizeof(SLL))={10:0}] [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner = malloc(sizeof(SLL)) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->next = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->inner = ((void*)0) VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={10:0}, list->inner={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={10:0}, list->inner={11:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) VAL [list={10:0}, list->inner={11:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(0) VAL [list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L995] SLL* end = list; VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1008] end = ((void*)0) VAL [end={0:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1009] end = list VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(0) VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1014] COND TRUE ((void*)0) != end VAL [end={10:0}, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1016] int len = 0; VAL [end={10:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] EXPR, FCALL end->inner VAL [end={10:0}, end->inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1017] SLL* inner = end->inner; VAL [end={10:0}, end->inner={11:0}, inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1018] COND TRUE ((void*)0) != inner VAL [end={10:0}, inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1020] COND TRUE len == 0 VAL [end={10:0}, inner={11:0}, len=0, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1021] len = 1 VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(0) VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1025] EXPR, FCALL inner->inner VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1025] COND FALSE !(0) VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1026] EXPR, FCALL inner->next VAL [end={10:0}, inner={11:0}, inner->next={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) VAL [end={10:0}, inner={11:0}, inner->next={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1026] COND FALSE !(0) VAL [end={10:0}, inner={11:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1027] EXPR, FCALL inner->inner VAL [end={10:0}, inner={11:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1027] inner = inner->inner VAL [end={10:0}, inner={0:0}, inner->inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1028] COND TRUE len == 1 VAL [end={10:0}, inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] [L1029] FCALL inner->inner VAL [end={10:0}, inner={0:0}, len=1, list={10:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 239 locations, 65 error locations. UNSAFE Result, 21.0s OverallTime, 26 OverallIterations, 2 TraceHistogramMax, 14.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4997 SDtfs, 15528 SDslu, 20380 SDs, 0 SdLazy, 10979 SolverSat, 714 SolverUnsat, 38 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 604 GetRequests, 217 SyntacticMatches, 12 SemanticMatches, 375 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1673 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 3493 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1347 NumberOfCodeBlocks, 1347 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1249 ConstructedInterpolants, 16 QuantifiedInterpolants, 718729 SizeOfPredicates, 30 NumberOfNonLiveVariables, 537 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 28 InterpolantComputations, 22 PerfectInterpolantSequences, 16/32 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-43-25-720.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-01_false-unreach-call_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-43-25-720.csv Received shutdown request...