java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem14_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 20:33:25,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 20:33:25,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 20:33:25,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 20:33:25,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 20:33:25,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 20:33:25,947 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 20:33:25,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 20:33:25,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 20:33:25,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 20:33:25,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 20:33:25,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 20:33:25,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 20:33:25,954 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 20:33:25,955 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 20:33:25,956 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 20:33:25,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 20:33:25,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 20:33:25,959 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 20:33:25,961 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 20:33:25,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 20:33:25,964 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 20:33:25,965 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 20:33:25,966 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 20:33:25,968 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 20:33:25,968 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 20:33:25,968 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 20:33:25,969 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 20:33:25,970 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 20:33:25,971 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 20:33:25,971 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 20:33:25,972 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 20:33:25,972 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 20:33:25,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 20:33:25,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 20:33:25,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 20:33:25,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 20:33:25,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 20:33:25,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 20:33:25,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 20:33:25,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 20:33:25,978 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 20:33:25,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 20:33:25,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 20:33:26,000 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 20:33:26,002 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 20:33:26,003 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 20:33:26,003 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 20:33:26,003 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 20:33:26,003 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 20:33:26,004 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 20:33:26,004 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 20:33:26,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 20:33:26,006 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 20:33:26,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 20:33:26,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 20:33:26,006 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 20:33:26,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 20:33:26,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 20:33:26,007 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 20:33:26,007 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 20:33:26,008 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 20:33:26,008 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 20:33:26,008 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 20:33:26,008 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 20:33:26,009 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 20:33:26,009 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 20:33:26,009 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 20:33:26,009 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 20:33:26,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 20:33:26,010 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 20:33:26,010 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 20:33:26,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 20:33:26,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 20:33:26,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 20:33:26,088 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 20:33:26,089 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 20:33:26,089 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem14_label28.c [2019-10-02 20:33:26,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfb5b97f/c4dca6a838cf48c49ca59bf5b399737f/FLAG3410ce33d [2019-10-02 20:33:26,755 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 20:33:26,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem14_label28.c [2019-10-02 20:33:26,770 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfb5b97f/c4dca6a838cf48c49ca59bf5b399737f/FLAG3410ce33d [2019-10-02 20:33:27,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cfb5b97f/c4dca6a838cf48c49ca59bf5b399737f [2019-10-02 20:33:27,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 20:33:27,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 20:33:27,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 20:33:27,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 20:33:27,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 20:33:27,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:33:27" (1/1) ... [2019-10-02 20:33:27,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ac258e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:33:27, skipping insertion in model container [2019-10-02 20:33:27,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 08:33:27" (1/1) ... [2019-10-02 20:33:27,037 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 20:33:27,107 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 20:33:27,677 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:33:27,683 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 20:33:27,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 20:33:27,839 INFO L192 MainTranslator]: Completed translation [2019-10-02 20:33:27,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:33:27 WrapperNode [2019-10-02 20:33:27,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 20:33:27,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 20:33:27,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 20:33:27,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 20:33:27,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:33:27" (1/1) ... [2019-10-02 20:33:27,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:33:27" (1/1) ... [2019-10-02 20:33:27,873 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:33:27" (1/1) ... [2019-10-02 20:33:27,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:33:27" (1/1) ... [2019-10-02 20:33:27,919 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:33:27" (1/1) ... [2019-10-02 20:33:27,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:33:27" (1/1) ... [2019-10-02 20:33:27,946 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:33:27" (1/1) ... [2019-10-02 20:33:27,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 20:33:27,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 20:33:27,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 20:33:27,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 20:33:27,961 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:33:27" (1/1) ... No working directory specified, using /storage/repos/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 [2019-10-02 20:33:28,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 20:33:28,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 20:33:28,035 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 20:33:28,035 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 20:33:28,036 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 20:33:28,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 20:33:28,036 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 20:33:28,036 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 20:33:28,036 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 20:33:28,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 20:33:28,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 20:33:29,475 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 20:33:29,475 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 20:33:29,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:33:29 BoogieIcfgContainer [2019-10-02 20:33:29,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 20:33:29,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 20:33:29,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 20:33:29,482 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 20:33:29,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 08:33:27" (1/3) ... [2019-10-02 20:33:29,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbd08d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:33:29, skipping insertion in model container [2019-10-02 20:33:29,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 08:33:27" (2/3) ... [2019-10-02 20:33:29,484 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dbd08d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 08:33:29, skipping insertion in model container [2019-10-02 20:33:29,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 08:33:29" (3/3) ... [2019-10-02 20:33:29,486 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label28.c [2019-10-02 20:33:29,495 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 20:33:29,504 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 20:33:29,521 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 20:33:29,548 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 20:33:29,548 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 20:33:29,548 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 20:33:29,549 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 20:33:29,549 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 20:33:29,549 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 20:33:29,549 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 20:33:29,549 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 20:33:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states. [2019-10-02 20:33:29,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-02 20:33:29,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:33:29,591 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:33:29,592 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:33:29,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:33:29,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1694474349, now seen corresponding path program 1 times [2019-10-02 20:33:29,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:33:29,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:33:29,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:33:29,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:33:29,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:33:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:33:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:33:29,817 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:33:29,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 20:33:29,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:33:29,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 20:33:29,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 20:33:29,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 20:33:29,842 INFO L87 Difference]: Start difference. First operand 254 states. Second operand 4 states. [2019-10-02 20:33:31,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:33:31,870 INFO L93 Difference]: Finished difference Result 642 states and 849 transitions. [2019-10-02 20:33:31,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 20:33:31,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-02 20:33:31,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:33:31,893 INFO L225 Difference]: With dead ends: 642 [2019-10-02 20:33:31,893 INFO L226 Difference]: Without dead ends: 554 [2019-10-02 20:33:31,895 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 20:33:31,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-10-02 20:33:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 372. [2019-10-02 20:33:31,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-02 20:33:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 524 transitions. [2019-10-02 20:33:31,990 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 524 transitions. Word has length 16 [2019-10-02 20:33:31,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:33:31,991 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 524 transitions. [2019-10-02 20:33:31,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 20:33:31,991 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 524 transitions. [2019-10-02 20:33:31,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 20:33:32,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:33:32,000 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:33:32,001 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:33:32,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:33:32,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1881013151, now seen corresponding path program 1 times [2019-10-02 20:33:32,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:33:32,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:33:32,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:33:32,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:33:32,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:33:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:33:32,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:33:32,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:33:32,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 20:33:32,421 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:33:32,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 20:33:32,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 20:33:32,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 20:33:32,423 INFO L87 Difference]: Start difference. First operand 372 states and 524 transitions. Second operand 6 states. [2019-10-02 20:33:33,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:33:33,894 INFO L93 Difference]: Finished difference Result 582 states and 779 transitions. [2019-10-02 20:33:33,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 20:33:33,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-02 20:33:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:33:33,901 INFO L225 Difference]: With dead ends: 582 [2019-10-02 20:33:33,902 INFO L226 Difference]: Without dead ends: 582 [2019-10-02 20:33:33,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:33:33,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-02 20:33:33,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 566. [2019-10-02 20:33:33,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2019-10-02 20:33:33,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 747 transitions. [2019-10-02 20:33:33,942 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 747 transitions. Word has length 99 [2019-10-02 20:33:33,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:33:33,942 INFO L475 AbstractCegarLoop]: Abstraction has 566 states and 747 transitions. [2019-10-02 20:33:33,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 20:33:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 747 transitions. [2019-10-02 20:33:33,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 20:33:33,946 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:33:33,946 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:33:33,946 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:33:33,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:33:33,947 INFO L82 PathProgramCache]: Analyzing trace with hash -2144779955, now seen corresponding path program 1 times [2019-10-02 20:33:33,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:33:33,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:33:33,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:33:33,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:33:33,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:33:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:33:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:33:34,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:33:34,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 20:33:34,041 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:33:34,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:33:34,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:33:34,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:33:34,042 INFO L87 Difference]: Start difference. First operand 566 states and 747 transitions. Second operand 3 states. [2019-10-02 20:33:34,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:33:34,984 INFO L93 Difference]: Finished difference Result 934 states and 1192 transitions. [2019-10-02 20:33:34,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:33:34,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-02 20:33:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:33:34,990 INFO L225 Difference]: With dead ends: 934 [2019-10-02 20:33:34,990 INFO L226 Difference]: Without dead ends: 934 [2019-10-02 20:33:34,991 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:33:34,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2019-10-02 20:33:35,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 934. [2019-10-02 20:33:35,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 934 states. [2019-10-02 20:33:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1192 transitions. [2019-10-02 20:33:35,025 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1192 transitions. Word has length 125 [2019-10-02 20:33:35,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:33:35,026 INFO L475 AbstractCegarLoop]: Abstraction has 934 states and 1192 transitions. [2019-10-02 20:33:35,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:33:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1192 transitions. [2019-10-02 20:33:35,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 20:33:35,030 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:33:35,030 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:33:35,030 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:33:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:33:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash 386406922, now seen corresponding path program 1 times [2019-10-02 20:33:35,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:33:35,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:33:35,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:33:35,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:33:35,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:33:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:33:35,205 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:33:35,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:33:35,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 20:33:35,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:33:35,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 20:33:35,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 20:33:35,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 20:33:35,207 INFO L87 Difference]: Start difference. First operand 934 states and 1192 transitions. Second operand 6 states. [2019-10-02 20:33:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:33:36,456 INFO L93 Difference]: Finished difference Result 1520 states and 1926 transitions. [2019-10-02 20:33:36,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 20:33:36,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 156 [2019-10-02 20:33:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:33:36,465 INFO L225 Difference]: With dead ends: 1520 [2019-10-02 20:33:36,465 INFO L226 Difference]: Without dead ends: 1520 [2019-10-02 20:33:36,466 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-10-02 20:33:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2019-10-02 20:33:36,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1498. [2019-10-02 20:33:36,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1498 states. [2019-10-02 20:33:36,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1870 transitions. [2019-10-02 20:33:36,512 INFO L78 Accepts]: Start accepts. Automaton has 1498 states and 1870 transitions. Word has length 156 [2019-10-02 20:33:36,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:33:36,513 INFO L475 AbstractCegarLoop]: Abstraction has 1498 states and 1870 transitions. [2019-10-02 20:33:36,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 20:33:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1498 states and 1870 transitions. [2019-10-02 20:33:36,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 20:33:36,517 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:33:36,517 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:33:36,518 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:33:36,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:33:36,518 INFO L82 PathProgramCache]: Analyzing trace with hash -380685670, now seen corresponding path program 1 times [2019-10-02 20:33:36,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:33:36,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:33:36,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:33:36,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:33:36,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:33:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:33:37,080 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 99 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 20:33:37,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:33:37,080 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:33:37,082 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 184 with the following transitions: [2019-10-02 20:33:37,084 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [37], [39], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:33:37,152 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:33:37,153 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:33:43,173 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:33:43,177 INFO L272 AbstractInterpreter]: Visited 92 different actions 179 times. Merged at 4 different actions 5 times. Never widened. Performed 398 root evaluator evaluations with a maximum evaluation depth of 13. Performed 398 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2019-10-02 20:33:43,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:33:43,183 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:33:45,225 INFO L227 lantSequenceWeakener]: Weakened 180 states. On average, predicates are now at 77.22% of their original sizes. [2019-10-02 20:33:45,225 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:33:45,303 INFO L420 sIntCurrentIteration]: We unified 182 AI predicates to 182 [2019-10-02 20:33:45,304 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:33:45,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:33:45,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2019-10-02 20:33:45,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:33:45,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 20:33:45,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 20:33:45,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-02 20:33:45,307 INFO L87 Difference]: Start difference. First operand 1498 states and 1870 transitions. Second operand 11 states. [2019-10-02 20:34:19,631 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:36:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:36:07,045 INFO L93 Difference]: Finished difference Result 1714 states and 2096 transitions. [2019-10-02 20:36:07,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 20:36:07,045 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 183 [2019-10-02 20:36:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:36:07,054 INFO L225 Difference]: With dead ends: 1714 [2019-10-02 20:36:07,054 INFO L226 Difference]: Without dead ends: 1714 [2019-10-02 20:36:07,055 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:36:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2019-10-02 20:36:07,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1682. [2019-10-02 20:36:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-10-02 20:36:07,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2061 transitions. [2019-10-02 20:36:07,095 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2061 transitions. Word has length 183 [2019-10-02 20:36:07,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:36:07,095 INFO L475 AbstractCegarLoop]: Abstraction has 1682 states and 2061 transitions. [2019-10-02 20:36:07,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 20:36:07,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2061 transitions. [2019-10-02 20:36:07,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-02 20:36:07,101 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:36:07,101 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:36:07,102 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:36:07,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:36:07,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1020357735, now seen corresponding path program 1 times [2019-10-02 20:36:07,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:36:07,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:36:07,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:36:07,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:36:07,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:36:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:36:07,395 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 113 proven. 83 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-02 20:36:07,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:36:07,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:36:07,396 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 294 with the following transitions: [2019-10-02 20:36:07,396 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [37], [39], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [658], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:36:07,405 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:36:07,406 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:36:21,774 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:36:21,775 INFO L272 AbstractInterpreter]: Visited 119 different actions 354 times. Merged at 6 different actions 17 times. Never widened. Performed 649 root evaluator evaluations with a maximum evaluation depth of 13. Performed 649 inverse root evaluator evaluations with a maximum inverse evaluation depth of 13. Found 4 fixpoints after 3 different actions. Largest state had 24 variables. [2019-10-02 20:36:21,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:36:21,775 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:36:25,074 INFO L227 lantSequenceWeakener]: Weakened 290 states. On average, predicates are now at 77.26% of their original sizes. [2019-10-02 20:36:25,074 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:36:25,151 INFO L420 sIntCurrentIteration]: We unified 292 AI predicates to 292 [2019-10-02 20:36:25,152 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:36:25,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:36:25,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2019-10-02 20:36:25,152 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:36:25,153 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 20:36:25,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 20:36:25,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:36:25,154 INFO L87 Difference]: Start difference. First operand 1682 states and 2061 transitions. Second operand 10 states. [2019-10-02 20:37:00,989 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:38:00,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:38:00,056 INFO L93 Difference]: Finished difference Result 2056 states and 2462 transitions. [2019-10-02 20:38:00,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 20:38:00,056 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 293 [2019-10-02 20:38:00,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:38:00,065 INFO L225 Difference]: With dead ends: 2056 [2019-10-02 20:38:00,066 INFO L226 Difference]: Without dead ends: 2056 [2019-10-02 20:38:00,066 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2019-10-02 20:38:00,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2019-10-02 20:38:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 1682. [2019-10-02 20:38:00,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2019-10-02 20:38:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2066 transitions. [2019-10-02 20:38:00,106 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2066 transitions. Word has length 293 [2019-10-02 20:38:00,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:38:00,107 INFO L475 AbstractCegarLoop]: Abstraction has 1682 states and 2066 transitions. [2019-10-02 20:38:00,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 20:38:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2066 transitions. [2019-10-02 20:38:00,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-02 20:38:00,112 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:38:00,113 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:38:00,113 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:38:00,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:38:00,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1735798038, now seen corresponding path program 1 times [2019-10-02 20:38:00,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:38:00,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:38:00,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:38:00,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:38:00,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:38:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:38:00,643 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2019-10-02 20:38:00,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 20:38:00,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 20:38:00,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:38:00,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 20:38:00,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 20:38:00,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:38:00,646 INFO L87 Difference]: Start difference. First operand 1682 states and 2066 transitions. Second operand 3 states. [2019-10-02 20:38:01,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:38:01,432 INFO L93 Difference]: Finished difference Result 2238 states and 2723 transitions. [2019-10-02 20:38:01,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 20:38:01,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 352 [2019-10-02 20:38:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:38:01,449 INFO L225 Difference]: With dead ends: 2238 [2019-10-02 20:38:01,450 INFO L226 Difference]: Without dead ends: 2238 [2019-10-02 20:38:01,450 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 20:38:01,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2238 states. [2019-10-02 20:38:01,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2238 to 2056. [2019-10-02 20:38:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2019-10-02 20:38:01,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2533 transitions. [2019-10-02 20:38:01,502 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2533 transitions. Word has length 352 [2019-10-02 20:38:01,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:38:01,503 INFO L475 AbstractCegarLoop]: Abstraction has 2056 states and 2533 transitions. [2019-10-02 20:38:01,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 20:38:01,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2533 transitions. [2019-10-02 20:38:01,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-10-02 20:38:01,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:38:01,510 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:38:01,511 INFO L418 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:38:01,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:38:01,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1161597093, now seen corresponding path program 1 times [2019-10-02 20:38:01,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:38:01,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:38:01,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:38:01,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:38:01,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:38:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:38:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 308 proven. 149 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 20:38:02,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:38:02,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:38:02,656 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 391 with the following transitions: [2019-10-02 20:38:02,659 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [37], [39], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:38:02,677 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:38:02,678 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:38:15,941 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:38:32,332 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:38:32,333 INFO L272 AbstractInterpreter]: Visited 120 different actions 469 times. Merged at 6 different actions 19 times. Never widened. Performed 872 root evaluator evaluations with a maximum evaluation depth of 22. Performed 872 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 4 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 20:38:32,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:38:32,333 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:38:40,313 INFO L227 lantSequenceWeakener]: Weakened 387 states. On average, predicates are now at 77.28% of their original sizes. [2019-10-02 20:38:40,314 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:38:40,385 INFO L420 sIntCurrentIteration]: We unified 389 AI predicates to 389 [2019-10-02 20:38:40,385 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:38:40,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:38:40,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2019-10-02 20:38:40,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:38:40,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 20:38:40,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 20:38:40,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:38:40,387 INFO L87 Difference]: Start difference. First operand 2056 states and 2533 transitions. Second operand 10 states. [2019-10-02 20:41:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:41:17,473 INFO L93 Difference]: Finished difference Result 3164 states and 3745 transitions. [2019-10-02 20:41:17,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 20:41:17,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 390 [2019-10-02 20:41:17,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:41:17,489 INFO L225 Difference]: With dead ends: 3164 [2019-10-02 20:41:17,489 INFO L226 Difference]: Without dead ends: 3164 [2019-10-02 20:41:17,490 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:41:17,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3164 states. [2019-10-02 20:41:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 3158. [2019-10-02 20:41:17,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3158 states. [2019-10-02 20:41:17,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3158 states to 3158 states and 3739 transitions. [2019-10-02 20:41:17,553 INFO L78 Accepts]: Start accepts. Automaton has 3158 states and 3739 transitions. Word has length 390 [2019-10-02 20:41:17,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:41:17,554 INFO L475 AbstractCegarLoop]: Abstraction has 3158 states and 3739 transitions. [2019-10-02 20:41:17,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 20:41:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 3158 states and 3739 transitions. [2019-10-02 20:41:17,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-10-02 20:41:17,562 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:41:17,563 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:41:17,563 INFO L418 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:41:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:41:17,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1507246003, now seen corresponding path program 1 times [2019-10-02 20:41:17,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:41:17,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:17,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:41:17,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:17,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:41:17,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:41:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 320 proven. 160 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-02 20:41:18,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:41:18,311 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:41:18,311 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 403 with the following transitions: [2019-10-02 20:41:18,311 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [37], [39], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [550], [551], [554], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:41:18,317 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:41:18,317 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:41:33,135 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:41:53,590 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-02 20:41:53,592 INFO L272 AbstractInterpreter]: Visited 121 different actions 719 times. Merged at 7 different actions 47 times. Widened at 1 different actions 1 times. Performed 1201 root evaluator evaluations with a maximum evaluation depth of 22. Performed 1201 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 11 fixpoints after 3 different actions. Largest state had 24 variables. [2019-10-02 20:41:53,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:41:53,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-02 20:41:53,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:41:53,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/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 [2019-10-02 20:41:53,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:41:53,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-02 20:41:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:41:53,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-02 20:41:53,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 20:41:53,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 20:41:54,034 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 289 proven. 2 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-10-02 20:41:54,034 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-02 20:41:54,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 20:41:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 562 backedges. 289 proven. 2 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 20:41:54,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-02 20:41:54,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 5] total 14 [2019-10-02 20:41:54,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-02 20:41:54,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 20:41:54,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 20:41:54,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-10-02 20:41:54,532 INFO L87 Difference]: Start difference. First operand 3158 states and 3739 transitions. Second operand 13 states. [2019-10-02 20:41:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:41:57,117 INFO L93 Difference]: Finished difference Result 3181 states and 3933 transitions. [2019-10-02 20:41:57,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 20:41:57,118 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 402 [2019-10-02 20:41:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:41:57,133 INFO L225 Difference]: With dead ends: 3181 [2019-10-02 20:41:57,134 INFO L226 Difference]: Without dead ends: 3072 [2019-10-02 20:41:57,134 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 832 GetRequests, 809 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2019-10-02 20:41:57,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-10-02 20:41:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2986. [2019-10-02 20:41:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2986 states. [2019-10-02 20:41:57,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 3258 transitions. [2019-10-02 20:41:57,201 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 3258 transitions. Word has length 402 [2019-10-02 20:41:57,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:41:57,202 INFO L475 AbstractCegarLoop]: Abstraction has 2986 states and 3258 transitions. [2019-10-02 20:41:57,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 20:41:57,202 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 3258 transitions. [2019-10-02 20:41:57,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-10-02 20:41:57,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:41:57,213 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:41:57,213 INFO L418 AbstractCegarLoop]: === Iteration 10 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:41:57,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:41:57,214 INFO L82 PathProgramCache]: Analyzing trace with hash -777839706, now seen corresponding path program 1 times [2019-10-02 20:41:57,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:41:57,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:57,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:41:57,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:41:57,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:41:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:41:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 34 proven. 335 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-10-02 20:41:57,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:41:57,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:41:57,795 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 512 with the following transitions: [2019-10-02 20:41:57,796 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [37], [39], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [686], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [854], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:41:57,801 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:41:57,801 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:42:21,044 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:43:37,058 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:43:37,058 INFO L272 AbstractInterpreter]: Visited 169 different actions 1014 times. Merged at 8 different actions 50 times. Widened at 1 different actions 1 times. Performed 1629 root evaluator evaluations with a maximum evaluation depth of 22. Performed 1629 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 14 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 20:43:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:43:37,058 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 20:43:52,456 INFO L227 lantSequenceWeakener]: Weakened 508 states. On average, predicates are now at 77.27% of their original sizes. [2019-10-02 20:43:52,456 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 20:43:52,530 INFO L420 sIntCurrentIteration]: We unified 510 AI predicates to 510 [2019-10-02 20:43:52,530 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 20:43:52,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 20:43:52,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2019-10-02 20:43:52,531 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 20:43:52,531 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 20:43:52,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 20:43:52,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 20:43:52,532 INFO L87 Difference]: Start difference. First operand 2986 states and 3258 transitions. Second operand 10 states. [2019-10-02 20:45:19,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 20:45:19,808 INFO L93 Difference]: Finished difference Result 3562 states and 3859 transitions. [2019-10-02 20:45:19,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 20:45:19,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 511 [2019-10-02 20:45:19,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 20:45:19,821 INFO L225 Difference]: With dead ends: 3562 [2019-10-02 20:45:19,821 INFO L226 Difference]: Without dead ends: 3562 [2019-10-02 20:45:19,822 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 502 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-10-02 20:45:19,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3562 states. [2019-10-02 20:45:19,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3562 to 3544. [2019-10-02 20:45:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3544 states. [2019-10-02 20:45:19,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3544 states to 3544 states and 3838 transitions. [2019-10-02 20:45:19,881 INFO L78 Accepts]: Start accepts. Automaton has 3544 states and 3838 transitions. Word has length 511 [2019-10-02 20:45:19,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 20:45:19,882 INFO L475 AbstractCegarLoop]: Abstraction has 3544 states and 3838 transitions. [2019-10-02 20:45:19,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 20:45:19,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3544 states and 3838 transitions. [2019-10-02 20:45:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2019-10-02 20:45:19,895 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 20:45:19,895 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 20:45:19,896 INFO L418 AbstractCegarLoop]: === Iteration 11 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 20:45:19,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:45:19,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1306468835, now seen corresponding path program 1 times [2019-10-02 20:45:19,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 20:45:19,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:45:19,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 20:45:19,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 20:45:19,898 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 20:45:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 20:45:20,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 356 proven. 2 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-10-02 20:45:20,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 20:45:20,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 20:45:20,279 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 588 with the following transitions: [2019-10-02 20:45:20,279 INFO L207 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [37], [39], [42], [50], [58], [66], [74], [82], [90], [98], [106], [114], [122], [130], [138], [146], [154], [162], [170], [178], [186], [194], [202], [210], [218], [226], [234], [242], [250], [258], [266], [274], [282], [290], [298], [306], [314], [322], [330], [338], [346], [354], [362], [370], [378], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [522], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [654], [655], [658], [659], [663], [667], [671], [675], [679], [683], [686], [687], [691], [695], [699], [703], [707], [711], [715], [719], [723], [727], [731], [735], [739], [743], [747], [751], [755], [759], [763], [767], [771], [775], [779], [783], [787], [791], [795], [799], [803], [807], [811], [815], [819], [823], [827], [831], [835], [839], [843], [847], [851], [854], [948], [952], [961], [965], [967], [972], [973], [974], [976], [977] [2019-10-02 20:45:20,282 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 20:45:20,282 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 20:45:42,932 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-02 20:47:27,445 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 20:47:27,446 INFO L272 AbstractInterpreter]: Visited 170 different actions 1194 times. Merged at 9 different actions 64 times. Widened at 1 different actions 2 times. Performed 2039 root evaluator evaluations with a maximum evaluation depth of 22. Performed 2039 inverse root evaluator evaluations with a maximum inverse evaluation depth of 22. Found 19 fixpoints after 2 different actions. Largest state had 24 variables. [2019-10-02 20:47:27,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 20:47:27,446 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates