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_Taipan+AI_EQ_smtcomp.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 05:58:08,711 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 05:58:08,713 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 05:58:08,730 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 05:58:08,730 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 05:58:08,731 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 05:58:08,732 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 05:58:08,734 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 05:58:08,737 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 05:58:08,737 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 05:58:08,738 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 05:58:08,739 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 05:58:08,740 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 05:58:08,741 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 05:58:08,742 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 05:58:08,744 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 05:58:08,747 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 05:58:08,749 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 05:58:08,750 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 05:58:08,751 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 05:58:08,753 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 05:58:08,754 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 05:58:08,754 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 05:58:08,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 05:58:08,756 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 05:58:08,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 05:58:08,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 05:58:08,758 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 05:58:08,758 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 05:58:08,758 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 05:58:08,759 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 05:58:08,759 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf [2018-01-25 05:58:08,769 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 05:58:08,769 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 05:58:08,770 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 05:58:08,770 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 05:58:08,771 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 05:58:08,771 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 05:58:08,771 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-25 05:58:08,771 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 05:58:08,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 05:58:08,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 05:58:08,772 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 05:58:08,772 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 05:58:08,773 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 05:58:08,773 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 05:58:08,773 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 05:58:08,773 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 05:58:08,773 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 05:58:08,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 05:58:08,774 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 05:58:08,774 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 05:58:08,774 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 05:58:08,774 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 05:58:08,774 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 05:58:08,775 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 05:58:08,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 05:58:08,775 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 05:58:08,775 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 05:58:08,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 05:58:08,776 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 05:58:08,776 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 05:58:08,776 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 05:58:08,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 05:58:08,776 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 05:58:08,776 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 05:58:08,777 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 05:58:08,778 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 05:58:08,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 05:58:08,826 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 05:58:08,830 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 05:58:08,832 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 05:58:08,833 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 05:58:08,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i [2018-01-25 05:58:09,019 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 05:58:09,024 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 05:58:09,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 05:58:09,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 05:58:09,030 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 05:58:09,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:58:09" (1/1) ... [2018-01-25 05:58:09,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@365d5287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:09, skipping insertion in model container [2018-01-25 05:58:09,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 05:58:09" (1/1) ... [2018-01-25 05:58:09,052 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:58:09,092 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 05:58:09,212 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:58:09,235 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 05:58:09,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:09 WrapperNode [2018-01-25 05:58:09,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 05:58:09,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 05:58:09,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 05:58:09,250 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 05:58:09,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:09" (1/1) ... [2018-01-25 05:58:09,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:09" (1/1) ... [2018-01-25 05:58:09,275 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:09" (1/1) ... [2018-01-25 05:58:09,275 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:09" (1/1) ... [2018-01-25 05:58:09,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:09" (1/1) ... [2018-01-25 05:58:09,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:09" (1/1) ... [2018-01-25 05:58:09,287 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:09" (1/1) ... [2018-01-25 05:58:09,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 05:58:09,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 05:58:09,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 05:58:09,290 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 05:58:09,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:09" (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-25 05:58:09,341 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 05:58:09,341 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 05:58:09,341 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 05:58:09,341 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 05:58:09,341 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 05:58:09,342 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 05:58:09,342 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 05:58:09,342 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 05:58:09,342 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 05:58:09,342 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 05:58:09,342 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 05:58:09,342 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 05:58:09,342 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-01-25 05:58:09,342 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 05:58:09,342 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 05:58:09,342 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 05:58:09,343 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 05:58:09,909 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 05:58:09,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:58:09 BoogieIcfgContainer [2018-01-25 05:58:09,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 05:58:09,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 05:58:09,912 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 05:58:09,914 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 05:58:09,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 05:58:09" (1/3) ... [2018-01-25 05:58:09,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cde122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:58:09, skipping insertion in model container [2018-01-25 05:58:09,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 05:58:09" (2/3) ... [2018-01-25 05:58:09,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49cde122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 05:58:09, skipping insertion in model container [2018-01-25 05:58:09,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 05:58:09" (3/3) ... [2018-01-25 05:58:09,918 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0513_1_true-valid-memsafety.i [2018-01-25 05:58:09,925 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 05:58:09,932 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-01-25 05:58:09,972 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 05:58:09,972 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 05:58:09,972 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 05:58:09,972 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 05:58:09,972 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 05:58:09,972 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 05:58:09,973 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 05:58:09,973 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 05:58:09,973 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 05:58:09,994 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states. [2018-01-25 05:58:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-01-25 05:58:10,000 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:10,001 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:58:10,002 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1366809009, now seen corresponding path program 1 times [2018-01-25 05:58:10,007 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:10,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:10,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:10,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:10,049 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:10,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:10,114 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-25 05:58:10,116 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:10,116 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:58:10,117 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:10,119 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-25 05:58:10,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-25 05:58:10,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:58:10,132 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 2 states. [2018-01-25 05:58:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:10,236 INFO L93 Difference]: Finished difference Result 304 states and 342 transitions. [2018-01-25 05:58:10,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-25 05:58:10,238 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-01-25 05:58:10,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:10,250 INFO L225 Difference]: With dead ends: 304 [2018-01-25 05:58:10,251 INFO L226 Difference]: Without dead ends: 152 [2018-01-25 05:58:10,256 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-25 05:58:10,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-01-25 05:58:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-01-25 05:58:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-01-25 05:58:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2018-01-25 05:58:10,301 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 9 [2018-01-25 05:58:10,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:10,301 INFO L432 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2018-01-25 05:58:10,301 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-25 05:58:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2018-01-25 05:58:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-01-25 05:58:10,302 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:10,302 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:58:10,302 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:10,303 INFO L82 PathProgramCache]: Analyzing trace with hash -26359990, now seen corresponding path program 1 times [2018-01-25 05:58:10,303 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:10,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:10,304 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:10,304 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:10,304 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:10,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:10,375 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-25 05:58:10,375 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:10,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 05:58:10,375 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:10,376 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:58:10,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:58:10,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:58:10,377 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand 3 states. [2018-01-25 05:58:10,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:10,556 INFO L93 Difference]: Finished difference Result 197 states and 214 transitions. [2018-01-25 05:58:10,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:58:10,556 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-01-25 05:58:10,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:10,561 INFO L225 Difference]: With dead ends: 197 [2018-01-25 05:58:10,561 INFO L226 Difference]: Without dead ends: 195 [2018-01-25 05:58:10,562 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:58:10,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-01-25 05:58:10,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 157. [2018-01-25 05:58:10,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-01-25 05:58:10,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2018-01-25 05:58:10,576 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 12 [2018-01-25 05:58:10,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:10,576 INFO L432 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2018-01-25 05:58:10,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:58:10,577 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2018-01-25 05:58:10,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-25 05:58:10,577 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:10,577 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:58:10,578 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:10,578 INFO L82 PathProgramCache]: Analyzing trace with hash -817163438, now seen corresponding path program 1 times [2018-01-25 05:58:10,578 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:10,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:10,579 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:10,579 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:10,579 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:10,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:10,622 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-25 05:58:10,623 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:10,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:58:10,623 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:10,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:58:10,624 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:58:10,624 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:58:10,624 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand 3 states. [2018-01-25 05:58:10,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:10,692 INFO L93 Difference]: Finished difference Result 326 states and 359 transitions. [2018-01-25 05:58:10,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:58:10,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-01-25 05:58:10,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:10,694 INFO L225 Difference]: With dead ends: 326 [2018-01-25 05:58:10,694 INFO L226 Difference]: Without dead ends: 179 [2018-01-25 05:58:10,695 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:58:10,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-01-25 05:58:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 169. [2018-01-25 05:58:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-25 05:58:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2018-01-25 05:58:10,708 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 13 [2018-01-25 05:58:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:10,708 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 195 transitions. [2018-01-25 05:58:10,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:58:10,709 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 195 transitions. [2018-01-25 05:58:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:58:10,709 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:10,709 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:58:10,710 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:10,710 INFO L82 PathProgramCache]: Analyzing trace with hash 437426512, now seen corresponding path program 1 times [2018-01-25 05:58:10,710 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:10,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:10,711 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:10,711 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:10,711 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:10,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:10,772 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-25 05:58:10,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:10,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:58:10,773 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:10,773 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:58:10,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:58:10,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:58:10,774 INFO L87 Difference]: Start difference. First operand 169 states and 195 transitions. Second operand 4 states. [2018-01-25 05:58:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:11,039 INFO L93 Difference]: Finished difference Result 245 states and 275 transitions. [2018-01-25 05:58:11,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:58:11,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:58:11,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:11,042 INFO L225 Difference]: With dead ends: 245 [2018-01-25 05:58:11,042 INFO L226 Difference]: Without dead ends: 239 [2018-01-25 05:58:11,042 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-25 05:58:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-01-25 05:58:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 169. [2018-01-25 05:58:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-01-25 05:58:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 195 transitions. [2018-01-25 05:58:11,054 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 195 transitions. Word has length 14 [2018-01-25 05:58:11,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:11,054 INFO L432 AbstractCegarLoop]: Abstraction has 169 states and 195 transitions. [2018-01-25 05:58:11,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:58:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 195 transitions. [2018-01-25 05:58:11,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 05:58:11,055 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:11,055 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:58:11,055 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:11,056 INFO L82 PathProgramCache]: Analyzing trace with hash 437426513, now seen corresponding path program 1 times [2018-01-25 05:58:11,056 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:11,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:11,057 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:11,057 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:11,057 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:11,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:11,120 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-25 05:58:11,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:11,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:58:11,121 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:11,122 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:58:11,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:58:11,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:58:11,122 INFO L87 Difference]: Start difference. First operand 169 states and 195 transitions. Second operand 4 states. [2018-01-25 05:58:11,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:11,256 INFO L93 Difference]: Finished difference Result 169 states and 195 transitions. [2018-01-25 05:58:11,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:58:11,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-01-25 05:58:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:11,257 INFO L225 Difference]: With dead ends: 169 [2018-01-25 05:58:11,258 INFO L226 Difference]: Without dead ends: 165 [2018-01-25 05:58:11,258 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:58:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-25 05:58:11,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-01-25 05:58:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-25 05:58:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2018-01-25 05:58:11,269 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 14 [2018-01-25 05:58:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:11,269 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2018-01-25 05:58:11,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:58:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2018-01-25 05:58:11,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 05:58:11,270 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:11,270 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] [2018-01-25 05:58:11,271 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:11,271 INFO L82 PathProgramCache]: Analyzing trace with hash 809095649, now seen corresponding path program 1 times [2018-01-25 05:58:11,271 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:11,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:11,272 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:11,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:11,273 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:11,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:11,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:11,334 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-25 05:58:11,334 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:11,335 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:58:11,335 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:11,335 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:58:11,335 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:58:11,335 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:58:11,335 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand 5 states. [2018-01-25 05:58:11,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:11,379 INFO L93 Difference]: Finished difference Result 451 states and 510 transitions. [2018-01-25 05:58:11,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:58:11,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-01-25 05:58:11,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:11,384 INFO L225 Difference]: With dead ends: 451 [2018-01-25 05:58:11,384 INFO L226 Difference]: Without dead ends: 306 [2018-01-25 05:58:11,385 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:58:11,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-01-25 05:58:11,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 165. [2018-01-25 05:58:11,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-01-25 05:58:11,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 185 transitions. [2018-01-25 05:58:11,395 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 185 transitions. Word has length 21 [2018-01-25 05:58:11,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:11,395 INFO L432 AbstractCegarLoop]: Abstraction has 165 states and 185 transitions. [2018-01-25 05:58:11,395 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:58:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 185 transitions. [2018-01-25 05:58:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:58:11,396 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:11,397 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] [2018-01-25 05:58:11,397 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:11,397 INFO L82 PathProgramCache]: Analyzing trace with hash -836569732, now seen corresponding path program 1 times [2018-01-25 05:58:11,397 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:11,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:11,399 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:11,399 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:11,399 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:11,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:11,447 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-25 05:58:11,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:11,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:58:11,447 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:11,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:58:11,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:58:11,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:58:11,449 INFO L87 Difference]: Start difference. First operand 165 states and 185 transitions. Second operand 4 states. [2018-01-25 05:58:11,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:11,660 INFO L93 Difference]: Finished difference Result 203 states and 224 transitions. [2018-01-25 05:58:11,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:58:11,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-25 05:58:11,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:11,662 INFO L225 Difference]: With dead ends: 203 [2018-01-25 05:58:11,662 INFO L226 Difference]: Without dead ends: 199 [2018-01-25 05:58:11,663 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-25 05:58:11,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-01-25 05:58:11,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 161. [2018-01-25 05:58:11,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-01-25 05:58:11,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2018-01-25 05:58:11,669 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 22 [2018-01-25 05:58:11,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:11,669 INFO L432 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2018-01-25 05:58:11,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:58:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2018-01-25 05:58:11,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 05:58:11,670 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:11,671 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] [2018-01-25 05:58:11,671 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:11,671 INFO L82 PathProgramCache]: Analyzing trace with hash -836569731, now seen corresponding path program 1 times [2018-01-25 05:58:11,671 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:11,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:11,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:11,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:11,672 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:11,686 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:11,751 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-25 05:58:11,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:11,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:58:11,751 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:11,751 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:58:11,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:58:11,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:58:11,752 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand 4 states. [2018-01-25 05:58:11,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:11,881 INFO L93 Difference]: Finished difference Result 161 states and 181 transitions. [2018-01-25 05:58:11,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:58:11,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-01-25 05:58:11,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:11,882 INFO L225 Difference]: With dead ends: 161 [2018-01-25 05:58:11,882 INFO L226 Difference]: Without dead ends: 158 [2018-01-25 05:58:11,882 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-25 05:58:11,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-25 05:58:11,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-01-25 05:58:11,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-25 05:58:11,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 178 transitions. [2018-01-25 05:58:11,887 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 178 transitions. Word has length 22 [2018-01-25 05:58:11,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:11,888 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 178 transitions. [2018-01-25 05:58:11,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:58:11,888 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 178 transitions. [2018-01-25 05:58:11,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 05:58:11,888 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:11,889 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] [2018-01-25 05:58:11,889 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:11,889 INFO L82 PathProgramCache]: Analyzing trace with hash 261861212, now seen corresponding path program 1 times [2018-01-25 05:58:11,889 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:11,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:11,890 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:11,890 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:11,890 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:11,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:58:11,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:11,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 05:58:11,950 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:11,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:58:11,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:58:11,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:58:11,951 INFO L87 Difference]: Start difference. First operand 158 states and 178 transitions. Second operand 5 states. [2018-01-25 05:58:12,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:12,081 INFO L93 Difference]: Finished difference Result 397 states and 446 transitions. [2018-01-25 05:58:12,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:58:12,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-25 05:58:12,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:12,083 INFO L225 Difference]: With dead ends: 397 [2018-01-25 05:58:12,083 INFO L226 Difference]: Without dead ends: 262 [2018-01-25 05:58:12,084 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-25 05:58:12,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-01-25 05:58:12,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 158. [2018-01-25 05:58:12,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-25 05:58:12,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2018-01-25 05:58:12,094 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 31 [2018-01-25 05:58:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:12,094 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2018-01-25 05:58:12,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:58:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2018-01-25 05:58:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:58:12,095 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:12,095 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] [2018-01-25 05:58:12,096 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash -472240768, now seen corresponding path program 1 times [2018-01-25 05:58:12,096 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:12,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:12,097 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:12,097 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:12,097 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:12,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:58:12,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:12,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:58:12,204 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:12,204 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:58:12,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:58:12,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:58:12,205 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand 5 states. [2018-01-25 05:58:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:12,436 INFO L93 Difference]: Finished difference Result 263 states and 292 transitions. [2018-01-25 05:58:12,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:58:12,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-25 05:58:12,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:12,439 INFO L225 Difference]: With dead ends: 263 [2018-01-25 05:58:12,439 INFO L226 Difference]: Without dead ends: 253 [2018-01-25 05:58:12,439 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 05:58:12,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-01-25 05:58:12,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 200. [2018-01-25 05:58:12,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-01-25 05:58:12,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 257 transitions. [2018-01-25 05:58:12,453 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 257 transitions. Word has length 32 [2018-01-25 05:58:12,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:12,454 INFO L432 AbstractCegarLoop]: Abstraction has 200 states and 257 transitions. [2018-01-25 05:58:12,454 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:58:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 257 transitions. [2018-01-25 05:58:12,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 05:58:12,455 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:12,455 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] [2018-01-25 05:58:12,455 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:12,456 INFO L82 PathProgramCache]: Analyzing trace with hash -472240769, now seen corresponding path program 1 times [2018-01-25 05:58:12,456 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:12,457 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:12,457 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:12,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:12,460 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:12,473 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:12,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:58:12,521 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:12,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:58:12,521 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:12,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 05:58:12,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 05:58:12,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 05:58:12,522 INFO L87 Difference]: Start difference. First operand 200 states and 257 transitions. Second operand 5 states. [2018-01-25 05:58:12,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:12,650 INFO L93 Difference]: Finished difference Result 203 states and 259 transitions. [2018-01-25 05:58:12,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:58:12,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-25 05:58:12,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:12,651 INFO L225 Difference]: With dead ends: 203 [2018-01-25 05:58:12,651 INFO L226 Difference]: Without dead ends: 194 [2018-01-25 05:58:12,652 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:58:12,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-01-25 05:58:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-01-25 05:58:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-25 05:58:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 242 transitions. [2018-01-25 05:58:12,661 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 242 transitions. Word has length 32 [2018-01-25 05:58:12,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:12,661 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 242 transitions. [2018-01-25 05:58:12,661 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 05:58:12,661 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 242 transitions. [2018-01-25 05:58:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 05:58:12,662 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:12,662 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] [2018-01-25 05:58:12,663 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:12,663 INFO L82 PathProgramCache]: Analyzing trace with hash 456903790, now seen corresponding path program 1 times [2018-01-25 05:58:12,663 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:12,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:12,664 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:12,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:12,664 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:12,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:12,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:58:12,714 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:12,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 05:58:12,714 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:12,715 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:58:12,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:58:12,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:58:12,715 INFO L87 Difference]: Start difference. First operand 192 states and 242 transitions. Second operand 4 states. [2018-01-25 05:58:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:12,759 INFO L93 Difference]: Finished difference Result 529 states and 673 transitions. [2018-01-25 05:58:12,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 05:58:12,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-25 05:58:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:12,761 INFO L225 Difference]: With dead ends: 529 [2018-01-25 05:58:12,761 INFO L226 Difference]: Without dead ends: 353 [2018-01-25 05:58:12,762 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:58:12,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-01-25 05:58:12,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 193. [2018-01-25 05:58:12,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-01-25 05:58:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 241 transitions. [2018-01-25 05:58:12,774 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 241 transitions. Word has length 37 [2018-01-25 05:58:12,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:12,774 INFO L432 AbstractCegarLoop]: Abstraction has 193 states and 241 transitions. [2018-01-25 05:58:12,774 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:58:12,774 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 241 transitions. [2018-01-25 05:58:12,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-01-25 05:58:12,775 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:12,776 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] [2018-01-25 05:58:12,776 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:12,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1168751179, now seen corresponding path program 1 times [2018-01-25 05:58:12,776 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:12,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:12,777 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:12,777 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:12,777 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:12,797 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:58:12,943 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:12,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 05:58:12,943 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:12,944 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 05:58:12,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 05:58:12,944 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 05:58:12,945 INFO L87 Difference]: Start difference. First operand 193 states and 241 transitions. Second operand 6 states. [2018-01-25 05:58:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:13,121 INFO L93 Difference]: Finished difference Result 369 states and 464 transitions. [2018-01-25 05:58:13,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 05:58:13,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-01-25 05:58:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:13,122 INFO L225 Difference]: With dead ends: 369 [2018-01-25 05:58:13,123 INFO L226 Difference]: Without dead ends: 232 [2018-01-25 05:58:13,123 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 05:58:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-01-25 05:58:13,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 203. [2018-01-25 05:58:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-01-25 05:58:13,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 253 transitions. [2018-01-25 05:58:13,131 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 253 transitions. Word has length 39 [2018-01-25 05:58:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:13,131 INFO L432 AbstractCegarLoop]: Abstraction has 203 states and 253 transitions. [2018-01-25 05:58:13,131 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 05:58:13,131 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 253 transitions. [2018-01-25 05:58:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 05:58:13,132 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:13,132 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] [2018-01-25 05:58:13,132 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:13,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1118408649, now seen corresponding path program 1 times [2018-01-25 05:58:13,133 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:13,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:13,134 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:13,134 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:13,134 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:13,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:13,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:58:13,610 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:13,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:58:13,610 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:13,611 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-25 05:58:13,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-25 05:58:13,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-25 05:58:13,611 INFO L87 Difference]: Start difference. First operand 203 states and 253 transitions. Second operand 11 states. [2018-01-25 05:58:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:14,306 INFO L93 Difference]: Finished difference Result 289 states and 345 transitions. [2018-01-25 05:58:14,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:58:14,342 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2018-01-25 05:58:14,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:14,343 INFO L225 Difference]: With dead ends: 289 [2018-01-25 05:58:14,344 INFO L226 Difference]: Without dead ends: 288 [2018-01-25 05:58:14,344 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2018-01-25 05:58:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-01-25 05:58:14,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 209. [2018-01-25 05:58:14,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-25 05:58:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 261 transitions. [2018-01-25 05:58:14,358 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 261 transitions. Word has length 41 [2018-01-25 05:58:14,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:14,358 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 261 transitions. [2018-01-25 05:58:14,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-25 05:58:14,358 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 261 transitions. [2018-01-25 05:58:14,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-25 05:58:14,359 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:14,359 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] [2018-01-25 05:58:14,359 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:14,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1118408648, now seen corresponding path program 1 times [2018-01-25 05:58:14,360 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:14,360 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:14,361 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:14,361 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:14,361 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:14,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:58:14,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:14,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 05:58:14,911 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:14,911 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:58:14,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:58:14,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:58:14,912 INFO L87 Difference]: Start difference. First operand 209 states and 261 transitions. Second operand 12 states. [2018-01-25 05:58:15,163 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 24 DAG size of output 23 [2018-01-25 05:58:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:15,808 INFO L93 Difference]: Finished difference Result 259 states and 313 transitions. [2018-01-25 05:58:15,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 05:58:15,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-01-25 05:58:15,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:15,809 INFO L225 Difference]: With dead ends: 259 [2018-01-25 05:58:15,809 INFO L226 Difference]: Without dead ends: 258 [2018-01-25 05:58:15,810 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=471, Unknown=0, NotChecked=0, Total=650 [2018-01-25 05:58:15,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-01-25 05:58:15,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 209. [2018-01-25 05:58:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-25 05:58:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 260 transitions. [2018-01-25 05:58:15,819 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 260 transitions. Word has length 41 [2018-01-25 05:58:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:15,820 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 260 transitions. [2018-01-25 05:58:15,820 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:58:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 260 transitions. [2018-01-25 05:58:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-25 05:58:15,820 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:15,820 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] [2018-01-25 05:58:15,821 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash -310930527, now seen corresponding path program 1 times [2018-01-25 05:58:15,821 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:15,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:15,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:15,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:15,822 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:15,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:16,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:58:16,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:16,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-25 05:58:16,036 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:16,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 05:58:16,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 05:58:16,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-25 05:58:16,037 INFO L87 Difference]: Start difference. First operand 209 states and 260 transitions. Second operand 10 states. [2018-01-25 05:58:16,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:16,230 INFO L93 Difference]: Finished difference Result 239 states and 291 transitions. [2018-01-25 05:58:16,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 05:58:16,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-01-25 05:58:16,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:16,231 INFO L225 Difference]: With dead ends: 239 [2018-01-25 05:58:16,231 INFO L226 Difference]: Without dead ends: 236 [2018-01-25 05:58:16,231 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2018-01-25 05:58:16,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-01-25 05:58:16,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 209. [2018-01-25 05:58:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-01-25 05:58:16,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 259 transitions. [2018-01-25 05:58:16,244 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 259 transitions. Word has length 42 [2018-01-25 05:58:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:16,244 INFO L432 AbstractCegarLoop]: Abstraction has 209 states and 259 transitions. [2018-01-25 05:58:16,244 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 05:58:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 259 transitions. [2018-01-25 05:58:16,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-25 05:58:16,245 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:16,245 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] [2018-01-25 05:58:16,245 INFO L371 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:16,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1048881672, now seen corresponding path program 1 times [2018-01-25 05:58:16,246 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:16,246 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:16,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:16,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:16,247 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:16,261 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 05:58:16,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:16,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:58:16,299 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:16,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 05:58:16,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 05:58:16,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 05:58:16,300 INFO L87 Difference]: Start difference. First operand 209 states and 259 transitions. Second operand 4 states. [2018-01-25 05:58:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:16,606 INFO L93 Difference]: Finished difference Result 270 states and 334 transitions. [2018-01-25 05:58:16,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 05:58:16,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-01-25 05:58:16,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:16,608 INFO L225 Difference]: With dead ends: 270 [2018-01-25 05:58:16,608 INFO L226 Difference]: Without dead ends: 265 [2018-01-25 05:58:16,609 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-25 05:58:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-01-25 05:58:16,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 213. [2018-01-25 05:58:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-01-25 05:58:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 270 transitions. [2018-01-25 05:58:16,621 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 270 transitions. Word has length 43 [2018-01-25 05:58:16,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:16,621 INFO L432 AbstractCegarLoop]: Abstraction has 213 states and 270 transitions. [2018-01-25 05:58:16,621 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 05:58:16,621 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 270 transitions. [2018-01-25 05:58:16,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-25 05:58:16,622 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:16,622 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] [2018-01-25 05:58:16,622 INFO L371 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:16,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1048881671, now seen corresponding path program 1 times [2018-01-25 05:58:16,623 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:16,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:16,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:16,624 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:16,624 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:16,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:58:17,060 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:17,060 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-25 05:58:17,060 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:17,060 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 05:58:17,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 05:58:17,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-01-25 05:58:17,061 INFO L87 Difference]: Start difference. First operand 213 states and 270 transitions. Second operand 13 states. [2018-01-25 05:58:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:17,934 INFO L93 Difference]: Finished difference Result 271 states and 334 transitions. [2018-01-25 05:58:17,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 05:58:17,935 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-01-25 05:58:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:17,936 INFO L225 Difference]: With dead ends: 271 [2018-01-25 05:58:17,936 INFO L226 Difference]: Without dead ends: 269 [2018-01-25 05:58:17,937 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2018-01-25 05:58:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-01-25 05:58:17,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 218. [2018-01-25 05:58:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-01-25 05:58:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 276 transitions. [2018-01-25 05:58:17,947 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 276 transitions. Word has length 43 [2018-01-25 05:58:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:17,947 INFO L432 AbstractCegarLoop]: Abstraction has 218 states and 276 transitions. [2018-01-25 05:58:17,947 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 05:58:17,947 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 276 transitions. [2018-01-25 05:58:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-25 05:58:17,948 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:17,948 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] [2018-01-25 05:58:17,948 INFO L371 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:17,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1204415842, now seen corresponding path program 1 times [2018-01-25 05:58:17,948 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:17,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:17,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:17,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:17,949 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:17,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 05:58:17,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:17,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 05:58:17,992 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:17,993 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 05:58:17,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 05:58:17,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:58:17,993 INFO L87 Difference]: Start difference. First operand 218 states and 276 transitions. Second operand 3 states. [2018-01-25 05:58:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:18,009 INFO L93 Difference]: Finished difference Result 238 states and 299 transitions. [2018-01-25 05:58:18,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 05:58:18,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-01-25 05:58:18,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:18,011 INFO L225 Difference]: With dead ends: 238 [2018-01-25 05:58:18,011 INFO L226 Difference]: Without dead ends: 219 [2018-01-25 05:58:18,011 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 05:58:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-01-25 05:58:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-01-25 05:58:18,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-01-25 05:58:18,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 277 transitions. [2018-01-25 05:58:18,024 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 277 transitions. Word has length 47 [2018-01-25 05:58:18,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:18,025 INFO L432 AbstractCegarLoop]: Abstraction has 219 states and 277 transitions. [2018-01-25 05:58:18,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 05:58:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2018-01-25 05:58:18,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-25 05:58:18,026 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:18,026 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] [2018-01-25 05:58:18,026 INFO L371 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:18,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2091612127, now seen corresponding path program 1 times [2018-01-25 05:58:18,027 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:18,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:18,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:18,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:18,028 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:18,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:18,450 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 23 DAG size of output 11 [2018-01-25 05:58:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:58:18,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 05:58:18,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 05:58:18,655 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 05:58:18,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 05:58:18,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 05:58:18,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-01-25 05:58:18,656 INFO L87 Difference]: Start difference. First operand 219 states and 277 transitions. Second operand 12 states. [2018-01-25 05:58:19,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 05:58:19,293 INFO L93 Difference]: Finished difference Result 290 states and 355 transitions. [2018-01-25 05:58:19,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-25 05:58:19,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-01-25 05:58:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 05:58:19,294 INFO L225 Difference]: With dead ends: 290 [2018-01-25 05:58:19,294 INFO L226 Difference]: Without dead ends: 289 [2018-01-25 05:58:19,295 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=520, Unknown=0, NotChecked=0, Total=702 [2018-01-25 05:58:19,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-01-25 05:58:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 222. [2018-01-25 05:58:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-01-25 05:58:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 281 transitions. [2018-01-25 05:58:19,342 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 281 transitions. Word has length 49 [2018-01-25 05:58:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 05:58:19,343 INFO L432 AbstractCegarLoop]: Abstraction has 222 states and 281 transitions. [2018-01-25 05:58:19,343 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 05:58:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 281 transitions. [2018-01-25 05:58:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-25 05:58:19,344 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 05:58:19,344 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 05:58:19,344 INFO L371 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr66EnsuresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr65RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr64RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-01-25 05:58:19,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2097549474, now seen corresponding path program 1 times [2018-01-25 05:58:19,344 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 05:58:19,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:19,345 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:58:19,345 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 05:58:19,345 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 05:58:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:58:19,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 05:58:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 05:58:19,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:58:19,932 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 05:58:19,933 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 50 with the following transitions: [2018-01-25 05:58:19,934 INFO L201 CegarAbsIntRunner]: [0], [4], [6], [9], [15], [17], [18], [19], [24], [26], [31], [32], [40], [41], [49], [50], [56], [57], [72], [73], [76], [78], [81], [88], [92], [94], [99], [198], [201], [202], [208], [214], [215], [216], [218], [219], [222], [231], [240], [248], [249], [253], [254], [255] [2018-01-25 05:58:19,979 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 05:58:19,979 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-25 05:59:00,421 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-25 05:59:00,422 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-25 05:59:00,423 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 05:59:00,423 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 05:59:00,423 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-25 05:59:00,429 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 05:59:00,429 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 05:59:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 05:59:00,485 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 05:59:00,493 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-25 05:59:00,494 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 05:59:00,500 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 05:59:00,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 05:59:00 BoogieIcfgContainer [2018-01-25 05:59:00,501 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 05:59:00,502 INFO L168 Benchmark]: Toolchain (without parser) took 51482.56 ms. Allocated memory was 301.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 258.4 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 627.9 MB. Max. memory is 5.3 GB. [2018-01-25 05:59:00,503 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 301.5 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 05:59:00,504 INFO L168 Benchmark]: CACSL2BoogieTranslator took 224.51 ms. Allocated memory is still 301.5 MB. Free memory was 258.4 MB in the beginning and 246.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:59:00,504 INFO L168 Benchmark]: Boogie Preprocessor took 39.60 ms. Allocated memory is still 301.5 MB. Free memory was 246.4 MB in the beginning and 244.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:59:00,504 INFO L168 Benchmark]: RCFGBuilder took 620.61 ms. Allocated memory is still 301.5 MB. Free memory was 244.4 MB in the beginning and 205.5 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:59:00,505 INFO L168 Benchmark]: TraceAbstraction took 50589.60 ms. Allocated memory was 301.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 205.5 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 575.0 MB. Max. memory is 5.3 GB. [2018-01-25 05:59:00,507 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.23 ms. Allocated memory is still 301.5 MB. Free memory is still 266.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 224.51 ms. Allocated memory is still 301.5 MB. Free memory was 258.4 MB in the beginning and 246.4 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.60 ms. Allocated memory is still 301.5 MB. Free memory was 246.4 MB in the beginning and 244.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 620.61 ms. Allocated memory is still 301.5 MB. Free memory was 244.4 MB in the beginning and 205.5 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 50589.60 ms. Allocated memory was 301.5 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 205.5 MB in the beginning and 1.6 GB in the end (delta: -1.4 GB). Peak memory consumption was 575.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 690). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 687). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 690). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 687). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 50 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 155 locations, 67 error locations. TIMEOUT Result, 50.5s OverallTime, 21 OverallIterations, 2 TraceHistogramMax, 5.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2554 SDtfs, 3780 SDslu, 4848 SDs, 0 SdLazy, 4212 SolverSat, 189 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 211 GetRequests, 41 SyntacticMatches, 11 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 40.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 970 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 604 NumberOfCodeBlocks, 604 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 122944 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 48/48 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_05-59-00-519.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_05-59-00-519.csv Completed graceful shutdown