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_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:21:57,769 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:21:57,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:21:57,789 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:21:57,790 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:21:57,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:21:57,792 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:21:57,794 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:21:57,796 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:21:57,797 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:21:57,797 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:21:57,797 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:21:57,798 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:21:57,799 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:21:57,800 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:21:57,803 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:21:57,805 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:21:57,807 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:21:57,808 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:21:57,809 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:21:57,812 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:21:57,812 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:21:57,813 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:21:57,820 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:21:57,821 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:21:57,822 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:21:57,822 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:21:57,823 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:21:57,823 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:21:57,823 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:21:57,824 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:21:57,824 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_preciseopt.epf [2018-01-25 03:21:57,835 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:21:57,835 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:21:57,836 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:21:57,836 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:21:57,836 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:21:57,836 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:21:57,837 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:21:57,837 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:21:57,837 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:21:57,838 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:21:57,838 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:21:57,838 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:21:57,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:21:57,838 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:21:57,839 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:21:57,839 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:21:57,839 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:21:57,839 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:21:57,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:21:57,839 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:21:57,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:21:57,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:21:57,840 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:21:57,840 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:21:57,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:21:57,841 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:21:57,841 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:21:57,841 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:21:57,841 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:21:57,841 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:21:57,842 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:21:57,842 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:21:57,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:21:57,842 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:21:57,842 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:21:57,843 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:21:57,843 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:21:57,875 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:21:57,886 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:21:57,890 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:21:57,891 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:21:57,891 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:21:57,892 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-01-25 03:21:58,034 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:21:58,041 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:21:58,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:21:58,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:21:58,049 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:21:58,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:21:58" (1/1) ... [2018-01-25 03:21:58,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d10e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:21:58, skipping insertion in model container [2018-01-25 03:21:58,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:21:58" (1/1) ... [2018-01-25 03:21:58,073 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:21:58,092 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:21:58,224 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:21:58,241 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:21:58,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:21:58 WrapperNode [2018-01-25 03:21:58,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:21:58,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:21:58,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:21:58,252 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:21:58,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:21:58" (1/1) ... [2018-01-25 03:21:58,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:21:58" (1/1) ... [2018-01-25 03:21:58,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:21:58" (1/1) ... [2018-01-25 03:21:58,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:21:58" (1/1) ... [2018-01-25 03:21:58,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:21:58" (1/1) ... [2018-01-25 03:21:58,290 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:21:58" (1/1) ... [2018-01-25 03:21:58,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:21:58" (1/1) ... [2018-01-25 03:21:58,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:21:58,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:21:58,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:21:58,295 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:21:58,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:21:58" (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 03:21:58,347 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:21:58,347 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:21:58,347 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-25 03:21:58,348 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:21:58,348 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:21:58,348 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:21:58,348 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:21:58,348 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:21:58,348 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:21:58,349 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-25 03:21:58,349 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:21:58,349 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:21:58,349 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:21:58,568 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:21:58,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:21:58 BoogieIcfgContainer [2018-01-25 03:21:58,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:21:58,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:21:58,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:21:58,571 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:21:58,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:21:58" (1/3) ... [2018-01-25 03:21:58,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc47f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:21:58, skipping insertion in model container [2018-01-25 03:21:58,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:21:58" (2/3) ... [2018-01-25 03:21:58,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc47f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:21:58, skipping insertion in model container [2018-01-25 03:21:58,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:21:58" (3/3) ... [2018-01-25 03:21:58,575 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysWithLenghtAtDeclaration_false-valid-deref-read.c [2018-01-25 03:21:58,582 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:21:58,588 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2018-01-25 03:21:58,637 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:21:58,637 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:21:58,637 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:21:58,637 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:21:58,637 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:21:58,638 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:21:58,638 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:21:58,638 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:21:58,639 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:21:58,663 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-01-25 03:21:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-25 03:21:58,669 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:21:58,670 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:21:58,671 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:21:58,677 INFO L82 PathProgramCache]: Analyzing trace with hash -215054890, now seen corresponding path program 1 times [2018-01-25 03:21:58,680 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:21:58,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:21:58,731 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:21:58,731 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:21:58,732 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:21:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:21:58,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:21:58,931 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 03:21:58,934 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:21:58,934 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:21:58,935 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:21:58,938 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:21:58,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:21:58,954 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:21:58,957 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-01-25 03:21:59,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:21:59,028 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-01-25 03:21:59,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:21:59,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-25 03:21:59,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:21:59,041 INFO L225 Difference]: With dead ends: 101 [2018-01-25 03:21:59,041 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 03:21:59,044 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 03:21:59,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 03:21:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 49. [2018-01-25 03:21:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-25 03:21:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-01-25 03:21:59,261 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2018-01-25 03:21:59,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:21:59,261 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-01-25 03:21:59,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:21:59,261 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-01-25 03:21:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-01-25 03:21:59,262 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:21:59,262 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:21:59,262 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:21:59,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1100032001, now seen corresponding path program 1 times [2018-01-25 03:21:59,263 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:21:59,263 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:21:59,264 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:21:59,264 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:21:59,264 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:21:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:21:59,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:21:59,391 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 03:21:59,392 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:21:59,392 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:21:59,392 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:21:59,394 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:21:59,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:21:59,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:21:59,395 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 6 states. [2018-01-25 03:21:59,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:21:59,691 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2018-01-25 03:21:59,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:21:59,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-01-25 03:21:59,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:21:59,697 INFO L225 Difference]: With dead ends: 129 [2018-01-25 03:21:59,697 INFO L226 Difference]: Without dead ends: 91 [2018-01-25 03:21:59,698 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:21:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-01-25 03:21:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 66. [2018-01-25 03:21:59,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-25 03:21:59,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-01-25 03:21:59,714 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 16 [2018-01-25 03:21:59,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:21:59,714 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-01-25 03:21:59,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:21:59,715 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-01-25 03:21:59,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:21:59,715 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:21:59,716 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:21:59,716 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:21:59,716 INFO L82 PathProgramCache]: Analyzing trace with hash -258746290, now seen corresponding path program 1 times [2018-01-25 03:21:59,716 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:21:59,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:21:59,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:21:59,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:21:59,718 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:21:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:21:59,741 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:21:59,951 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 03:21:59,952 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:21:59,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:21:59,952 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:21:59,952 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:21:59,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:21:59,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:21:59,953 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 5 states. [2018-01-25 03:22:00,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:00,186 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2018-01-25 03:22:00,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:22:00,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 03:22:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:00,192 INFO L225 Difference]: With dead ends: 77 [2018-01-25 03:22:00,192 INFO L226 Difference]: Without dead ends: 76 [2018-01-25 03:22:00,193 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:22:00,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-25 03:22:00,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2018-01-25 03:22:00,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-01-25 03:22:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2018-01-25 03:22:00,211 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 17 [2018-01-25 03:22:00,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:00,212 INFO L432 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2018-01-25 03:22:00,212 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:22:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2018-01-25 03:22:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:22:00,213 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:00,213 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:00,214 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:00,215 INFO L82 PathProgramCache]: Analyzing trace with hash -258746291, now seen corresponding path program 1 times [2018-01-25 03:22:00,215 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:00,216 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:00,216 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:00,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:00,217 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:00,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:00,275 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 03:22:00,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:22:00,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:22:00,276 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:22:00,276 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:22:00,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:22:00,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:22:00,277 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand 5 states. [2018-01-25 03:22:00,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:00,386 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-01-25 03:22:00,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:22:00,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-01-25 03:22:00,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:00,390 INFO L225 Difference]: With dead ends: 68 [2018-01-25 03:22:00,390 INFO L226 Difference]: Without dead ends: 67 [2018-01-25 03:22:00,390 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:22:00,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-25 03:22:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-01-25 03:22:00,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-25 03:22:00,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2018-01-25 03:22:00,403 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 17 [2018-01-25 03:22:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:00,404 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2018-01-25 03:22:00,404 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:22:00,404 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2018-01-25 03:22:00,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:22:00,405 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:00,405 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:00,405 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:00,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1933852231, now seen corresponding path program 1 times [2018-01-25 03:22:00,405 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:00,406 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:00,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:00,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:00,407 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:00,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:00,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:00,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:00,567 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:00,568 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-01-25 03:22:00,570 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [12], [13], [14], [17], [19], [28], [29], [30], [34], [39], [41], [79], [80], [81], [83] [2018-01-25 03:22:00,616 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:22:00,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:22:01,224 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:22:01,225 INFO L268 AbstractInterpreter]: Visited 20 different actions 27 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-25 03:22:01,263 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:22:01,263 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:01,263 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 03:22:01,284 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:01,284 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:01,331 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:01,540 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:01,699 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:01,700 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:01,705 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:01,705 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:01,728 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:01,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:01,732 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:01,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:01,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:01,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3, 3, 3] total 10 [2018-01-25 03:22:01,747 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:01,747 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:22:01,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:22:01,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:22:01,748 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 9 states. [2018-01-25 03:22:01,990 WARN L143 SmtUtils]: Spent 140ms on a formula simplification that was a NOOP. DAG size: 16 [2018-01-25 03:22:02,381 WARN L146 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 21 DAG size of output 19 [2018-01-25 03:22:02,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:02,466 INFO L93 Difference]: Finished difference Result 107 states and 125 transitions. [2018-01-25 03:22:02,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:22:02,467 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-01-25 03:22:02,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:02,468 INFO L225 Difference]: With dead ends: 107 [2018-01-25 03:22:02,468 INFO L226 Difference]: Without dead ends: 105 [2018-01-25 03:22:02,469 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-01-25 03:22:02,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-25 03:22:02,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 90. [2018-01-25 03:22:02,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-25 03:22:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2018-01-25 03:22:02,486 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 22 [2018-01-25 03:22:02,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:02,486 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2018-01-25 03:22:02,486 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:22:02,486 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2018-01-25 03:22:02,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 03:22:02,487 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:02,487 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] [2018-01-25 03:22:02,487 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:02,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1693854175, now seen corresponding path program 1 times [2018-01-25 03:22:02,488 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:02,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:02,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:02,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:02,489 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:02,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:02,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:02,641 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:02,641 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-01-25 03:22:02,641 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [39], [40], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-25 03:22:02,643 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:22:02,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:22:05,171 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:22:05,172 INFO L268 AbstractInterpreter]: Visited 26 different actions 96 times. Merged at 16 different actions 45 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-25 03:22:05,185 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:22:05,186 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:05,186 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:05,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:05,204 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:05,244 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:05,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:05,443 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:05,629 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:05,629 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:05,635 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:05,635 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:05,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 03:22:05,697 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:05,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 03:22:05,789 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 3 imperfect interpolant sequences. [2018-01-25 03:22:05,789 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [6, 6, 6] total 16 [2018-01-25 03:22:05,789 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:22:05,790 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:22:05,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:22:05,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:22:05,791 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand 5 states. [2018-01-25 03:22:05,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:05,980 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2018-01-25 03:22:05,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:22:05,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-25 03:22:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:05,985 INFO L225 Difference]: With dead ends: 101 [2018-01-25 03:22:05,985 INFO L226 Difference]: Without dead ends: 99 [2018-01-25 03:22:05,986 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 102 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:22:05,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-25 03:22:06,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 87. [2018-01-25 03:22:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-01-25 03:22:06,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2018-01-25 03:22:06,012 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 29 [2018-01-25 03:22:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:06,012 INFO L432 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2018-01-25 03:22:06,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:22:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2018-01-25 03:22:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-25 03:22:06,014 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:06,014 INFO L322 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:06,014 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:06,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2013598170, now seen corresponding path program 1 times [2018-01-25 03:22:06,014 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:06,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:06,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:06,016 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:06,016 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:06,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-25 03:22:06,546 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:22:06,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:22:06,547 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:22:06,547 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:22:06,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:22:06,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:22:06,547 INFO L87 Difference]: Start difference. First operand 87 states and 97 transitions. Second operand 9 states. [2018-01-25 03:22:06,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:06,759 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2018-01-25 03:22:06,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:22:06,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2018-01-25 03:22:06,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:06,760 INFO L225 Difference]: With dead ends: 147 [2018-01-25 03:22:06,761 INFO L226 Difference]: Without dead ends: 87 [2018-01-25 03:22:06,761 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:22:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-01-25 03:22:06,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2018-01-25 03:22:06,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-25 03:22:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2018-01-25 03:22:06,767 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 35 [2018-01-25 03:22:06,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:06,768 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2018-01-25 03:22:06,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:22:06,768 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2018-01-25 03:22:06,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 03:22:06,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:06,769 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:06,769 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:06,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1643098334, now seen corresponding path program 1 times [2018-01-25 03:22:06,769 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:06,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:06,770 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:06,770 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:06,770 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:06,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:06,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:06,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:06,878 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:06,879 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-01-25 03:22:06,879 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [17], [19], [23], [24], [28], [29], [30], [34], [37], [39], [41], [43], [45], [49], [53], [58], [60], [63], [65], [66], [67], [78], [79], [80], [81], [83], [84] [2018-01-25 03:22:06,880 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:22:06,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:22:08,930 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:22:08,930 INFO L268 AbstractInterpreter]: Visited 35 different actions 123 times. Merged at 25 different actions 62 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-25 03:22:08,987 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:22:08,987 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:08,988 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:09,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:09,007 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:09,032 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:09,324 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:22:09,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:09,511 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:09,515 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:09,515 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:09,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 03:22:09,558 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 03:22:09,589 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:09,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 4, 4] total 16 [2018-01-25 03:22:09,589 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:09,590 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:22:09,590 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:22:09,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-01-25 03:22:09,590 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 10 states. [2018-01-25 03:22:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:09,783 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2018-01-25 03:22:09,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:22:09,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-25 03:22:09,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:09,784 INFO L225 Difference]: With dead ends: 147 [2018-01-25 03:22:09,784 INFO L226 Difference]: Without dead ends: 89 [2018-01-25 03:22:09,785 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 135 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:22:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-25 03:22:09,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2018-01-25 03:22:09,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-01-25 03:22:09,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2018-01-25 03:22:09,793 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 37 [2018-01-25 03:22:09,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:09,793 INFO L432 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2018-01-25 03:22:09,793 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:22:09,794 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2018-01-25 03:22:09,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-25 03:22:09,795 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:09,795 INFO L322 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:09,795 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:09,795 INFO L82 PathProgramCache]: Analyzing trace with hash 833411622, now seen corresponding path program 2 times [2018-01-25 03:22:09,796 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:09,796 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:09,797 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:09,797 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:09,797 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:09,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:09,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 03:22:09,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:09,852 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:09,852 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:22:09,852 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:22:09,852 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:09,853 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:09,859 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 03:22:09,859 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 03:22:09,871 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:09,873 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:09,876 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:09,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-25 03:22:09,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-01-25 03:22:09,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:22:09,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-25 03:22:09,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-25 03:22:10,004 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_~#mask~3.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |main_~#mask~3.base| 0)) (= 0 (select |c_old(#valid)| |main_~#mask~3.base|)))) is different from true [2018-01-25 03:22:10,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-25 03:22:10,011 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:10,093 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_~#mask~3.base_15| Int)) (or (= (store |c_#valid| |v_main_~#mask~3.base_15| 0) |c_old(#valid)|) (not (= (select |c_#valid| |v_main_~#mask~3.base_15|) 0)))) is different from false [2018-01-25 03:22:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-01-25 03:22:10,126 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 03:22:10,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [4] total 10 [2018-01-25 03:22:10,127 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:22:10,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:22:10,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:22:10,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=42, Unknown=2, NotChecked=26, Total=90 [2018-01-25 03:22:10,127 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand 6 states. [2018-01-25 03:22:10,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:10,218 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-01-25 03:22:10,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:22:10,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2018-01-25 03:22:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:10,219 INFO L225 Difference]: With dead ends: 80 [2018-01-25 03:22:10,219 INFO L226 Difference]: Without dead ends: 63 [2018-01-25 03:22:10,220 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=69, Unknown=2, NotChecked=34, Total=132 [2018-01-25 03:22:10,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-25 03:22:10,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-25 03:22:10,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-25 03:22:10,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-01-25 03:22:10,228 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 43 [2018-01-25 03:22:10,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:10,229 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-01-25 03:22:10,229 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:22:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-01-25 03:22:10,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-01-25 03:22:10,231 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:10,231 INFO L322 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:10,232 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:10,232 INFO L82 PathProgramCache]: Analyzing trace with hash 98230391, now seen corresponding path program 1 times [2018-01-25 03:22:10,232 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:10,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:10,233 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 03:22:10,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:10,234 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:10,254 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 73 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 03:22:10,511 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:10,511 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:10,511 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 60 with the following transitions: [2018-01-25 03:22:10,511 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [14], [16], [17], [19], [23], [24], [28], [29], [30], [34], [39], [41], [43], [45], [79], [80], [81], [83], [84] [2018-01-25 03:22:10,512 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:22:10,513 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 03:22:11,488 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 03:22:11,489 INFO L268 AbstractInterpreter]: Visited 26 different actions 99 times. Merged at 16 different actions 46 times. Never widened. Found 7 fixpoints after 3 different actions. Largest state had 21 variables. [2018-01-25 03:22:11,513 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 03:22:11,513 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:11,513 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:11,532 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:11,532 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:11,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:11,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 03:22:11,681 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:11,847 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 03:22:11,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:11,874 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:11,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:11,878 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:11,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 03:22:11,993 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 83 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-01-25 03:22:12,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:12,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9, 9, 9] total 22 [2018-01-25 03:22:12,090 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:12,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 03:22:12,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 03:22:12,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2018-01-25 03:22:12,091 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 18 states. [2018-01-25 03:22:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:12,496 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2018-01-25 03:22:12,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 03:22:12,496 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-01-25 03:22:12,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:12,497 INFO L225 Difference]: With dead ends: 131 [2018-01-25 03:22:12,497 INFO L226 Difference]: Without dead ends: 98 [2018-01-25 03:22:12,498 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 218 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2018-01-25 03:22:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-01-25 03:22:12,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 93. [2018-01-25 03:22:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 03:22:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 96 transitions. [2018-01-25 03:22:12,508 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 96 transitions. Word has length 59 [2018-01-25 03:22:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:12,509 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 96 transitions. [2018-01-25 03:22:12,513 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 03:22:12,513 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 96 transitions. [2018-01-25 03:22:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-01-25 03:22:12,519 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:12,519 INFO L322 BasicCegarLoop]: trace histogram [10, 8, 8, 7, 7, 7, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:12,519 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:12,519 INFO L82 PathProgramCache]: Analyzing trace with hash 315437000, now seen corresponding path program 2 times [2018-01-25 03:22:12,519 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:12,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:12,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:12,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:12,521 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:12,548 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 125 proven. 68 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-01-25 03:22:13,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:13,222 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:13,222 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:22:13,222 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:22:13,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:13,222 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:13,229 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 03:22:13,230 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 03:22:13,240 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:13,252 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:13,254 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:13,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:13,461 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 157 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-25 03:22:13,461 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:13,633 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 157 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-25 03:22:13,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:13,669 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:13,672 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 03:22:13,672 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 03:22:13,687 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:13,721 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:13,745 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:13,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:13,762 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 157 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-25 03:22:13,762 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 157 proven. 10 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-01-25 03:22:13,865 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:13,866 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 8, 8, 8] total 23 [2018-01-25 03:22:13,866 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:13,866 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 03:22:13,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 03:22:13,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-01-25 03:22:13,867 INFO L87 Difference]: Start difference. First operand 93 states and 96 transitions. Second operand 20 states. [2018-01-25 03:22:14,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:14,291 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2018-01-25 03:22:14,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 03:22:14,291 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 83 [2018-01-25 03:22:14,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:14,292 INFO L225 Difference]: With dead ends: 136 [2018-01-25 03:22:14,292 INFO L226 Difference]: Without dead ends: 97 [2018-01-25 03:22:14,293 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 315 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2018-01-25 03:22:14,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-01-25 03:22:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2018-01-25 03:22:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-01-25 03:22:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-01-25 03:22:14,302 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 83 [2018-01-25 03:22:14,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:14,303 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-01-25 03:22:14,303 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 03:22:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-01-25 03:22:14,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-01-25 03:22:14,304 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:14,305 INFO L322 BasicCegarLoop]: trace histogram [11, 9, 9, 8, 8, 8, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:14,305 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:14,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1642738256, now seen corresponding path program 3 times [2018-01-25 03:22:14,305 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:14,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:14,306 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 03:22:14,306 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:14,306 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:14,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:14,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 138 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-01-25 03:22:14,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:14,824 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:14,824 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:22:14,824 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:22:14,824 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:14,824 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:14,830 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 03:22:14,830 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 03:22:14,841 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:14,847 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:14,857 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:14,859 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:14,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:14,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 03:22:14,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:22:14,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:22:14,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 03:22:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 138 proven. 20 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-01-25 03:22:15,326 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 128 proven. 30 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-01-25 03:22:15,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:15,537 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:15,541 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 03:22:15,541 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 03:22:15,555 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:15,565 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:15,586 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:15,598 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:15,605 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:15,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 03:22:15,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:22:15,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:22:15,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 03:22:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 148 proven. 20 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-01-25 03:22:15,756 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 130 proven. 38 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-01-25 03:22:16,012 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:16,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10, 12, 11] total 38 [2018-01-25 03:22:16,013 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:16,013 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 03:22:16,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 03:22:16,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1236, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 03:22:16,014 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 21 states. [2018-01-25 03:22:16,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:16,180 INFO L93 Difference]: Finished difference Result 128 states and 130 transitions. [2018-01-25 03:22:16,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-25 03:22:16,180 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 89 [2018-01-25 03:22:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:16,181 INFO L225 Difference]: With dead ends: 128 [2018-01-25 03:22:16,181 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 03:22:16,182 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 320 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=304, Invalid=1418, Unknown=0, NotChecked=0, Total=1722 [2018-01-25 03:22:16,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 03:22:16,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 123. [2018-01-25 03:22:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 03:22:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2018-01-25 03:22:16,192 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 89 [2018-01-25 03:22:16,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:16,193 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2018-01-25 03:22:16,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 03:22:16,193 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-01-25 03:22:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-01-25 03:22:16,195 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:16,195 INFO L322 BasicCegarLoop]: trace histogram [15, 12, 12, 11, 11, 11, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:16,195 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:16,196 INFO L82 PathProgramCache]: Analyzing trace with hash -630750615, now seen corresponding path program 4 times [2018-01-25 03:22:16,196 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:16,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:16,198 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 03:22:16,198 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:16,198 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:16,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:16,556 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 325 proven. 125 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-01-25 03:22:16,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:16,557 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:16,557 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:22:16,557 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:22:16,557 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:16,557 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:16,563 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 03:22:16,563 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 03:22:16,594 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:16,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 355 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-25 03:22:16,700 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 355 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-25 03:22:16,973 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:16,973 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:16,977 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 03:22:16,977 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 03:22:17,044 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:17,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:17,074 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 355 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-25 03:22:17,074 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:17,195 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 355 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-01-25 03:22:17,197 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:17,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 10, 10, 10] total 25 [2018-01-25 03:22:17,197 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:17,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-25 03:22:17,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-25 03:22:17,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2018-01-25 03:22:17,198 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand 21 states. [2018-01-25 03:22:17,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:17,688 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2018-01-25 03:22:17,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-01-25 03:22:17,689 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-01-25 03:22:17,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:17,690 INFO L225 Difference]: With dead ends: 181 [2018-01-25 03:22:17,690 INFO L226 Difference]: Without dead ends: 142 [2018-01-25 03:22:17,690 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 459 SyntacticMatches, 10 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=1131, Unknown=0, NotChecked=0, Total=1406 [2018-01-25 03:22:17,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-01-25 03:22:17,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2018-01-25 03:22:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-01-25 03:22:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-01-25 03:22:17,705 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 119 [2018-01-25 03:22:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:17,705 INFO L432 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-01-25 03:22:17,705 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-25 03:22:17,705 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-01-25 03:22:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-01-25 03:22:17,707 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:17,707 INFO L322 BasicCegarLoop]: trace histogram [16, 13, 13, 12, 12, 12, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:17,708 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1849014223, now seen corresponding path program 5 times [2018-01-25 03:22:17,708 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:17,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:17,709 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 03:22:17,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:17,710 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:17,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:17,733 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 03:22:18,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:18,160 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:18,161 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:22:18,161 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:22:18,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:18,161 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-01-25 03:22:18,176 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 03:22:18,177 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:18,192 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:18,198 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:18,215 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:18,230 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:18,249 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:18,270 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:18,284 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:18,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:18,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 03:22:18,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:22:18,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:22:18,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 03:22:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 03:22:18,512 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:18,635 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 03:22:18,662 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:18,662 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:18,665 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 03:22:18,666 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 03:22:18,679 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:18,688 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:18,706 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:18,735 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:18,788 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:18,940 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:18,963 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:18,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:18,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 03:22:18,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:22:18,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:22:18,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 03:22:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 03:22:19,081 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 573 backedges. 225 proven. 30 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 03:22:19,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:19,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7, 8, 7] total 18 [2018-01-25 03:22:19,139 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:19,140 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 03:22:19,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 03:22:19,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-01-25 03:22:19,140 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 13 states. [2018-01-25 03:22:19,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:19,619 INFO L93 Difference]: Finished difference Result 142 states and 144 transitions. [2018-01-25 03:22:19,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:22:19,619 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 125 [2018-01-25 03:22:19,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:19,621 INFO L225 Difference]: With dead ends: 142 [2018-01-25 03:22:19,621 INFO L226 Difference]: Without dead ends: 141 [2018-01-25 03:22:19,621 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 474 SyntacticMatches, 15 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2018-01-25 03:22:19,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-01-25 03:22:19,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2018-01-25 03:22:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-01-25 03:22:19,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-01-25 03:22:19,635 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 125 [2018-01-25 03:22:19,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:19,636 INFO L432 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-01-25 03:22:19,636 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 03:22:19,636 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-01-25 03:22:19,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-01-25 03:22:19,637 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:19,638 INFO L322 BasicCegarLoop]: trace histogram [17, 14, 14, 13, 13, 13, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:19,638 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:19,638 INFO L82 PathProgramCache]: Analyzing trace with hash 659173177, now seen corresponding path program 6 times [2018-01-25 03:22:19,638 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:19,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:19,639 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 03:22:19,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:19,639 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:19,659 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 285 proven. 52 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 03:22:20,154 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:20,154 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:20,155 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:22:20,155 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:22:20,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:20,155 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:20,160 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 03:22:20,160 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 03:22:20,172 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 03:22:20,184 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 03:22:20,196 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 03:22:20,214 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 03:22:20,226 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 03:22:20,233 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 03:22:20,235 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:20,238 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:20,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 03:22:20,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:22:20,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:22:20,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 03:22:20,638 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 349 proven. 174 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-01-25 03:22:20,638 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 319 proven. 204 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-01-25 03:22:21,070 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:21,070 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:21,073 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-25 03:22:21,073 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-01-25 03:22:21,087 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 03:22:21,097 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 03:22:21,114 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 03:22:21,144 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 03:22:21,187 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 03:22:21,279 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-25 03:22:21,301 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:21,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:21,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 03:22:21,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:22:21,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:22:21,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 03:22:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 285 proven. 52 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 03:22:21,532 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 285 proven. 52 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2018-01-25 03:22:21,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:21,691 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 15, 9, 8] total 48 [2018-01-25 03:22:21,691 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:21,691 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-25 03:22:21,691 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-25 03:22:21,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2083, Unknown=0, NotChecked=0, Total=2352 [2018-01-25 03:22:21,692 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 25 states. [2018-01-25 03:22:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:22,664 INFO L93 Difference]: Finished difference Result 208 states and 217 transitions. [2018-01-25 03:22:22,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 03:22:22,664 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 131 [2018-01-25 03:22:22,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:22,666 INFO L225 Difference]: With dead ends: 208 [2018-01-25 03:22:22,666 INFO L226 Difference]: Without dead ends: 207 [2018-01-25 03:22:22,667 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 471 SyntacticMatches, 13 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=842, Invalid=3988, Unknown=0, NotChecked=0, Total=4830 [2018-01-25 03:22:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-01-25 03:22:22,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 195. [2018-01-25 03:22:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-01-25 03:22:22,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 202 transitions. [2018-01-25 03:22:22,683 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 202 transitions. Word has length 131 [2018-01-25 03:22:22,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:22,683 INFO L432 AbstractCegarLoop]: Abstraction has 195 states and 202 transitions. [2018-01-25 03:22:22,683 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-25 03:22:22,684 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 202 transitions. [2018-01-25 03:22:22,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-01-25 03:22:22,687 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:22,687 INFO L322 BasicCegarLoop]: trace histogram [19, 16, 16, 15, 15, 15, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:22,687 INFO L371 AbstractCegarLoop]: === Iteration 16 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:22,687 INFO L82 PathProgramCache]: Analyzing trace with hash -177564663, now seen corresponding path program 7 times [2018-01-25 03:22:22,687 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:22,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:22,688 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 03:22:22,688 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:22,689 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:22,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:23,082 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 379 proven. 80 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-01-25 03:22:23,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:23,083 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:23,083 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:22:23,083 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:22:23,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:23,083 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:23,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:23,089 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:23,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:23,283 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 629 proven. 40 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-25 03:22:23,284 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 655 proven. 14 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-25 03:22:23,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:23,654 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 22 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:23,657 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:23,657 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 03:22:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:23,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:23,777 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 629 proven. 40 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-25 03:22:23,777 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:23,903 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 655 proven. 14 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-01-25 03:22:23,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:23,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11, 11, 11] total 25 [2018-01-25 03:22:23,905 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:23,905 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-01-25 03:22:23,905 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-01-25 03:22:23,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2018-01-25 03:22:23,906 INFO L87 Difference]: Start difference. First operand 195 states and 202 transitions. Second operand 20 states. [2018-01-25 03:22:24,423 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 29 DAG size of output 23 [2018-01-25 03:22:24,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:24,563 INFO L93 Difference]: Finished difference Result 324 states and 340 transitions. [2018-01-25 03:22:24,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-25 03:22:24,563 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 143 [2018-01-25 03:22:24,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:24,565 INFO L225 Difference]: With dead ends: 324 [2018-01-25 03:22:24,565 INFO L226 Difference]: Without dead ends: 212 [2018-01-25 03:22:24,566 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 548 SyntacticMatches, 10 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=1021, Unknown=0, NotChecked=0, Total=1260 [2018-01-25 03:22:24,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-01-25 03:22:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 192. [2018-01-25 03:22:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-01-25 03:22:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 198 transitions. [2018-01-25 03:22:24,585 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 198 transitions. Word has length 143 [2018-01-25 03:22:24,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:24,585 INFO L432 AbstractCegarLoop]: Abstraction has 192 states and 198 transitions. [2018-01-25 03:22:24,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-01-25 03:22:24,585 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 198 transitions. [2018-01-25 03:22:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-01-25 03:22:24,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:24,588 INFO L322 BasicCegarLoop]: trace histogram [25, 21, 21, 20, 20, 20, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:24,588 INFO L371 AbstractCegarLoop]: === Iteration 17 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:24,588 INFO L82 PathProgramCache]: Analyzing trace with hash 267706226, now seen corresponding path program 8 times [2018-01-25 03:22:24,588 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:24,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:24,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:22:24,590 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:24,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:24,617 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:25,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 712 proven. 74 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-25 03:22:25,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:25,008 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:25,008 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:22:25,008 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:22:25,008 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:25,008 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:25,016 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 03:22:25,016 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 03:22:25,032 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:25,055 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:25,059 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:25,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:25,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 734 proven. 52 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-25 03:22:25,242 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 734 proven. 52 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-25 03:22:25,460 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:25,460 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 24 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:25,463 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-25 03:22:25,463 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 03:22:25,481 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:25,523 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:25,552 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:25,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 734 proven. 52 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-25 03:22:25,597 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 734 proven. 52 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2018-01-25 03:22:25,702 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:25,703 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15, 15, 15] total 37 [2018-01-25 03:22:25,703 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:25,703 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-25 03:22:25,703 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-25 03:22:25,704 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1101, Unknown=0, NotChecked=0, Total=1332 [2018-01-25 03:22:25,704 INFO L87 Difference]: Start difference. First operand 192 states and 198 transitions. Second operand 30 states. [2018-01-25 03:22:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:26,098 INFO L93 Difference]: Finished difference Result 403 states and 428 transitions. [2018-01-25 03:22:26,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-01-25 03:22:26,098 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 185 [2018-01-25 03:22:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:26,100 INFO L225 Difference]: With dead ends: 403 [2018-01-25 03:22:26,100 INFO L226 Difference]: Without dead ends: 307 [2018-01-25 03:22:26,101 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 707 SyntacticMatches, 13 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=493, Invalid=1763, Unknown=0, NotChecked=0, Total=2256 [2018-01-25 03:22:26,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-01-25 03:22:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 297. [2018-01-25 03:22:26,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-01-25 03:22:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 310 transitions. [2018-01-25 03:22:26,122 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 310 transitions. Word has length 185 [2018-01-25 03:22:26,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:26,123 INFO L432 AbstractCegarLoop]: Abstraction has 297 states and 310 transitions. [2018-01-25 03:22:26,123 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-25 03:22:26,123 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 310 transitions. [2018-01-25 03:22:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-01-25 03:22:26,125 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:26,125 INFO L322 BasicCegarLoop]: trace histogram [30, 25, 25, 24, 24, 24, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:26,125 INFO L371 AbstractCegarLoop]: === Iteration 18 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:26,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1222792877, now seen corresponding path program 9 times [2018-01-25 03:22:26,125 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:26,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:26,126 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 03:22:26,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:26,126 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:26,145 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 1261 proven. 413 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2018-01-25 03:22:26,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:26,689 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:26,689 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:22:26,689 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:22:26,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:26,689 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:26,694 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 03:22:26,694 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 03:22:26,709 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:26,713 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:26,718 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:26,724 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:26,732 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:26,743 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:26,745 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:26,752 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:26,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 03:22:26,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:22:26,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:22:26,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 03:22:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 817 proven. 92 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2018-01-25 03:22:27,940 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 795 proven. 114 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2018-01-25 03:22:28,683 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:28,683 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 26 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:28,686 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-25 03:22:28,687 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-25 03:22:28,709 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:28,719 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:28,741 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:28,781 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:28,858 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:29,003 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-25 03:22:29,031 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:29,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:29,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-25 03:22:29,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 03:22:29,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 03:22:29,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-25 03:22:29,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 883 proven. 92 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2018-01-25 03:22:29,510 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 819 proven. 156 refuted. 0 times theorem prover too weak. 1172 trivial. 0 not checked. [2018-01-25 03:22:30,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:30,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 13, 17, 16] total 61 [2018-01-25 03:22:30,297 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:30,298 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-25 03:22:30,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-25 03:22:30,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=3267, Unknown=0, NotChecked=0, Total=3660 [2018-01-25 03:22:30,299 INFO L87 Difference]: Start difference. First operand 297 states and 310 transitions. Second operand 33 states. [2018-01-25 03:22:33,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:33,521 INFO L93 Difference]: Finished difference Result 461 states and 483 transitions. [2018-01-25 03:22:33,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-01-25 03:22:33,521 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 221 [2018-01-25 03:22:33,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:33,523 INFO L225 Difference]: With dead ends: 461 [2018-01-25 03:22:33,523 INFO L226 Difference]: Without dead ends: 350 [2018-01-25 03:22:33,525 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 952 GetRequests, 825 SyntacticMatches, 19 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4054 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1685, Invalid=10305, Unknown=0, NotChecked=0, Total=11990 [2018-01-25 03:22:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-01-25 03:22:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 342. [2018-01-25 03:22:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-01-25 03:22:33,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 349 transitions. [2018-01-25 03:22:33,556 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 349 transitions. Word has length 221 [2018-01-25 03:22:33,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:33,557 INFO L432 AbstractCegarLoop]: Abstraction has 342 states and 349 transitions. [2018-01-25 03:22:33,557 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-25 03:22:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 349 transitions. [2018-01-25 03:22:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-01-25 03:22:33,559 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:33,559 INFO L322 BasicCegarLoop]: trace histogram [38, 32, 32, 31, 31, 31, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:33,559 INFO L371 AbstractCegarLoop]: === Iteration 19 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:33,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1481262388, now seen corresponding path program 10 times [2018-01-25 03:22:33,559 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:33,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:33,560 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 03:22:33,560 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:33,560 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:33,592 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:34,283 WARN L146 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 17 DAG size of output 16 [2018-01-25 03:22:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 1886 proven. 677 refuted. 0 times theorem prover too weak. 945 trivial. 0 not checked. [2018-01-25 03:22:34,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:34,394 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:34,394 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:22:34,394 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:22:34,394 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:34,394 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:34,399 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 03:22:34,399 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 03:22:34,452 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:34,456 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:34,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 2081 proven. 44 refuted. 0 times theorem prover too weak. 1383 trivial. 0 not checked. [2018-01-25 03:22:34,641 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 1459 proven. 382 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2018-01-25 03:22:34,869 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:34,869 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 28 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:34,872 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-25 03:22:34,872 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-01-25 03:22:34,977 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:34,987 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:35,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 2081 proven. 44 refuted. 0 times theorem prover too weak. 1383 trivial. 0 not checked. [2018-01-25 03:22:35,037 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3508 backedges. 1459 proven. 382 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2018-01-25 03:22:35,254 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:35,254 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12, 12, 12] total 34 [2018-01-25 03:22:35,254 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:35,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-01-25 03:22:35,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-01-25 03:22:35,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=948, Unknown=0, NotChecked=0, Total=1122 [2018-01-25 03:22:35,255 INFO L87 Difference]: Start difference. First operand 342 states and 349 transitions. Second operand 29 states. [2018-01-25 03:22:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:22:36,325 INFO L93 Difference]: Finished difference Result 498 states and 506 transitions. [2018-01-25 03:22:36,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 03:22:36,326 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 275 [2018-01-25 03:22:36,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:22:36,327 INFO L225 Difference]: With dead ends: 498 [2018-01-25 03:22:36,327 INFO L226 Difference]: Without dead ends: 285 [2018-01-25 03:22:36,328 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 1138 GetRequests, 1075 SyntacticMatches, 12 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1007 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=424, Invalid=2332, Unknown=0, NotChecked=0, Total=2756 [2018-01-25 03:22:36,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-01-25 03:22:36,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-01-25 03:22:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-01-25 03:22:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 287 transitions. [2018-01-25 03:22:36,349 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 287 transitions. Word has length 275 [2018-01-25 03:22:36,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:22:36,349 INFO L432 AbstractCegarLoop]: Abstraction has 285 states and 287 transitions. [2018-01-25 03:22:36,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-01-25 03:22:36,349 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 287 transitions. [2018-01-25 03:22:36,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-01-25 03:22:36,350 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:22:36,350 INFO L322 BasicCegarLoop]: trace histogram [39, 33, 33, 32, 32, 32, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:22:36,351 INFO L371 AbstractCegarLoop]: === Iteration 20 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr0AssertViolation, mainErr2EnsuresViolation, mainErr1AssertViolation]=== [2018-01-25 03:22:36,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1397576748, now seen corresponding path program 11 times [2018-01-25 03:22:36,351 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:22:36,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:36,352 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-25 03:22:36,352 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:22:36,352 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:22:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:22:36,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:22:37,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 2416 proven. 425 refuted. 0 times theorem prover too weak. 869 trivial. 0 not checked. [2018-01-25 03:22:37,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:37,049 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:22:37,049 INFO L183 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-01-25 03:22:37,049 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-25 03:22:37,049 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:37,049 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 03:22:37,054 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 03:22:37,054 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 03:22:37,069 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,071 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,075 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,080 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,086 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,095 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,103 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,111 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,120 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,128 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,129 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:37,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:37,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 1998 proven. 491 refuted. 0 times theorem prover too weak. 1221 trivial. 0 not checked. [2018-01-25 03:22:37,399 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 2006 proven. 483 refuted. 0 times theorem prover too weak. 1221 trivial. 0 not checked. [2018-01-25 03:22:37,827 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:22:37,827 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 30 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 03:22:37,830 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-25 03:22:37,831 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-25 03:22:37,854 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,860 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,873 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,905 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:37,969 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:38,045 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:38,267 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:38,675 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:39,183 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:42,040 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-25 03:22:42,125 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-25 03:22:42,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 03:22:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 2015 proven. 580 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-01-25 03:22:42,223 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 03:22:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3710 backedges. 2029 proven. 566 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-01-25 03:22:42,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 03:22:42,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19, 19, 19] total 50 [2018-01-25 03:22:42,514 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 03:22:42,514 INFO L409 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-01-25 03:22:42,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-01-25 03:22:42,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=2133, Unknown=0, NotChecked=0, Total=2450 [2018-01-25 03:22:42,515 INFO L87 Difference]: Start difference. First operand 285 states and 287 transitions. Second operand 36 states. Received shutdown request... [2018-01-25 03:22:43,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 03:22:43,464 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-25 03:22:43,467 WARN L187 ceAbstractionStarter]: Timeout [2018-01-25 03:22:43,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:22:43 BoogieIcfgContainer [2018-01-25 03:22:43,468 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:22:43,468 INFO L168 Benchmark]: Toolchain (without parser) took 45433.75 ms. Allocated memory was 301.5 MB in the beginning and 989.9 MB in the end (delta: 688.4 MB). Free memory was 262.4 MB in the beginning and 885.6 MB in the end (delta: -623.2 MB). Peak memory consumption was 65.2 MB. Max. memory is 5.3 GB. [2018-01-25 03:22:43,469 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 301.5 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:22:43,469 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.05 ms. Allocated memory is still 301.5 MB. Free memory was 261.4 MB in the beginning and 253.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. [2018-01-25 03:22:43,469 INFO L168 Benchmark]: Boogie Preprocessor took 42.72 ms. Allocated memory is still 301.5 MB. Free memory was 253.3 MB in the beginning and 251.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. [2018-01-25 03:22:43,470 INFO L168 Benchmark]: RCFGBuilder took 274.43 ms. Allocated memory is still 301.5 MB. Free memory was 251.2 MB in the beginning and 236.1 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. [2018-01-25 03:22:43,470 INFO L168 Benchmark]: TraceAbstraction took 44898.25 ms. Allocated memory was 301.5 MB in the beginning and 989.9 MB in the end (delta: 688.4 MB). Free memory was 235.1 MB in the beginning and 885.6 MB in the end (delta: -650.5 MB). Peak memory consumption was 37.9 MB. Max. memory is 5.3 GB. [2018-01-25 03:22:43,471 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.15 ms. Allocated memory is still 301.5 MB. Free memory is still 267.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.05 ms. Allocated memory is still 301.5 MB. Free memory was 261.4 MB in the beginning and 253.3 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.72 ms. Allocated memory is still 301.5 MB. Free memory was 253.3 MB in the beginning and 251.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 5.3 GB. * RCFGBuilder took 274.43 ms. Allocated memory is still 301.5 MB. Free memory was 251.2 MB in the beginning and 236.1 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 44898.25 ms. Allocated memory was 301.5 MB in the beginning and 989.9 MB in the end (delta: 688.4 MB). Free memory was 235.1 MB in the beginning and 885.6 MB in the end (delta: -650.5 MB). Peak memory consumption was 37.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 19 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 147 LocStat_NO_SUPPORTING_DISEQUALITIES : 36 LocStat_NO_DISJUNCTIONS : -38 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 26 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 31 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 27 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 1.277706 RENAME_VARIABLES(MILLISECONDS) : 0.351514 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 1.225844 PROJECTAWAY(MILLISECONDS) : 0.265843 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.166048 DISJOIN(MILLISECONDS) : 4.391162 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.385973 ADD_EQUALITY(MILLISECONDS) : 0.078216 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.032444 #CONJOIN_DISJUNCTIVE : 36 #RENAME_VARIABLES : 65 #UNFREEZE : 0 #CONJOIN : 59 #PROJECTAWAY : 60 #ADD_WEAK_EQUALITY : 4 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 63 #ADD_EQUALITY : 31 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 201 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 36 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.689736 RENAME_VARIABLES(MILLISECONDS) : 0.237823 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.650259 PROJECTAWAY(MILLISECONDS) : 0.177041 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.113142 DISJOIN(MILLISECONDS) : 0.422090 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.260858 ADD_EQUALITY(MILLISECONDS) : 0.034609 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.014351 #CONJOIN_DISJUNCTIVE : 129 #RENAME_VARIABLES : 298 #UNFREEZE : 0 #CONJOIN : 212 #PROJECTAWAY : 205 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 293 #ADD_EQUALITY : 36 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 33 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 257 LocStat_NO_SUPPORTING_DISEQUALITIES : 60 LocStat_NO_DISJUNCTIONS : -66 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 41 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 38 TransStat_NO_SUPPORTING_DISEQUALITIES : 6 TransStat_NO_DISJUNCTIONS : 41 TransStat_MAX_NO_DISJUNCTIONS : 1 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.805669 RENAME_VARIABLES(MILLISECONDS) : 0.304887 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.743672 PROJECTAWAY(MILLISECONDS) : 0.224452 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.072831 DISJOIN(MILLISECONDS) : 0.359032 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.336301 ADD_EQUALITY(MILLISECONDS) : 0.030373 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.008010 #CONJOIN_DISJUNCTIVE : 172 #RENAME_VARIABLES : 379 #UNFREEZE : 0 #CONJOIN : 250 #PROJECTAWAY : 249 #ADD_WEAK_EQUALITY : 6 #DISJOIN : 33 #RENAME_VARIABLES_DISJUNCTIVE : 379 #ADD_EQUALITY : 38 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 3 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 24 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 209 LocStat_NO_SUPPORTING_DISEQUALITIES : 38 LocStat_NO_DISJUNCTIONS : -48 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 32 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 36 TransStat_NO_SUPPORTING_DISEQUALITIES : 4 TransStat_NO_DISJUNCTIONS : 33 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.393346 RENAME_VARIABLES(MILLISECONDS) : 0.141806 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.370001 PROJECTAWAY(MILLISECONDS) : 0.113312 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.068284 DISJOIN(MILLISECONDS) : 0.278709 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.160170 ADD_EQUALITY(MILLISECONDS) : 0.028303 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.052079 #CONJOIN_DISJUNCTIVE : 130 #RENAME_VARIABLES : 301 #UNFREEZE : 0 #CONJOIN : 214 #PROJECTAWAY : 207 #ADD_WEAK_EQUALITY : 5 #DISJOIN : 31 #RENAME_VARIABLES_DISJUNCTIVE : 295 #ADD_EQUALITY : 36 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (285states) and interpolant automaton (currently 25 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 18]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (285states) and interpolant automaton (currently 25 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 18). Cancelled while BasicCegarLoop was constructing difference of abstraction (285states) and interpolant automaton (currently 25 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 27]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 27). Cancelled while BasicCegarLoop was constructing difference of abstraction (285states) and interpolant automaton (currently 25 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 23]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 23). Cancelled while BasicCegarLoop was constructing difference of abstraction (285states) and interpolant automaton (currently 25 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that array index is always in bounds (line 30). Cancelled while BasicCegarLoop was constructing difference of abstraction (285states) and interpolant automaton (currently 25 states, 36 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 27. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 6 error locations. TIMEOUT Result, 44.8s OverallTime, 20 OverallIterations, 39 TraceHistogramMax, 11.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 636 SDtfs, 2851 SDslu, 3468 SDs, 0 SdLazy, 4733 SolverSat, 512 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7654 GetRequests, 6899 SyntacticMatches, 144 SemanticMatches, 610 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11933 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 6.3s AbstIntTime, 4 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 166 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 6.5s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 5579 NumberOfCodeBlocks, 5309 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 9142 ConstructedInterpolants, 670 QuantifiedInterpolants, 6183200 SizeOfPredicates, 100 NumberOfNonLiveVariables, 7882 ConjunctsInSsa, 376 ConjunctsInUnsatCore, 78 InterpolantComputations, 9 PerfectInterpolantSequences, 63361/69976 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/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-22-43-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_03-22-43-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_03-22-43-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_03-22-43-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_03-22-43-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-2-2018-01-25_03-22-43-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-2-2018-01-25_03-22-43-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-3-2018-01-25_03-22-43-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-3-2018-01-25_03-22-43-485.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-22-43-485.csv Completed graceful shutdown