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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-01_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:47:37,624 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:47:37,626 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:47:37,639 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:47:37,639 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:47:37,640 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:47:37,641 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:47:37,643 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:47:37,644 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:47:37,645 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:47:37,645 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:47:37,646 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:47:37,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:47:37,647 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:47:37,648 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:47:37,650 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:47:37,653 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:47:37,654 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:47:37,656 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:47:37,657 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:47:37,659 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:47:37,660 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:47:37,660 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:47:37,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:47:37,662 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:47:37,663 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:47:37,663 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:47:37,664 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:47:37,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:47:37,664 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:47:37,665 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:47:37,665 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:47:37,675 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:47:37,675 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:47:37,676 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:47:37,676 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:47:37,677 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:47:37,677 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:47:37,677 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:47:37,678 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:47:37,678 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:47:37,678 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:47:37,678 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:47:37,678 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:47:37,679 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:47:37,679 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:47:37,679 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:47:37,679 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:47:37,679 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:47:37,679 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:47:37,680 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:47:37,680 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:47:37,680 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:47:37,680 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:47:37,680 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:47:37,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:47:37,681 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:47:37,681 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:47:37,681 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:47:37,681 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:47:37,682 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:47:37,682 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:47:37,682 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:47:37,682 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:47:37,683 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:47:37,683 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:47:37,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:47:37,730 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:47:37,734 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:47:37,736 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:47:37,736 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:47:37,737 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-24 13:47:37,928 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:47:37,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:47:37,934 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:47:37,934 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:47:37,941 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:47:37,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:47:37" (1/1) ... [2018-01-24 13:47:37,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321f72c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:47:37, skipping insertion in model container [2018-01-24 13:47:37,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:47:37" (1/1) ... [2018-01-24 13:47:37,956 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:47:37,998 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:47:38,122 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:47:38,150 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:47:38,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:47:38 WrapperNode [2018-01-24 13:47:38,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:47:38,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:47:38,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:47:38,159 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:47:38,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:47:38" (1/1) ... [2018-01-24 13:47:38,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:47:38" (1/1) ... [2018-01-24 13:47:38,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:47:38" (1/1) ... [2018-01-24 13:47:38,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:47:38" (1/1) ... [2018-01-24 13:47:38,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:47:38" (1/1) ... [2018-01-24 13:47:38,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:47:38" (1/1) ... [2018-01-24 13:47:38,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:47:38" (1/1) ... [2018-01-24 13:47:38,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:47:38,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:47:38,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:47:38,197 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:47:38,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:47:38" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:47:38,241 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:47:38,242 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:47:38,242 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:47:38,242 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 13:47:38,242 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 13:47:38,242 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:47:38,242 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:47:38,242 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:47:38,243 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:47:38,243 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:47:38,243 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:47:38,243 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-24 13:47:38,243 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:47:38,243 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:47:38,244 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:47:38,792 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:47:38,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:47:38 BoogieIcfgContainer [2018-01-24 13:47:38,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:47:38,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:47:38,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:47:38,827 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:47:38,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:47:37" (1/3) ... [2018-01-24 13:47:38,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18828e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:47:38, skipping insertion in model container [2018-01-24 13:47:38,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:47:38" (2/3) ... [2018-01-24 13:47:38,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18828e80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:47:38, skipping insertion in model container [2018-01-24 13:47:38,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:47:38" (3/3) ... [2018-01-24 13:47:38,831 INFO L105 eAbstractionObserver]: Analyzing ICFG sll-01_false-unreach-call_false-valid-deref.i [2018-01-24 13:47:38,838 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:47:38,845 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-01-24 13:47:38,887 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:47:38,888 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:47:38,888 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:47:38,888 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:47:38,888 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:47:38,888 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:47:38,888 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:47:38,888 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:47:38,889 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:47:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states. [2018-01-24 13:47:38,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 13:47:38,916 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:38,917 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:38,917 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-24 13:47:38,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2039196070, now seen corresponding path program 1 times [2018-01-24 13:47:38,923 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:38,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:38,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:38,964 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:38,964 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:39,004 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:39,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:39,066 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:39,067 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:47:39,067 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:39,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:47:39,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:47:39,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:47:39,088 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 4 states. [2018-01-24 13:47:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:39,407 INFO L93 Difference]: Finished difference Result 394 states and 523 transitions. [2018-01-24 13:47:39,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:47:39,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 13:47:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:39,421 INFO L225 Difference]: With dead ends: 394 [2018-01-24 13:47:39,421 INFO L226 Difference]: Without dead ends: 211 [2018-01-24 13:47:39,425 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:47:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-01-24 13:47:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 181. [2018-01-24 13:47:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-24 13:47:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 194 transitions. [2018-01-24 13:47:39,468 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 194 transitions. Word has length 8 [2018-01-24 13:47:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:39,468 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 194 transitions. [2018-01-24 13:47:39,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:47:39,468 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 194 transitions. [2018-01-24 13:47:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-01-24 13:47:39,469 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:39,469 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:39,469 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-24 13:47:39,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2039196071, now seen corresponding path program 1 times [2018-01-24 13:47:39,469 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:39,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:39,470 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:39,470 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:39,471 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:39,488 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:39,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:39,567 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:39,567 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:47:39,567 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:39,569 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:47:39,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:47:39,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:47:39,570 INFO L87 Difference]: Start difference. First operand 181 states and 194 transitions. Second operand 4 states. [2018-01-24 13:47:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:39,977 INFO L93 Difference]: Finished difference Result 214 states and 227 transitions. [2018-01-24 13:47:39,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:47:39,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-01-24 13:47:39,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:39,979 INFO L225 Difference]: With dead ends: 214 [2018-01-24 13:47:39,979 INFO L226 Difference]: Without dead ends: 204 [2018-01-24 13:47:39,980 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:47:39,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-01-24 13:47:39,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 193. [2018-01-24 13:47:39,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-24 13:47:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-01-24 13:47:39,994 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 8 [2018-01-24 13:47:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:39,994 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-01-24 13:47:39,995 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:47:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-01-24 13:47:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:47:39,995 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:39,996 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:39,996 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-24 13:47:39,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1799051431, now seen corresponding path program 1 times [2018-01-24 13:47:39,996 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:39,997 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:39,997 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:39,998 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:39,998 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:40,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:40,058 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:40,058 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:47:40,058 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:40,059 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:47:40,059 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:47:40,059 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:47:40,059 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 5 states. [2018-01-24 13:47:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:40,417 INFO L93 Difference]: Finished difference Result 330 states and 359 transitions. [2018-01-24 13:47:40,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:47:40,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 13:47:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:40,420 INFO L225 Difference]: With dead ends: 330 [2018-01-24 13:47:40,420 INFO L226 Difference]: Without dead ends: 329 [2018-01-24 13:47:40,421 INFO L525 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-24 13:47:40,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-01-24 13:47:40,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 192. [2018-01-24 13:47:40,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-24 13:47:40,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 212 transitions. [2018-01-24 13:47:40,438 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 212 transitions. Word has length 17 [2018-01-24 13:47:40,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:40,439 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 212 transitions. [2018-01-24 13:47:40,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:47:40,439 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 212 transitions. [2018-01-24 13:47:40,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-24 13:47:40,440 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:40,440 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:40,440 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-24 13:47:40,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1799051430, now seen corresponding path program 1 times [2018-01-24 13:47:40,441 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:40,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:40,442 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:40,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:40,443 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:40,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:40,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:40,556 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:47:40,556 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:40,556 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:47:40,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:47:40,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:47:40,557 INFO L87 Difference]: Start difference. First operand 192 states and 212 transitions. Second operand 5 states. [2018-01-24 13:47:40,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:40,828 INFO L93 Difference]: Finished difference Result 359 states and 398 transitions. [2018-01-24 13:47:40,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:47:40,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-24 13:47:40,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:40,830 INFO L225 Difference]: With dead ends: 359 [2018-01-24 13:47:40,830 INFO L226 Difference]: Without dead ends: 358 [2018-01-24 13:47:40,831 INFO L525 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-24 13:47:40,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-01-24 13:47:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 191. [2018-01-24 13:47:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-01-24 13:47:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2018-01-24 13:47:40,844 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 17 [2018-01-24 13:47:40,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:40,844 INFO L432 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2018-01-24 13:47:40,844 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:47:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2018-01-24 13:47:40,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:47:40,845 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:40,845 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:40,845 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-24 13:47:40,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1355722779, now seen corresponding path program 1 times [2018-01-24 13:47:40,846 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:40,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:40,846 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:40,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:40,847 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:40,866 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:40,967 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:40,968 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:47:40,968 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:40,968 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:47:40,968 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:47:40,968 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:47:40,969 INFO L87 Difference]: Start difference. First operand 191 states and 211 transitions. Second operand 8 states. [2018-01-24 13:47:41,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:41,602 INFO L93 Difference]: Finished difference Result 333 states and 360 transitions. [2018-01-24 13:47:41,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:47:41,602 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 13:47:41,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:41,604 INFO L225 Difference]: With dead ends: 333 [2018-01-24 13:47:41,604 INFO L226 Difference]: Without dead ends: 332 [2018-01-24 13:47:41,605 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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-24 13:47:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-01-24 13:47:41,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 190. [2018-01-24 13:47:41,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-01-24 13:47:41,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 210 transitions. [2018-01-24 13:47:41,616 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 210 transitions. Word has length 20 [2018-01-24 13:47:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:41,617 INFO L432 AbstractCegarLoop]: Abstraction has 190 states and 210 transitions. [2018-01-24 13:47:41,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:47:41,617 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 210 transitions. [2018-01-24 13:47:41,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:47:41,618 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:41,618 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:41,619 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-24 13:47:41,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1355722780, now seen corresponding path program 1 times [2018-01-24 13:47:41,619 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:41,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:41,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:41,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:41,620 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:41,636 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:41,760 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:41,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:47:41,761 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:41,761 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:47:41,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:47:41,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:47:41,761 INFO L87 Difference]: Start difference. First operand 190 states and 210 transitions. Second operand 8 states. [2018-01-24 13:47:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:42,291 INFO L93 Difference]: Finished difference Result 335 states and 362 transitions. [2018-01-24 13:47:42,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:47:42,292 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 13:47:42,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:42,294 INFO L225 Difference]: With dead ends: 335 [2018-01-24 13:47:42,294 INFO L226 Difference]: Without dead ends: 334 [2018-01-24 13:47:42,294 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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-24 13:47:42,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-24 13:47:42,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 189. [2018-01-24 13:47:42,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-01-24 13:47:42,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 209 transitions. [2018-01-24 13:47:42,308 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 209 transitions. Word has length 20 [2018-01-24 13:47:42,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:42,308 INFO L432 AbstractCegarLoop]: Abstraction has 189 states and 209 transitions. [2018-01-24 13:47:42,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:47:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 209 transitions. [2018-01-24 13:47:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 13:47:42,309 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:42,309 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:42,310 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-24 13:47:42,310 INFO L82 PathProgramCache]: Analyzing trace with hash -778525244, now seen corresponding path program 1 times [2018-01-24 13:47:42,310 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:42,311 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:42,312 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:42,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:42,312 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:42,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:42,370 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:42,370 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:47:42,370 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:42,370 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:47:42,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:47:42,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:47:42,371 INFO L87 Difference]: Start difference. First operand 189 states and 209 transitions. Second operand 5 states. [2018-01-24 13:47:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:42,487 INFO L93 Difference]: Finished difference Result 443 states and 488 transitions. [2018-01-24 13:47:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:47:42,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-01-24 13:47:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:42,490 INFO L225 Difference]: With dead ends: 443 [2018-01-24 13:47:42,490 INFO L226 Difference]: Without dead ends: 282 [2018-01-24 13:47:42,491 INFO L525 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-24 13:47:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-01-24 13:47:42,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 193. [2018-01-24 13:47:42,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-24 13:47:42,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 213 transitions. [2018-01-24 13:47:42,502 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 213 transitions. Word has length 26 [2018-01-24 13:47:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:42,503 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 213 transitions. [2018-01-24 13:47:42,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:47:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 213 transitions. [2018-01-24 13:47:42,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:47:42,504 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:42,504 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:42,504 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-24 13:47:42,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1814157193, now seen corresponding path program 1 times [2018-01-24 13:47:42,505 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:42,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:42,506 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:42,506 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:42,506 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:42,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:42,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:42,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:42,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:47:42,627 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:42,627 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:47:42,627 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:47:42,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:47:42,628 INFO L87 Difference]: Start difference. First operand 193 states and 213 transitions. Second operand 5 states. [2018-01-24 13:47:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:42,773 INFO L93 Difference]: Finished difference Result 215 states and 230 transitions. [2018-01-24 13:47:42,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:47:42,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 13:47:42,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:42,775 INFO L225 Difference]: With dead ends: 215 [2018-01-24 13:47:42,775 INFO L226 Difference]: Without dead ends: 203 [2018-01-24 13:47:42,775 INFO L525 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-24 13:47:42,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-01-24 13:47:42,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 185. [2018-01-24 13:47:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-01-24 13:47:42,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 205 transitions. [2018-01-24 13:47:42,783 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 205 transitions. Word has length 28 [2018-01-24 13:47:42,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:42,784 INFO L432 AbstractCegarLoop]: Abstraction has 185 states and 205 transitions. [2018-01-24 13:47:42,784 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:47:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 205 transitions. [2018-01-24 13:47:42,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:47:42,785 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:42,785 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:42,785 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-24 13:47:42,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1814157194, now seen corresponding path program 1 times [2018-01-24 13:47:42,785 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:42,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:42,786 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:42,786 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:42,786 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:42,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:42,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:42,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:47:42,904 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:42,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:47:42,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:47:42,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:47:42,905 INFO L87 Difference]: Start difference. First operand 185 states and 205 transitions. Second operand 7 states. [2018-01-24 13:47:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:43,156 INFO L93 Difference]: Finished difference Result 246 states and 263 transitions. [2018-01-24 13:47:43,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:47:43,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2018-01-24 13:47:43,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:43,157 INFO L225 Difference]: With dead ends: 246 [2018-01-24 13:47:43,157 INFO L226 Difference]: Without dead ends: 242 [2018-01-24 13:47:43,157 INFO L525 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-24 13:47:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-01-24 13:47:43,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 215. [2018-01-24 13:47:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-01-24 13:47:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 246 transitions. [2018-01-24 13:47:43,169 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 246 transitions. Word has length 28 [2018-01-24 13:47:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:43,169 INFO L432 AbstractCegarLoop]: Abstraction has 215 states and 246 transitions. [2018-01-24 13:47:43,169 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:47:43,170 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 246 transitions. [2018-01-24 13:47:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 13:47:43,170 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:43,171 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:43,171 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-24 13:47:43,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1983523681, now seen corresponding path program 1 times [2018-01-24 13:47:43,171 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:43,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:43,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:43,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:43,173 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:43,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:43,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:43,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:47:43,235 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:43,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:47:43,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:47:43,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:47:43,236 INFO L87 Difference]: Start difference. First operand 215 states and 246 transitions. Second operand 6 states. [2018-01-24 13:47:43,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:43,503 INFO L93 Difference]: Finished difference Result 312 states and 360 transitions. [2018-01-24 13:47:43,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:47:43,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 13:47:43,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:43,505 INFO L225 Difference]: With dead ends: 312 [2018-01-24 13:47:43,505 INFO L226 Difference]: Without dead ends: 311 [2018-01-24 13:47:43,505 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-24 13:47:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-01-24 13:47:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 214. [2018-01-24 13:47:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-01-24 13:47:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 245 transitions. [2018-01-24 13:47:43,516 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 245 transitions. Word has length 31 [2018-01-24 13:47:43,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:43,516 INFO L432 AbstractCegarLoop]: Abstraction has 214 states and 245 transitions. [2018-01-24 13:47:43,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:47:43,516 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 245 transitions. [2018-01-24 13:47:43,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-24 13:47:43,517 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:43,518 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:43,518 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-24 13:47:43,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1983523682, now seen corresponding path program 1 times [2018-01-24 13:47:43,518 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:43,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:43,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:43,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:43,519 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:43,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:43,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:43,630 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:43,630 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:47:43,630 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:43,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:47:43,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:47:43,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:47:43,631 INFO L87 Difference]: Start difference. First operand 214 states and 245 transitions. Second operand 6 states. [2018-01-24 13:47:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:44,010 INFO L93 Difference]: Finished difference Result 342 states and 398 transitions. [2018-01-24 13:47:44,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:47:44,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-01-24 13:47:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:44,012 INFO L225 Difference]: With dead ends: 342 [2018-01-24 13:47:44,013 INFO L226 Difference]: Without dead ends: 333 [2018-01-24 13:47:44,013 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:47:44,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-01-24 13:47:44,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 199. [2018-01-24 13:47:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-24 13:47:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 229 transitions. [2018-01-24 13:47:44,023 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 229 transitions. Word has length 31 [2018-01-24 13:47:44,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:44,024 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 229 transitions. [2018-01-24 13:47:44,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:47:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 229 transitions. [2018-01-24 13:47:44,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-24 13:47:44,025 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:44,025 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:44,025 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-24 13:47:44,025 INFO L82 PathProgramCache]: Analyzing trace with hash -706076137, now seen corresponding path program 1 times [2018-01-24 13:47:44,025 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:44,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:44,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:44,027 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:44,027 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:44,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:44,075 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:44,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:47:44,075 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:44,075 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:47:44,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:47:44,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:47:44,076 INFO L87 Difference]: Start difference. First operand 199 states and 229 transitions. Second operand 5 states. [2018-01-24 13:47:44,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:44,204 INFO L93 Difference]: Finished difference Result 279 states and 306 transitions. [2018-01-24 13:47:44,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:47:44,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-01-24 13:47:44,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:44,205 INFO L225 Difference]: With dead ends: 279 [2018-01-24 13:47:44,206 INFO L226 Difference]: Without dead ends: 222 [2018-01-24 13:47:44,206 INFO L525 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-24 13:47:44,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-01-24 13:47:44,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 199. [2018-01-24 13:47:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-01-24 13:47:44,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 227 transitions. [2018-01-24 13:47:44,214 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 227 transitions. Word has length 36 [2018-01-24 13:47:44,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:44,214 INFO L432 AbstractCegarLoop]: Abstraction has 199 states and 227 transitions. [2018-01-24 13:47:44,214 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:47:44,214 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 227 transitions. [2018-01-24 13:47:44,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-24 13:47:44,215 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:44,215 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:44,216 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-24 13:47:44,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1650873960, now seen corresponding path program 1 times [2018-01-24 13:47:44,216 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:44,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:44,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:44,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:44,217 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:44,229 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:44,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:44,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 13:47:44,732 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:44,732 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 13:47:44,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 13:47:44,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:47:44,733 INFO L87 Difference]: Start difference. First operand 199 states and 227 transitions. Second operand 10 states. [2018-01-24 13:47:45,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:45,316 INFO L93 Difference]: Finished difference Result 441 states and 497 transitions. [2018-01-24 13:47:45,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-24 13:47:45,316 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-24 13:47:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:45,317 INFO L225 Difference]: With dead ends: 441 [2018-01-24 13:47:45,317 INFO L226 Difference]: Without dead ends: 322 [2018-01-24 13:47:45,318 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-01-24 13:47:45,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-01-24 13:47:45,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 240. [2018-01-24 13:47:45,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-01-24 13:47:45,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 272 transitions. [2018-01-24 13:47:45,329 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 272 transitions. Word has length 42 [2018-01-24 13:47:45,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:45,330 INFO L432 AbstractCegarLoop]: Abstraction has 240 states and 272 transitions. [2018-01-24 13:47:45,330 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 13:47:45,330 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 272 transitions. [2018-01-24 13:47:45,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 13:47:45,331 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:45,331 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:45,331 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-24 13:47:45,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1611877026, now seen corresponding path program 1 times [2018-01-24 13:47:45,331 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:45,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:45,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:45,332 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:45,333 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:45,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:45,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:45,381 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:45,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:47:45,381 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:45,382 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:47:45,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:47:45,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:47:45,382 INFO L87 Difference]: Start difference. First operand 240 states and 272 transitions. Second operand 5 states. [2018-01-24 13:47:45,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:45,550 INFO L93 Difference]: Finished difference Result 360 states and 411 transitions. [2018-01-24 13:47:45,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:47:45,550 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-24 13:47:45,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:45,552 INFO L225 Difference]: With dead ends: 360 [2018-01-24 13:47:45,552 INFO L226 Difference]: Without dead ends: 359 [2018-01-24 13:47:45,552 INFO L525 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-24 13:47:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-01-24 13:47:45,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 239. [2018-01-24 13:47:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-01-24 13:47:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 271 transitions. [2018-01-24 13:47:45,568 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 271 transitions. Word has length 43 [2018-01-24 13:47:45,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:45,568 INFO L432 AbstractCegarLoop]: Abstraction has 239 states and 271 transitions. [2018-01-24 13:47:45,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:47:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 271 transitions. [2018-01-24 13:47:45,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-24 13:47:45,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:45,569 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:45,570 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-24 13:47:45,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1611877025, now seen corresponding path program 1 times [2018-01-24 13:47:45,570 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:45,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:45,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:45,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:45,571 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:45,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:45,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-24 13:47:45,677 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:45,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:47:45,677 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:45,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:47:45,678 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:47:45,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:47:45,678 INFO L87 Difference]: Start difference. First operand 239 states and 271 transitions. Second operand 5 states. [2018-01-24 13:47:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:46,061 INFO L93 Difference]: Finished difference Result 392 states and 450 transitions. [2018-01-24 13:47:46,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:47:46,062 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-01-24 13:47:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:46,063 INFO L225 Difference]: With dead ends: 392 [2018-01-24 13:47:46,063 INFO L226 Difference]: Without dead ends: 391 [2018-01-24 13:47:46,063 INFO L525 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-24 13:47:46,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-01-24 13:47:46,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 238. [2018-01-24 13:47:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-01-24 13:47:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 270 transitions. [2018-01-24 13:47:46,075 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 270 transitions. Word has length 43 [2018-01-24 13:47:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:46,075 INFO L432 AbstractCegarLoop]: Abstraction has 238 states and 270 transitions. [2018-01-24 13:47:46,075 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:47:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 270 transitions. [2018-01-24 13:47:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-24 13:47:46,076 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:46,076 INFO L322 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] [2018-01-24 13:47:46,076 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-24 13:47:46,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1934711090, now seen corresponding path program 1 times [2018-01-24 13:47:46,077 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:46,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:46,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:46,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:46,078 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:46,089 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:46,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:47:46,222 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:47:46,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:46,236 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:47:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:46,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:47:46,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:47:46,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:47:46,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:47:46,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:47:46,423 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,432 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,438 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-01-24 13:47:46,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 13:47:46,479 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:47:46,482 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-24 13:47:46,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 13:47:46,523 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:47:46,524 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-24 13:47:46,525 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,554 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-24 13:47:46,624 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-24 13:47:46,628 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:47:46,629 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-24 13:47:46,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,633 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,643 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-24 13:47:46,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:47:46,647 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-24 13:47:46,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,650 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,699 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-01-24 13:47:46,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:46,722 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:47:46,770 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:47:46,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:1 [2018-01-24 13:47:46,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:46,799 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:47:46,800 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:47:46,805 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:46,805 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:47:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:46,860 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:47:46,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:47:46,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:47:46,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-01-24 13:47:46,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-24 13:47:46,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,924 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,928 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-01-24 13:47:46,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 13:47:46,987 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:47:46,988 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-24 13:47:46,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:46,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:47,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-01-24 13:47:47,008 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:47:47,009 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-24 13:47:47,009 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:47,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:47,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:47,021 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-01-24 13:47:47,036 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-24 13:47:47,040 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:47:47,041 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-24 13:47:47,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:47,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:47,058 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-24 13:47:47,061 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:47:47,062 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-24 13:47:47,063 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:47,067 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:47,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:47,073 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:7 [2018-01-24 13:47:47,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:47,091 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:47:47,156 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-01-24 13:47:47,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:47,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:47,162 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:31, output treesize:1 [2018-01-24 13:47:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:47,188 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:47:47,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6, 9, 7] total 14 [2018-01-24 13:47:47,188 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:47:47,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:47:47,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:47:47,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:47:47,190 INFO L87 Difference]: Start difference. First operand 238 states and 270 transitions. Second operand 11 states. [2018-01-24 13:47:47,681 WARN L143 SmtUtils]: Spent 158ms on a formula simplification that was a NOOP. DAG size: 41 [2018-01-24 13:47:48,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:48,135 INFO L93 Difference]: Finished difference Result 479 states and 527 transitions. [2018-01-24 13:47:48,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-24 13:47:48,136 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 44 [2018-01-24 13:47:48,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:48,138 INFO L225 Difference]: With dead ends: 479 [2018-01-24 13:47:48,138 INFO L226 Difference]: Without dead ends: 383 [2018-01-24 13:47:48,139 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 160 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-01-24 13:47:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-01-24 13:47:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 285. [2018-01-24 13:47:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-01-24 13:47:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 329 transitions. [2018-01-24 13:47:48,165 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 329 transitions. Word has length 44 [2018-01-24 13:47:48,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:48,165 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 329 transitions. [2018-01-24 13:47:48,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:47:48,165 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 329 transitions. [2018-01-24 13:47:48,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 13:47:48,166 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:48,166 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:48,167 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-24 13:47:48,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1693979189, now seen corresponding path program 1 times [2018-01-24 13:47:48,167 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:48,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:48,168 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:48,168 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:48,169 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:48,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:48,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:48,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:48,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:47:48,316 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:48,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:47:48,317 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:47:48,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:47:48,317 INFO L87 Difference]: Start difference. First operand 285 states and 329 transitions. Second operand 8 states. [2018-01-24 13:47:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:48,745 INFO L93 Difference]: Finished difference Result 303 states and 349 transitions. [2018-01-24 13:47:48,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:47:48,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-01-24 13:47:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:48,747 INFO L225 Difference]: With dead ends: 303 [2018-01-24 13:47:48,747 INFO L226 Difference]: Without dead ends: 302 [2018-01-24 13:47:48,748 INFO L525 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-24 13:47:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-01-24 13:47:48,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 284. [2018-01-24 13:47:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-01-24 13:47:48,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 328 transitions. [2018-01-24 13:47:48,768 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 328 transitions. Word has length 46 [2018-01-24 13:47:48,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:48,768 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 328 transitions. [2018-01-24 13:47:48,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:47:48,768 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 328 transitions. [2018-01-24 13:47:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-24 13:47:48,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:48,769 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:48,769 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-24 13:47:48,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1693979188, now seen corresponding path program 1 times [2018-01-24 13:47:48,770 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:48,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:48,771 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:48,771 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:48,771 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:48,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:48,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:48,917 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:48,918 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:47:48,918 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:48,918 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:47:48,918 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:47:48,919 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:47:48,919 INFO L87 Difference]: Start difference. First operand 284 states and 328 transitions. Second operand 8 states. [2018-01-24 13:47:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:49,459 INFO L93 Difference]: Finished difference Result 302 states and 348 transitions. [2018-01-24 13:47:49,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:47:49,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-01-24 13:47:49,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:49,461 INFO L225 Difference]: With dead ends: 302 [2018-01-24 13:47:49,461 INFO L226 Difference]: Without dead ends: 301 [2018-01-24 13:47:49,461 INFO L525 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-24 13:47:49,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-01-24 13:47:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 283. [2018-01-24 13:47:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-01-24 13:47:49,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 327 transitions. [2018-01-24 13:47:49,482 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 327 transitions. Word has length 46 [2018-01-24 13:47:49,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:49,482 INFO L432 AbstractCegarLoop]: Abstraction has 283 states and 327 transitions. [2018-01-24 13:47:49,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:47:49,482 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 327 transitions. [2018-01-24 13:47:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 13:47:49,483 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:49,483 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:49,483 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-24 13:47:49,483 INFO L82 PathProgramCache]: Analyzing trace with hash -944056626, now seen corresponding path program 1 times [2018-01-24 13:47:49,483 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:49,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:49,484 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:49,484 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:49,485 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:49,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:49,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:49,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:49,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-24 13:47:49,652 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:49,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-24 13:47:49,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-24 13:47:49,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:47:49,653 INFO L87 Difference]: Start difference. First operand 283 states and 327 transitions. Second operand 11 states. [2018-01-24 13:47:50,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:50,224 INFO L93 Difference]: Finished difference Result 546 states and 612 transitions. [2018-01-24 13:47:50,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-01-24 13:47:50,225 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-01-24 13:47:50,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:50,229 INFO L225 Difference]: With dead ends: 546 [2018-01-24 13:47:50,229 INFO L226 Difference]: Without dead ends: 543 [2018-01-24 13:47:50,230 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=377, Unknown=0, NotChecked=0, Total=506 [2018-01-24 13:47:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2018-01-24 13:47:50,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 289. [2018-01-24 13:47:50,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-01-24 13:47:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 332 transitions. [2018-01-24 13:47:50,247 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 332 transitions. Word has length 47 [2018-01-24 13:47:50,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:50,247 INFO L432 AbstractCegarLoop]: Abstraction has 289 states and 332 transitions. [2018-01-24 13:47:50,248 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-24 13:47:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 332 transitions. [2018-01-24 13:47:50,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 13:47:50,248 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:50,248 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:50,248 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-24 13:47:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash -944056625, now seen corresponding path program 1 times [2018-01-24 13:47:50,249 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:50,249 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:50,249 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:50,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:50,250 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:50,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:50,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:50,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:47:50,503 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:50,503 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-24 13:47:50,503 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:50,504 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 13:47:50,504 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 13:47:50,504 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:47:50,504 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand 13 states. [2018-01-24 13:47:51,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:51,241 INFO L93 Difference]: Finished difference Result 603 states and 659 transitions. [2018-01-24 13:47:51,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-24 13:47:51,241 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2018-01-24 13:47:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:51,244 INFO L225 Difference]: With dead ends: 603 [2018-01-24 13:47:51,244 INFO L226 Difference]: Without dead ends: 600 [2018-01-24 13:47:51,244 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=551, Unknown=0, NotChecked=0, Total=756 [2018-01-24 13:47:51,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-01-24 13:47:51,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 296. [2018-01-24 13:47:51,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-01-24 13:47:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 338 transitions. [2018-01-24 13:47:51,270 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 338 transitions. Word has length 47 [2018-01-24 13:47:51,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:51,270 INFO L432 AbstractCegarLoop]: Abstraction has 296 states and 338 transitions. [2018-01-24 13:47:51,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 13:47:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 338 transitions. [2018-01-24 13:47:51,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 13:47:51,271 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:51,271 INFO L322 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] [2018-01-24 13:47:51,271 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-24 13:47:51,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1546550031, now seen corresponding path program 1 times [2018-01-24 13:47:51,272 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:51,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:51,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:51,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:51,273 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:51,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:51,383 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-24 13:47:51,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:47:51,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:47:51,384 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:47:51,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:47:51,384 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:47:51,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:47:51,384 INFO L87 Difference]: Start difference. First operand 296 states and 338 transitions. Second operand 7 states. [2018-01-24 13:47:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:51,538 INFO L93 Difference]: Finished difference Result 363 states and 413 transitions. [2018-01-24 13:47:51,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:47:51,539 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-01-24 13:47:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:51,540 INFO L225 Difference]: With dead ends: 363 [2018-01-24 13:47:51,540 INFO L226 Difference]: Without dead ends: 312 [2018-01-24 13:47:51,540 INFO L525 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-24 13:47:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-01-24 13:47:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2018-01-24 13:47:51,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-01-24 13:47:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 350 transitions. [2018-01-24 13:47:51,563 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 350 transitions. Word has length 53 [2018-01-24 13:47:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:51,564 INFO L432 AbstractCegarLoop]: Abstraction has 308 states and 350 transitions. [2018-01-24 13:47:51,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:47:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 350 transitions. [2018-01-24 13:47:51,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-01-24 13:47:51,565 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:51,565 INFO L322 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-24 13:47:51,565 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-24 13:47:51,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1009176340, now seen corresponding path program 1 times [2018-01-24 13:47:51,566 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:51,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:51,566 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:51,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:51,567 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:51,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:51,715 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-24 13:47:51,715 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:47:51,715 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:47:51,724 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:51,724 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:47:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:51,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:47:51,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 13:47:51,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 13:47:51,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:51,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:51,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:51,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-01-24 13:47:52,054 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-24 13:47:52,076 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-24 13:47:52,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-24 13:47:52,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:47:52,111 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-24 13:47:52,124 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:47:52,132 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:47:52,138 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-24 13:47:52,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-24 13:47:52,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:47:52,159 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-24 13:47:52,159 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-01-24 13:47:52,218 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-24 13:47:52,219 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:47:52,328 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 31 treesize of output 29 [2018-01-24 13:47:52,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-01-24 13:47:52,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-01-24 13:47:52,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-01-24 13:47:52,355 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-01-24 13:47:52,373 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-01-24 13:47:52,386 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:47:52,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-01-24 13:47:52,409 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:63, output treesize:39 [2018-01-24 13:47:52,448 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-24 13:47:52,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:47:52,482 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:47:52,485 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:52,486 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:47:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:52,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:47:52,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 13:47:52,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 13:47:52,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-24 13:47:52,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-24 13:47:52,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,629 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-01-24 13:47:52,786 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 22 treesize of output 16 [2018-01-24 13:47:52,788 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 16 treesize of output 3 [2018-01-24 13:47:52,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,794 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 22 treesize of output 16 [2018-01-24 13:47:52,795 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 16 treesize of output 3 [2018-01-24 13:47:52,795 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,796 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:52,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-01-24 13:47:52,818 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-24 13:47:52,818 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:47:52,906 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-24 13:47:52,907 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:47:52,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 10, 12, 9] total 33 [2018-01-24 13:47:52,908 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:47:52,908 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-24 13:47:52,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-24 13:47:52,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=910, Unknown=4, NotChecked=0, Total=1056 [2018-01-24 13:47:52,908 INFO L87 Difference]: Start difference. First operand 308 states and 350 transitions. Second operand 17 states. [2018-01-24 13:47:54,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:54,179 INFO L93 Difference]: Finished difference Result 636 states and 683 transitions. [2018-01-24 13:47:54,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-01-24 13:47:54,179 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-01-24 13:47:54,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:54,181 INFO L225 Difference]: With dead ends: 636 [2018-01-24 13:47:54,181 INFO L226 Difference]: Without dead ends: 601 [2018-01-24 13:47:54,182 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 189 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=430, Invalid=2317, Unknown=9, NotChecked=0, Total=2756 [2018-01-24 13:47:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-01-24 13:47:54,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 336. [2018-01-24 13:47:54,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-01-24 13:47:54,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 385 transitions. [2018-01-24 13:47:54,210 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 385 transitions. Word has length 55 [2018-01-24 13:47:54,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:54,211 INFO L432 AbstractCegarLoop]: Abstraction has 336 states and 385 transitions. [2018-01-24 13:47:54,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-24 13:47:54,211 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 385 transitions. [2018-01-24 13:47:54,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-01-24 13:47:54,212 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:54,212 INFO L322 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] [2018-01-24 13:47:54,212 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-24 13:47:54,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1219696535, now seen corresponding path program 1 times [2018-01-24 13:47:54,213 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:54,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:54,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:54,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:54,214 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:54,224 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:47:54,317 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-24 13:47:54,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:47:54,317 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-24 13:47:54,324 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:54,325 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:47:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:54,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:47:54,442 WARN L1029 $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-24 13:47:54,457 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-24 13:47:54,457 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:47:54,519 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_3| Int)) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_3|))) (= 0 |v_main_#t~malloc0.base_3|) (= (store |c_#valid| |v_main_#t~malloc0.base_3| 0) |c_old(#valid)|))) is different from false [2018-01-24 13:47:54,538 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-24 13:47:54,558 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:47:54,558 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:47:54,561 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:54,561 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:47:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:47:54,614 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:47:54,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-24 13:47:54,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:47:54,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:47:54,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-01-24 13:47:54,733 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-24 13:47:54,733 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:47:54,773 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc0.base_4| Int)) (or (= (store |c_#valid| |v_main_#t~malloc0.base_4| 0) |c_old(#valid)|) (= 0 |v_main_#t~malloc0.base_4|) (not (= 0 (select |c_#valid| |v_main_#t~malloc0.base_4|))))) is different from false [2018-01-24 13:47:54,800 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-24 13:47:54,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:47:54,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7, 6, 5] total 20 [2018-01-24 13:47:54,802 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:47:54,803 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 13:47:54,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 13:47:54,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=243, Unknown=6, NotChecked=102, Total=420 [2018-01-24 13:47:54,803 INFO L87 Difference]: Start difference. First operand 336 states and 385 transitions. Second operand 10 states. [2018-01-24 13:47:55,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:47:55,092 INFO L93 Difference]: Finished difference Result 376 states and 425 transitions. [2018-01-24 13:47:55,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-24 13:47:55,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 56 [2018-01-24 13:47:55,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:47:55,094 INFO L225 Difference]: With dead ends: 376 [2018-01-24 13:47:55,094 INFO L226 Difference]: Without dead ends: 345 [2018-01-24 13:47:55,094 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 206 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=397, Unknown=6, NotChecked=132, Total=650 [2018-01-24 13:47:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-01-24 13:47:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 344. [2018-01-24 13:47:55,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-01-24 13:47:55,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 393 transitions. [2018-01-24 13:47:55,111 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 393 transitions. Word has length 56 [2018-01-24 13:47:55,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:47:55,111 INFO L432 AbstractCegarLoop]: Abstraction has 344 states and 393 transitions. [2018-01-24 13:47:55,111 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 13:47:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 393 transitions. [2018-01-24 13:47:55,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-24 13:47:55,112 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:47:55,112 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:47:55,112 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-24 13:47:55,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1674520475, now seen corresponding path program 1 times [2018-01-24 13:47:55,112 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:47:55,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:55,113 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:47:55,113 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:47:55,113 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:47:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 13:47:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-24 13:47:55,162 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-24 13:47:55,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:47:55 BoogieIcfgContainer [2018-01-24 13:47:55,216 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:47:55,217 INFO L168 Benchmark]: Toolchain (without parser) took 17288.20 ms. Allocated memory was 304.6 MB in the beginning and 640.7 MB in the end (delta: 336.1 MB). Free memory was 264.7 MB in the beginning and 478.5 MB in the end (delta: -213.8 MB). Peak memory consumption was 122.2 MB. Max. memory is 5.3 GB. [2018-01-24 13:47:55,218 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 304.6 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:47:55,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.08 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 251.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-24 13:47:55,218 INFO L168 Benchmark]: Boogie Preprocessor took 37.52 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:47:55,218 INFO L168 Benchmark]: RCFGBuilder took 627.38 ms. Allocated memory is still 304.6 MB. Free memory was 248.5 MB in the beginning and 205.4 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:47:55,218 INFO L168 Benchmark]: TraceAbstraction took 16390.83 ms. Allocated memory was 304.6 MB in the beginning and 640.7 MB in the end (delta: 336.1 MB). Free memory was 205.4 MB in the beginning and 478.5 MB in the end (delta: -273.1 MB). Peak memory consumption was 63.0 MB. Max. memory is 5.3 GB. [2018-01-24 13:47:55,220 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 304.6 MB. Free memory is still 270.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.08 ms. Allocated memory is still 304.6 MB. Free memory was 263.7 MB in the beginning and 251.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.52 ms. Allocated memory is still 304.6 MB. Free memory was 251.5 MB in the beginning and 249.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 627.38 ms. Allocated memory is still 304.6 MB. Free memory was 248.5 MB in the beginning and 205.4 MB in the end (delta: 43.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 16390.83 ms. Allocated memory was 304.6 MB in the beginning and 640.7 MB in the end (delta: 336.1 MB). Free memory was 205.4 MB in the beginning and 478.5 MB in the end (delta: -273.1 MB). Peak memory consumption was 63.0 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))={11:0}] [L991] SLL* list = malloc(sizeof(SLL)); VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L992] FCALL list->next = ((void*)0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list != ((void*)0))) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(__VERIFIER_nondet_int()) [L993] EXPR, FCALL malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner = malloc(sizeof(SLL)) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->next = ((void*)0) VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] FCALL list->inner->inner = ((void*)0) VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR, FCALL list->inner VAL [list={11:0}, list->inner={9:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) VAL [list={11:0}, list->inner={9:0}, list->inner != ((void*)0) || list->inner == ((void*)0)=1, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L993] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L993] COND FALSE !(0) VAL [list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L995] SLL* end = list; VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L1008] end = ((void*)0) [L1009] end = list VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(!(((void*)0) != end)) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1012] COND FALSE !(0) VAL [end={11:0}, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1014] COND TRUE ((void*)0) != end [L1016] int len = 0; VAL [end={11:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1017] EXPR, FCALL end->inner VAL [end={11:0}, end->inner={9:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1017] SLL* inner = end->inner; [L1018] COND TRUE ((void*)0) != inner VAL [end={11:0}, inner={9:0}, len=0, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1020] COND TRUE len == 0 [L1021] len = 1 VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(!(((void*)0) != inner)) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1024] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1025] EXPR, FCALL inner->inner VAL [end={11:0}, inner={9:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1025] COND FALSE !(!(((void*)0) == inner->inner)) [L1025] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1026] EXPR, FCALL inner->next VAL [end={11:0}, inner={9:0}, inner->next={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1026] COND FALSE !(!(((void*)0) == inner->next)) [L1026] COND FALSE !(0) VAL [end={11:0}, inner={9:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1027] EXPR, FCALL inner->inner VAL [end={11:0}, inner={9:0}, inner->inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1027] inner = inner->inner [L1028] COND TRUE len == 1 VAL [end={11:0}, inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] [L1029] FCALL inner->inner VAL [end={11:0}, inner={0:0}, len=1, list={11:0}, malloc(sizeof(SLL))={9:0}, malloc(sizeof(SLL))={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 188 locations, 65 error locations. UNSAFE Result, 16.3s OverallTime, 24 OverallIterations, 2 TraceHistogramMax, 9.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3785 SDtfs, 8694 SDslu, 12489 SDs, 0 SdLazy, 8492 SolverSat, 487 SolverUnsat, 50 SolverUnknown, 0 SolverNotchecked, 6.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 906 GetRequests, 588 SyntacticMatches, 30 SemanticMatches, 288 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 2337 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1159 NumberOfCodeBlocks, 1159 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1377 ConstructedInterpolants, 21 QuantifiedInterpolants, 772389 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1000 ConjunctsInSsa, 136 ConjunctsInUnsatCore, 35 InterpolantComputations, 20 PerfectInterpolantSequences, 22/62 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-47-55-228.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_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-47-55-228.csv Received shutdown request...