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/Problem16_label10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 21:16:27,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 21:16:27,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 21:16:27,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 21:16:27,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 21:16:27,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 21:16:27,989 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 21:16:27,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 21:16:27,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 21:16:27,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 21:16:27,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 21:16:27,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 21:16:27,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 21:16:27,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 21:16:27,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 21:16:27,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 21:16:27,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 21:16:28,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 21:16:28,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 21:16:28,004 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 21:16:28,006 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 21:16:28,007 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 21:16:28,008 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 21:16:28,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 21:16:28,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 21:16:28,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 21:16:28,012 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 21:16:28,013 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 21:16:28,014 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 21:16:28,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 21:16:28,015 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 21:16:28,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 21:16:28,017 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 21:16:28,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 21:16:28,019 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 21:16:28,019 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 21:16:28,019 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 21:16:28,020 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 21:16:28,020 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 21:16:28,021 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 21:16:28,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 21:16:28,023 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 21:16:28,038 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 21:16:28,038 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 21:16:28,039 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 21:16:28,039 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 21:16:28,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 21:16:28,040 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 21:16:28,040 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 21:16:28,040 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 21:16:28,041 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 21:16:28,041 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 21:16:28,041 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 21:16:28,042 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 21:16:28,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 21:16:28,042 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 21:16:28,042 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 21:16:28,042 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 21:16:28,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 21:16:28,043 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 21:16:28,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 21:16:28,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 21:16:28,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 21:16:28,044 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 21:16:28,044 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 21:16:28,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 21:16:28,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 21:16:28,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 21:16:28,045 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 21:16:28,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 21:16:28,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 21:16:28,045 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 21:16:28,093 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 21:16:28,106 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 21:16:28,109 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 21:16:28,111 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 21:16:28,112 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 21:16:28,112 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem16_label10.c [2019-10-02 21:16:28,178 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3abea3935/b4523cd042194904a7bb06679272126b/FLAGc593a66e3 [2019-10-02 21:16:28,892 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 21:16:28,892 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem16_label10.c [2019-10-02 21:16:28,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3abea3935/b4523cd042194904a7bb06679272126b/FLAGc593a66e3 [2019-10-02 21:16:29,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3abea3935/b4523cd042194904a7bb06679272126b [2019-10-02 21:16:29,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 21:16:29,113 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 21:16:29,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 21:16:29,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 21:16:29,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 21:16:29,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 09:16:29" (1/1) ... [2019-10-02 21:16:29,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a810fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:16:29, skipping insertion in model container [2019-10-02 21:16:29,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 09:16:29" (1/1) ... [2019-10-02 21:16:29,131 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 21:16:29,212 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 21:16:29,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 21:16:29,946 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 21:16:30,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 21:16:30,196 INFO L192 MainTranslator]: Completed translation [2019-10-02 21:16:30,196 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:16:30 WrapperNode [2019-10-02 21:16:30,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 21:16:30,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 21:16:30,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 21:16:30,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 21:16:30,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:16:30" (1/1) ... [2019-10-02 21:16:30,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:16:30" (1/1) ... [2019-10-02 21:16:30,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:16:30" (1/1) ... [2019-10-02 21:16:30,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:16:30" (1/1) ... [2019-10-02 21:16:30,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:16:30" (1/1) ... [2019-10-02 21:16:30,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:16:30" (1/1) ... [2019-10-02 21:16:30,370 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:16:30" (1/1) ... [2019-10-02 21:16:30,386 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 21:16:30,387 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 21:16:30,387 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 21:16:30,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 21:16:30,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:16:30" (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 21:16:30,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 21:16:30,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 21:16:30,459 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2019-10-02 21:16:30,460 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output2 [2019-10-02 21:16:30,460 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 21:16:30,460 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2019-10-02 21:16:30,460 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output2 [2019-10-02 21:16:30,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 21:16:30,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 21:16:30,461 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 21:16:30,461 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 21:16:30,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 21:16:30,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 21:16:33,039 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 21:16:33,039 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-02 21:16:33,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 09:16:33 BoogieIcfgContainer [2019-10-02 21:16:33,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 21:16:33,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 21:16:33,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 21:16:33,048 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 21:16:33,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 09:16:29" (1/3) ... [2019-10-02 21:16:33,050 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244874ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 09:16:33, skipping insertion in model container [2019-10-02 21:16:33,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:16:30" (2/3) ... [2019-10-02 21:16:33,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@244874ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 09:16:33, skipping insertion in model container [2019-10-02 21:16:33,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 09:16:33" (3/3) ... [2019-10-02 21:16:33,054 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem16_label10.c [2019-10-02 21:16:33,065 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 21:16:33,083 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 21:16:33,101 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 21:16:33,138 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 21:16:33,139 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 21:16:33,139 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 21:16:33,139 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 21:16:33,139 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 21:16:33,139 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 21:16:33,140 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 21:16:33,140 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 21:16:33,180 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states. [2019-10-02 21:16:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 21:16:33,193 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:16:33,195 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:16:33,197 INFO L418 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:16:33,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:16:33,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1129192547, now seen corresponding path program 1 times [2019-10-02 21:16:33,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:16:33,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:33,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:16:33,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:33,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:16:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:16:33,550 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 21:16:33,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:16:33,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 21:16:33,553 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:16:33,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 21:16:33,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 21:16:33,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 21:16:33,577 INFO L87 Difference]: Start difference. First operand 409 states. Second operand 4 states. [2019-10-02 21:16:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:16:37,313 INFO L93 Difference]: Finished difference Result 1106 states and 1888 transitions. [2019-10-02 21:16:37,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 21:16:37,315 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-02 21:16:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:16:37,343 INFO L225 Difference]: With dead ends: 1106 [2019-10-02 21:16:37,344 INFO L226 Difference]: Without dead ends: 1019 [2019-10-02 21:16:37,346 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 21:16:37,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1019 states. [2019-10-02 21:16:37,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1019 to 1019. [2019-10-02 21:16:37,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1019 states. [2019-10-02 21:16:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1739 transitions. [2019-10-02 21:16:37,459 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1739 transitions. Word has length 38 [2019-10-02 21:16:37,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:16:37,460 INFO L475 AbstractCegarLoop]: Abstraction has 1019 states and 1739 transitions. [2019-10-02 21:16:37,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 21:16:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1739 transitions. [2019-10-02 21:16:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-02 21:16:37,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:16:37,474 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:16:37,474 INFO L418 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:16:37,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:16:37,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2138729124, now seen corresponding path program 1 times [2019-10-02 21:16:37,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:16:37,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:37,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:16:37,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:37,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:16:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:16:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:16:37,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:16:37,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 21:16:37,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:16:37,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 21:16:37,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 21:16:37,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 21:16:37,712 INFO L87 Difference]: Start difference. First operand 1019 states and 1739 transitions. Second operand 6 states. [2019-10-02 21:16:40,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:16:40,998 INFO L93 Difference]: Finished difference Result 2084 states and 3454 transitions. [2019-10-02 21:16:40,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:16:40,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2019-10-02 21:16:41,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:16:41,022 INFO L225 Difference]: With dead ends: 2084 [2019-10-02 21:16:41,022 INFO L226 Difference]: Without dead ends: 2084 [2019-10-02 21:16:41,023 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 21:16:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2019-10-02 21:16:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 2061. [2019-10-02 21:16:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2019-10-02 21:16:41,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 3384 transitions. [2019-10-02 21:16:41,132 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 3384 transitions. Word has length 108 [2019-10-02 21:16:41,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:16:41,134 INFO L475 AbstractCegarLoop]: Abstraction has 2061 states and 3384 transitions. [2019-10-02 21:16:41,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 21:16:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 3384 transitions. [2019-10-02 21:16:41,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 21:16:41,146 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:16:41,146 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:16:41,147 INFO L418 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:16:41,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:16:41,147 INFO L82 PathProgramCache]: Analyzing trace with hash -899506204, now seen corresponding path program 1 times [2019-10-02 21:16:41,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:16:41,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:41,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:16:41,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:41,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:16:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:16:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:16:41,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:16:41,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 21:16:41,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:16:41,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 21:16:41,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 21:16:41,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 21:16:41,472 INFO L87 Difference]: Start difference. First operand 2061 states and 3384 transitions. Second operand 6 states. [2019-10-02 21:16:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:16:44,614 INFO L93 Difference]: Finished difference Result 3849 states and 6346 transitions. [2019-10-02 21:16:44,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:16:44,615 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-10-02 21:16:44,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:16:44,641 INFO L225 Difference]: With dead ends: 3849 [2019-10-02 21:16:44,642 INFO L226 Difference]: Without dead ends: 3849 [2019-10-02 21:16:44,645 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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 21:16:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2019-10-02 21:16:44,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 3813. [2019-10-02 21:16:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3813 states. [2019-10-02 21:16:44,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 3813 states and 6183 transitions. [2019-10-02 21:16:44,757 INFO L78 Accepts]: Start accepts. Automaton has 3813 states and 6183 transitions. Word has length 136 [2019-10-02 21:16:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:16:44,758 INFO L475 AbstractCegarLoop]: Abstraction has 3813 states and 6183 transitions. [2019-10-02 21:16:44,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 21:16:44,758 INFO L276 IsEmpty]: Start isEmpty. Operand 3813 states and 6183 transitions. [2019-10-02 21:16:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 21:16:44,760 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:16:44,760 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:16:44,760 INFO L418 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:16:44,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:16:44,761 INFO L82 PathProgramCache]: Analyzing trace with hash -387784608, now seen corresponding path program 1 times [2019-10-02 21:16:44,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:16:44,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:44,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:16:44,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:44,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:16:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:16:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:16:44,927 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:16:44,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 21:16:44,928 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:16:44,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 21:16:44,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 21:16:44,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 21:16:44,929 INFO L87 Difference]: Start difference. First operand 3813 states and 6183 transitions. Second operand 6 states. [2019-10-02 21:16:47,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:16:47,509 INFO L93 Difference]: Finished difference Result 5942 states and 8256 transitions. [2019-10-02 21:16:47,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:16:47,510 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-10-02 21:16:47,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:16:47,542 INFO L225 Difference]: With dead ends: 5942 [2019-10-02 21:16:47,543 INFO L226 Difference]: Without dead ends: 5942 [2019-10-02 21:16:47,543 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 21:16:47,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5942 states. [2019-10-02 21:16:47,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5942 to 5896. [2019-10-02 21:16:47,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5896 states. [2019-10-02 21:16:47,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5896 states to 5896 states and 8054 transitions. [2019-10-02 21:16:47,716 INFO L78 Accepts]: Start accepts. Automaton has 5896 states and 8054 transitions. Word has length 154 [2019-10-02 21:16:47,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:16:47,718 INFO L475 AbstractCegarLoop]: Abstraction has 5896 states and 8054 transitions. [2019-10-02 21:16:47,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 21:16:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 5896 states and 8054 transitions. [2019-10-02 21:16:47,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 21:16:47,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:16:47,725 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:16:47,725 INFO L418 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:16:47,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:16:47,726 INFO L82 PathProgramCache]: Analyzing trace with hash 215437429, now seen corresponding path program 1 times [2019-10-02 21:16:47,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:16:47,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:47,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:16:47,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:47,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:16:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:16:48,078 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 21:16:48,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:16:48,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 21:16:48,079 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:16:48,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 21:16:48,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 21:16:48,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 21:16:48,081 INFO L87 Difference]: Start difference. First operand 5896 states and 8054 transitions. Second operand 6 states. [2019-10-02 21:16:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:16:50,720 INFO L93 Difference]: Finished difference Result 8685 states and 11567 transitions. [2019-10-02 21:16:50,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 21:16:50,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 201 [2019-10-02 21:16:50,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:16:50,758 INFO L225 Difference]: With dead ends: 8685 [2019-10-02 21:16:50,758 INFO L226 Difference]: Without dead ends: 8685 [2019-10-02 21:16:50,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 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 21:16:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8685 states. [2019-10-02 21:16:50,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8685 to 8651. [2019-10-02 21:16:50,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8651 states. [2019-10-02 21:16:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8651 states to 8651 states and 11412 transitions. [2019-10-02 21:16:50,928 INFO L78 Accepts]: Start accepts. Automaton has 8651 states and 11412 transitions. Word has length 201 [2019-10-02 21:16:50,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:16:50,929 INFO L475 AbstractCegarLoop]: Abstraction has 8651 states and 11412 transitions. [2019-10-02 21:16:50,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 21:16:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 8651 states and 11412 transitions. [2019-10-02 21:16:50,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 21:16:50,932 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:16:50,932 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:16:50,933 INFO L418 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:16:50,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:16:50,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1906343064, now seen corresponding path program 1 times [2019-10-02 21:16:50,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:16:50,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:50,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:16:50,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:50,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:16:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:16:51,112 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-02 21:16:51,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 21:16:51,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 21:16:51,113 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:16:51,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 21:16:51,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 21:16:51,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 21:16:51,114 INFO L87 Difference]: Start difference. First operand 8651 states and 11412 transitions. Second operand 4 states. [2019-10-02 21:16:54,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 21:16:54,311 INFO L93 Difference]: Finished difference Result 14417 states and 18240 transitions. [2019-10-02 21:16:54,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 21:16:54,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-10-02 21:16:54,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 21:16:54,365 INFO L225 Difference]: With dead ends: 14417 [2019-10-02 21:16:54,365 INFO L226 Difference]: Without dead ends: 14417 [2019-10-02 21:16:54,366 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 21:16:54,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14417 states. [2019-10-02 21:16:54,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14417 to 13741. [2019-10-02 21:16:54,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13741 states. [2019-10-02 21:16:54,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13741 states to 13741 states and 17470 transitions. [2019-10-02 21:16:54,603 INFO L78 Accepts]: Start accepts. Automaton has 13741 states and 17470 transitions. Word has length 237 [2019-10-02 21:16:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 21:16:54,604 INFO L475 AbstractCegarLoop]: Abstraction has 13741 states and 17470 transitions. [2019-10-02 21:16:54,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 21:16:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 13741 states and 17470 transitions. [2019-10-02 21:16:54,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-10-02 21:16:54,617 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 21:16:54,617 INFO L411 BasicCegarLoop]: trace histogram [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, 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, 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 21:16:54,618 INFO L418 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 21:16:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:16:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1225908112, now seen corresponding path program 1 times [2019-10-02 21:16:54,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 21:16:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:54,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 21:16:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 21:16:54,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 21:16:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 21:16:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 210 proven. 115 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-10-02 21:16:55,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 21:16:55,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 21:16:55,155 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 421 with the following transitions: [2019-10-02 21:16:55,157 INFO L207 CegarAbsIntRunner]: [0], [1], [180], [187], [195], [203], [211], [219], [227], [235], [243], [251], [259], [267], [275], [283], [291], [299], [307], [315], [323], [331], [339], [347], [355], [363], [371], [379], [387], [391], [393], [396], [404], [412], [420], [428], [436], [444], [452], [460], [468], [476], [484], [492], [500], [508], [516], [524], [532], [540], [548], [556], [564], [572], [580], [588], [596], [604], [612], [620], [628], [636], [644], [652], [660], [668], [673], [677], [681], [685], [689], [693], [697], [701], [705], [709], [713], [717], [721], [725], [729], [733], [737], [741], [745], [749], [753], [757], [761], [765], [769], [773], [777], [781], [785], [789], [793], [797], [801], [805], [809], [813], [817], [821], [825], [829], [833], [837], [841], [845], [849], [853], [856], [857], [861], [865], [869], [873], [877], [881], [885], [889], [893], [897], [901], [905], [909], [912], [913], [917], [921], [925], [929], [933], [937], [941], [945], [948], [1552], [1556], [1565], [1569], [1571], [1578], [1579], [1580], [1582], [1583] [2019-10-02 21:16:55,243 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 21:16:55,243 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 21:17:05,002 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 21:17:05,004 INFO L272 AbstractInterpreter]: Visited 144 different actions 144 times. Never merged. Never widened. Performed 315 root evaluator evaluations with a maximum evaluation depth of 14. Performed 315 inverse root evaluator evaluations with a maximum inverse evaluation depth of 14. Never found a fixpoint. Largest state had 24 variables. [2019-10-02 21:17:05,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 21:17:05,008 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 21:17:20,080 INFO L227 lantSequenceWeakener]: Weakened 396 states. On average, predicates are now at 77.57% of their original sizes. [2019-10-02 21:17:20,080 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 21:17:20,204 INFO L420 sIntCurrentIteration]: We unified 419 AI predicates to 419 [2019-10-02 21:17:20,205 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 21:17:20,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 21:17:20,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [6] total 16 [2019-10-02 21:17:20,209 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 21:17:20,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 21:17:20,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 21:17:20,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-10-02 21:17:20,210 INFO L87 Difference]: Start difference. First operand 13741 states and 17470 transitions. Second operand 12 states. [2019-10-02 21:17:49,575 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation.