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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-crafted/mapsum2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:00:43,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:00:43,953 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:00:43,965 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:00:43,966 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:00:43,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:00:43,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:00:43,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:00:43,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:00:43,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:00:43,973 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:00:43,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:00:43,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:00:43,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:00:43,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:00:43,978 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:00:43,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:00:43,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:00:43,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:00:43,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:00:43,984 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:00:43,985 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:00:43,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:00:43,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:00:43,989 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:00:43,989 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:00:43,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:00:43,990 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:00:43,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:00:43,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:00:43,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:00:43,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:00:43,993 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:00:43,994 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:00:43,995 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:00:43,995 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:00:43,996 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:00:43,996 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:00:43,996 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:00:43,997 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:00:43,997 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:00:43,998 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 22:00:44,013 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:00:44,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:00:44,014 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:00:44,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:00:44,015 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:00:44,015 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:00:44,015 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:00:44,015 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:00:44,016 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:00:44,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:00:44,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:00:44,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:00:44,016 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:00:44,016 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:00:44,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:00:44,017 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:00:44,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:00:44,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:00:44,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:00:44,018 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:00:44,018 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:00:44,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:00:44,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:00:44,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:00:44,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:00:44,019 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:00:44,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:00:44,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:00:44,019 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:00:44,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:00:44,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:00:44,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:00:44,067 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:00:44,067 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:00:44,068 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/mapsum2.i [2019-10-01 22:00:44,129 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f0540ff2/775610c76dc8401ea742e8d335362f01/FLAGd3a6cec7e [2019-10-01 22:00:44,541 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:00:44,541 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/mapsum2.i [2019-10-01 22:00:44,548 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f0540ff2/775610c76dc8401ea742e8d335362f01/FLAGd3a6cec7e [2019-10-01 22:00:44,971 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f0540ff2/775610c76dc8401ea742e8d335362f01 [2019-10-01 22:00:44,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:00:44,981 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:00:44,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:00:44,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:00:44,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:00:44,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:00:44" (1/1) ... [2019-10-01 22:00:44,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1806b3a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:44, skipping insertion in model container [2019-10-01 22:00:44,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:00:44" (1/1) ... [2019-10-01 22:00:44,999 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:00:45,017 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:00:45,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:00:45,248 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:00:45,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:00:45,364 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:00:45,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:45 WrapperNode [2019-10-01 22:00:45,364 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:00:45,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:00:45,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:00:45,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:00:45,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:45" (1/1) ... [2019-10-01 22:00:45,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:45" (1/1) ... [2019-10-01 22:00:45,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:45" (1/1) ... [2019-10-01 22:00:45,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:45" (1/1) ... [2019-10-01 22:00:45,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:45" (1/1) ... [2019-10-01 22:00:45,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:45" (1/1) ... [2019-10-01 22:00:45,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:45" (1/1) ... [2019-10-01 22:00:45,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:00:45,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:00:45,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:00:45,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:00:45,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:45" (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-01 22:00:45,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:00:45,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:00:45,464 INFO L138 BoogieDeclarations]: Found implementation of procedure mapsum [2019-10-01 22:00:45,464 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:00:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:00:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:00:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure mapsum [2019-10-01 22:00:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:00:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:00:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:00:45,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:00:45,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:00:45,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:00:45,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:00:45,750 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:00:45,750 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 22:00:45,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:00:45 BoogieIcfgContainer [2019-10-01 22:00:45,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:00:45,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:00:45,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:00:45,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:00:45,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:00:44" (1/3) ... [2019-10-01 22:00:45,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fc56cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:00:45, skipping insertion in model container [2019-10-01 22:00:45,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:00:45" (2/3) ... [2019-10-01 22:00:45,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16fc56cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:00:45, skipping insertion in model container [2019-10-01 22:00:45,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:00:45" (3/3) ... [2019-10-01 22:00:45,761 INFO L109 eAbstractionObserver]: Analyzing ICFG mapsum2.i [2019-10-01 22:00:45,778 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:00:45,785 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:00:45,800 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:00:45,826 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:00:45,827 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:00:45,827 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:00:45,827 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:00:45,828 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:00:45,828 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:00:45,828 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:00:45,828 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:00:45,828 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:00:45,847 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2019-10-01 22:00:45,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:00:45,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:45,853 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:45,855 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:45,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:45,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1283808693, now seen corresponding path program 1 times [2019-10-01 22:00:45,861 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:45,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:45,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:45,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:45,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 22:00:46,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:46,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:00:46,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:00:46,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:00:46,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:00:46,043 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2019-10-01 22:00:46,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:46,064 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2019-10-01 22:00:46,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:00:46,066 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-01 22:00:46,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:46,075 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:00:46,075 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 22:00:46,079 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:00:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 22:00:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-01 22:00:46,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-01 22:00:46,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-10-01 22:00:46,122 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32 [2019-10-01 22:00:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:46,122 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-10-01 22:00:46,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:00:46,123 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-10-01 22:00:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-01 22:00:46,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:46,125 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:46,126 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:46,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:46,126 INFO L82 PathProgramCache]: Analyzing trace with hash 721846027, now seen corresponding path program 1 times [2019-10-01 22:00:46,127 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:46,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:46,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:46,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:46,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:46,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-01 22:00:46,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:46,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:00:46,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:00:46,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:00:46,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:46,211 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states. [2019-10-01 22:00:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:46,253 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2019-10-01 22:00:46,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:46,254 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-01 22:00:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:46,255 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:00:46,256 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 22:00:46,257 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:46,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 22:00:46,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-01 22:00:46,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-01 22:00:46,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-01 22:00:46,264 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32 [2019-10-01 22:00:46,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:46,265 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-01 22:00:46,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:00:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-01 22:00:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-01 22:00:46,267 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:46,267 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:46,268 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:46,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:46,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1487444845, now seen corresponding path program 1 times [2019-10-01 22:00:46,268 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:46,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:46,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:46,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:46,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:46,336 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 22:00:46,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:46,336 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP 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-01 22:00:46,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:46,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-01 22:00:46,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:46,448 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-01 22:00:46,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 22:00:46,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-01 22:00:46,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-01 22:00:46,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-01 22:00:46,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-01 22:00:46,466 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 4 states. [2019-10-01 22:00:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:46,494 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2019-10-01 22:00:46,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:46,495 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-01 22:00:46,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:46,496 INFO L225 Difference]: With dead ends: 46 [2019-10-01 22:00:46,496 INFO L226 Difference]: Without dead ends: 29 [2019-10-01 22:00:46,497 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 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-01 22:00:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-01 22:00:46,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-01 22:00:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 22:00:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-10-01 22:00:46,503 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34 [2019-10-01 22:00:46,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:46,504 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-10-01 22:00:46,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-01 22:00:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-10-01 22:00:46,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-01 22:00:46,506 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:46,506 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:46,506 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:46,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:46,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2063023467, now seen corresponding path program 1 times [2019-10-01 22:00:46,507 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:46,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:46,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:46,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:46,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:46,614 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:46,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:00:46,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:00:46,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:00:46,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:00:46,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:46,617 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2019-10-01 22:00:46,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:46,641 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-10-01 22:00:46,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:00:46,643 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-01 22:00:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:46,645 INFO L225 Difference]: With dead ends: 43 [2019-10-01 22:00:46,645 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 22:00:46,645 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:00:46,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 22:00:46,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-01 22:00:46,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-01 22:00:46,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-10-01 22:00:46,652 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40 [2019-10-01 22:00:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:46,655 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-10-01 22:00:46,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:00:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-10-01 22:00:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-01 22:00:46,659 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:46,659 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-01 22:00:46,659 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:46,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:46,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1550668567, now seen corresponding path program 1 times [2019-10-01 22:00:46,660 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:46,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:46,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:46,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:46,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:46,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:46,757 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:46,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:46,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:46,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:46,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:46,873 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:46,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:46,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:00:46,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:00:46,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:00:46,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:00:46,880 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 5 states. [2019-10-01 22:00:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:46,905 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-01 22:00:46,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:00:46,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-10-01 22:00:46,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:46,906 INFO L225 Difference]: With dead ends: 52 [2019-10-01 22:00:46,906 INFO L226 Difference]: Without dead ends: 32 [2019-10-01 22:00:46,907 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:00:46,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-01 22:00:46,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-01 22:00:46,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-01 22:00:46,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-10-01 22:00:46,913 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 42 [2019-10-01 22:00:46,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:46,913 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-10-01 22:00:46,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:00:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-10-01 22:00:46,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-01 22:00:46,915 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:46,915 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:46,916 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:46,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:46,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1311885621, now seen corresponding path program 2 times [2019-10-01 22:00:46,916 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:46,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:46,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:46,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:46,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:47,034 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:47,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:47,035 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:47,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:47,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:47,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:47,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:47,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:47,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:47,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 22:00:47,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 22:00:47,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 22:00:47,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:00:47,142 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 6 states. [2019-10-01 22:00:47,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:47,174 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2019-10-01 22:00:47,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 22:00:47,174 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2019-10-01 22:00:47,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:47,175 INFO L225 Difference]: With dead ends: 54 [2019-10-01 22:00:47,175 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 22:00:47,176 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 22:00:47,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 22:00:47,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-10-01 22:00:47,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-01 22:00:47,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-01 22:00:47,182 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 44 [2019-10-01 22:00:47,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:47,182 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-01 22:00:47,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 22:00:47,182 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-01 22:00:47,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-01 22:00:47,183 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:47,184 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:47,184 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:47,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:47,184 INFO L82 PathProgramCache]: Analyzing trace with hash 525258797, now seen corresponding path program 3 times [2019-10-01 22:00:47,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:47,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:47,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:47,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:47,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 22:00:47,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:47,276 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:47,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:47,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-01 22:00:47,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:47,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:47,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-01 22:00:47,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:47,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-01 22:00:47,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:00:47,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:00:47,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:47,396 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 8 states. [2019-10-01 22:00:47,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:47,466 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2019-10-01 22:00:47,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 22:00:47,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2019-10-01 22:00:47,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:47,470 INFO L225 Difference]: With dead ends: 59 [2019-10-01 22:00:47,470 INFO L226 Difference]: Without dead ends: 39 [2019-10-01 22:00:47,471 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:47,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-01 22:00:47,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-10-01 22:00:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-01 22:00:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-10-01 22:00:47,481 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 46 [2019-10-01 22:00:47,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:47,482 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-10-01 22:00:47,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:00:47,482 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-10-01 22:00:47,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-01 22:00:47,483 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:47,485 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:47,486 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:47,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:47,486 INFO L82 PathProgramCache]: Analyzing trace with hash -174499699, now seen corresponding path program 4 times [2019-10-01 22:00:47,486 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:47,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:47,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:47,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:47,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:47,628 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:00:47,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:47,629 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:47,655 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:47,704 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:47,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:47,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:00:47,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:00:47,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:47,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 22:00:47,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 22:00:47,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 22:00:47,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:47,738 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-10-01 22:00:47,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:47,799 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2019-10-01 22:00:47,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:00:47,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-10-01 22:00:47,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:47,801 INFO L225 Difference]: With dead ends: 62 [2019-10-01 22:00:47,801 INFO L226 Difference]: Without dead ends: 40 [2019-10-01 22:00:47,802 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 22:00:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-01 22:00:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-10-01 22:00:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-01 22:00:47,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-10-01 22:00:47,814 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 54 [2019-10-01 22:00:47,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:47,814 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-10-01 22:00:47,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 22:00:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-10-01 22:00:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-01 22:00:47,815 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:47,815 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:47,816 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:47,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:47,817 INFO L82 PathProgramCache]: Analyzing trace with hash 830152559, now seen corresponding path program 5 times [2019-10-01 22:00:47,817 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:47,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:47,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:47,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:47,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:47,961 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-01 22:00:47,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:47,962 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:47,993 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:48,057 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:00:48,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:48,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:48,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:48,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:48,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-01 22:00:48,122 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:48,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:48,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:48,123 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 11 states. [2019-10-01 22:00:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:48,181 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2019-10-01 22:00:48,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:48,182 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-10-01 22:00:48,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:48,183 INFO L225 Difference]: With dead ends: 67 [2019-10-01 22:00:48,183 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 22:00:48,184 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:48,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 22:00:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2019-10-01 22:00:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 22:00:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-10-01 22:00:48,190 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 56 [2019-10-01 22:00:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:48,190 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-10-01 22:00:48,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-10-01 22:00:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-10-01 22:00:48,191 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:48,192 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:48,192 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:48,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:48,192 INFO L82 PathProgramCache]: Analyzing trace with hash 968039375, now seen corresponding path program 6 times [2019-10-01 22:00:48,193 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:48,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:48,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-01 22:00:48,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:48,285 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:48,315 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:00:48,357 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-01 22:00:48,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:48,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:00:48,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:48,406 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-01 22:00:48,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:48,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-10-01 22:00:48,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:48,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:48,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:48,412 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 11 states. [2019-10-01 22:00:48,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:48,460 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2019-10-01 22:00:48,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:48,461 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-10-01 22:00:48,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:48,462 INFO L225 Difference]: With dead ends: 73 [2019-10-01 22:00:48,462 INFO L226 Difference]: Without dead ends: 49 [2019-10-01 22:00:48,462 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:48,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-01 22:00:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2019-10-01 22:00:48,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-01 22:00:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2019-10-01 22:00:48,468 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 64 [2019-10-01 22:00:48,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:48,469 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2019-10-01 22:00:48,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:48,469 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2019-10-01 22:00:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-01 22:00:48,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:48,470 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:48,471 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash -117250513, now seen corresponding path program 7 times [2019-10-01 22:00:48,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:48,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:48,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:00:48,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:48,582 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:48,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:00:48,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:00:48,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:48,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:00:48,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:00:48,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:00:48,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:48,687 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 11 states. [2019-10-01 22:00:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:48,739 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2019-10-01 22:00:48,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:00:48,739 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2019-10-01 22:00:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:48,740 INFO L225 Difference]: With dead ends: 76 [2019-10-01 22:00:48,740 INFO L226 Difference]: Without dead ends: 50 [2019-10-01 22:00:48,741 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:00:48,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-01 22:00:48,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-10-01 22:00:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-01 22:00:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2019-10-01 22:00:48,747 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 68 [2019-10-01 22:00:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:48,747 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2019-10-01 22:00:48,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:00:48,748 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2019-10-01 22:00:48,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-10-01 22:00:48,749 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:48,749 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:48,749 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:48,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:48,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1594227089, now seen corresponding path program 8 times [2019-10-01 22:00:48,750 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:48,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:48,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:48,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:00:48,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:48,871 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:48,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:48,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:48,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:48,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:00:48,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:00:48,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:48,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:00:48,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:00:48,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:00:48,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:00:48,996 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 12 states. [2019-10-01 22:00:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,049 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2019-10-01 22:00:49,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:00:49,050 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 70 [2019-10-01 22:00:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,051 INFO L225 Difference]: With dead ends: 78 [2019-10-01 22:00:49,051 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 22:00:49,052 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:00:49,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 22:00:49,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2019-10-01 22:00:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 22:00:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2019-10-01 22:00:49,058 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 70 [2019-10-01 22:00:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,058 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2019-10-01 22:00:49,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:00:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2019-10-01 22:00:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-01 22:00:49,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,060 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:49,060 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1351728243, now seen corresponding path program 9 times [2019-10-01 22:00:49,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:49,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-01 22:00:49,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:49,173 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:49,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:49,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-01 22:00:49,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:49,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:00:49,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 58 proven. 4 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:49,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:49,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5] total 15 [2019-10-01 22:00:49,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 22:00:49,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 22:00:49,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:00:49,280 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 15 states. [2019-10-01 22:00:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,378 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2019-10-01 22:00:49,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-01 22:00:49,379 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2019-10-01 22:00:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,380 INFO L225 Difference]: With dead ends: 83 [2019-10-01 22:00:49,380 INFO L226 Difference]: Without dead ends: 57 [2019-10-01 22:00:49,381 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-10-01 22:00:49,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-01 22:00:49,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2019-10-01 22:00:49,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-01 22:00:49,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2019-10-01 22:00:49,387 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 72 [2019-10-01 22:00:49,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,387 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2019-10-01 22:00:49,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 22:00:49,387 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2019-10-01 22:00:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 22:00:49,388 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,388 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:49,389 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1743973331, now seen corresponding path program 10 times [2019-10-01 22:00:49,389 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:49,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-10-01 22:00:49,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:49,530 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:49,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:49,598 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:49,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:49,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:00:49,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 56 proven. 9 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2019-10-01 22:00:49,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:49,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-10-01 22:00:49,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:00:49,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:00:49,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:49,656 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 17 states. [2019-10-01 22:00:49,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:49,742 INFO L93 Difference]: Finished difference Result 89 states and 101 transitions. [2019-10-01 22:00:49,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:00:49,744 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 76 [2019-10-01 22:00:49,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:49,745 INFO L225 Difference]: With dead ends: 89 [2019-10-01 22:00:49,745 INFO L226 Difference]: Without dead ends: 61 [2019-10-01 22:00:49,748 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-01 22:00:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-01 22:00:49,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-01 22:00:49,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2019-10-01 22:00:49,763 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 76 [2019-10-01 22:00:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:49,764 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2019-10-01 22:00:49,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:00:49,764 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2019-10-01 22:00:49,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-01 22:00:49,765 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:49,765 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:49,765 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:49,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:49,766 INFO L82 PathProgramCache]: Analyzing trace with hash -506591693, now seen corresponding path program 11 times [2019-10-01 22:00:49,766 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:49,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:49,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:49,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:49,929 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-10-01 22:00:49,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:49,929 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:49,947 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:00:50,152 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-01 22:00:50,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:50,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:00:50,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 84 proven. 16 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2019-10-01 22:00:50,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:50,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 19 [2019-10-01 22:00:50,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:00:50,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:00:50,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:50,249 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand 19 states. [2019-10-01 22:00:50,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:50,320 INFO L93 Difference]: Finished difference Result 95 states and 107 transitions. [2019-10-01 22:00:50,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:50,320 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 84 [2019-10-01 22:00:50,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:50,321 INFO L225 Difference]: With dead ends: 95 [2019-10-01 22:00:50,322 INFO L226 Difference]: Without dead ends: 65 [2019-10-01 22:00:50,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-01 22:00:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2019-10-01 22:00:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-01 22:00:50,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-10-01 22:00:50,335 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 84 [2019-10-01 22:00:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:50,335 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-10-01 22:00:50,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:00:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-10-01 22:00:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-01 22:00:50,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:50,337 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:50,337 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:50,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:50,337 INFO L82 PathProgramCache]: Analyzing trace with hash -416573805, now seen corresponding path program 12 times [2019-10-01 22:00:50,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:50,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:50,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:50,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-01 22:00:50,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:50,528 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:50,556 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:00:50,692 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-01 22:00:50,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:50,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:00:50,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 423 backedges. 130 proven. 9 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-10-01 22:00:50,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:50,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-10-01 22:00:50,757 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 22:00:50,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 22:00:50,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:50,758 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 19 states. [2019-10-01 22:00:50,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:50,858 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-10-01 22:00:50,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:50,859 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 92 [2019-10-01 22:00:50,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:50,860 INFO L225 Difference]: With dead ends: 101 [2019-10-01 22:00:50,860 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 22:00:50,861 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-10-01 22:00:50,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 22:00:50,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-01 22:00:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-01 22:00:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2019-10-01 22:00:50,867 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 92 [2019-10-01 22:00:50,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:50,867 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2019-10-01 22:00:50,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 22:00:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2019-10-01 22:00:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-01 22:00:50,869 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:50,869 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:50,869 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:50,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:50,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1508563187, now seen corresponding path program 13 times [2019-10-01 22:00:50,870 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:50,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:50,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:50,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:51,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:51,105 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:51,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:00:51,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:51,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:51,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:00:51,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:00:51,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:00:51,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:51,231 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2019-10-01 22:00:51,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:51,294 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2019-10-01 22:00:51,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:00:51,295 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2019-10-01 22:00:51,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:51,296 INFO L225 Difference]: With dead ends: 104 [2019-10-01 22:00:51,296 INFO L226 Difference]: Without dead ends: 70 [2019-10-01 22:00:51,297 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:00:51,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-01 22:00:51,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2019-10-01 22:00:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 22:00:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2019-10-01 22:00:51,303 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 96 [2019-10-01 22:00:51,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:51,304 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2019-10-01 22:00:51,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:00:51,304 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2019-10-01 22:00:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-01 22:00:51,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:51,306 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:51,306 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:51,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:51,307 INFO L82 PathProgramCache]: Analyzing trace with hash 737731925, now seen corresponding path program 14 times [2019-10-01 22:00:51,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:51,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:51,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:51,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:51,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:51,545 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:51,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:51,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:51,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:51,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:00:51,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:51,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:51,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:00:51,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:00:51,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:00:51,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:00:51,659 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 18 states. [2019-10-01 22:00:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:51,715 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-10-01 22:00:51,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:00:51,715 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 98 [2019-10-01 22:00:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:51,716 INFO L225 Difference]: With dead ends: 106 [2019-10-01 22:00:51,716 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 22:00:51,717 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:00:51,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 22:00:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2019-10-01 22:00:51,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-01 22:00:51,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2019-10-01 22:00:51,729 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 98 [2019-10-01 22:00:51,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:51,729 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2019-10-01 22:00:51,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:00:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2019-10-01 22:00:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-01 22:00:51,730 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:51,731 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:51,731 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:51,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:51,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1296735945, now seen corresponding path program 15 times [2019-10-01 22:00:51,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:51,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:51,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:51,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:51,932 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 22:00:51,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:51,933 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:00:51,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:52,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 22:00:52,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:52,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:00:52,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:52,174 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 128 proven. 25 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2019-10-01 22:00:52,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:52,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 8] total 24 [2019-10-01 22:00:52,184 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:00:52,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:00:52,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:52,186 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 24 states. [2019-10-01 22:00:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:52,321 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2019-10-01 22:00:52,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:00:52,322 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 100 [2019-10-01 22:00:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:52,326 INFO L225 Difference]: With dead ends: 111 [2019-10-01 22:00:52,326 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 22:00:52,327 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 22:00:52,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-01 22:00:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-01 22:00:52,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2019-10-01 22:00:52,337 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 100 [2019-10-01 22:00:52,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:52,338 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2019-10-01 22:00:52,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:00:52,338 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2019-10-01 22:00:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-01 22:00:52,339 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:52,339 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:52,340 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:52,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:52,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1648969321, now seen corresponding path program 16 times [2019-10-01 22:00:52,340 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:52,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:52,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:52,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:52,580 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 22:00:52,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:52,581 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:52,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:52,672 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:52,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:52,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:00:52,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 22:00:52,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:52,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 22:00:52,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:00:52,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:00:52,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:00:52,706 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand 20 states. [2019-10-01 22:00:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:52,767 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-10-01 22:00:52,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 22:00:52,768 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2019-10-01 22:00:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:52,769 INFO L225 Difference]: With dead ends: 114 [2019-10-01 22:00:52,769 INFO L226 Difference]: Without dead ends: 78 [2019-10-01 22:00:52,770 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:00:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-01 22:00:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-10-01 22:00:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-01 22:00:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2019-10-01 22:00:52,774 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 108 [2019-10-01 22:00:52,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:52,774 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2019-10-01 22:00:52,774 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:00:52,775 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2019-10-01 22:00:52,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-01 22:00:52,776 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:52,776 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:52,776 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:52,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:52,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1027293945, now seen corresponding path program 17 times [2019-10-01 22:00:52,777 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:52,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:52,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:52,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:53,001 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-10-01 22:00:53,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:53,001 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:53,039 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:00:53,767 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2019-10-01 22:00:53,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:53,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-01 22:00:53,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:53,909 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 172 proven. 36 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:00:53,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:53,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 9] total 27 [2019-10-01 22:00:53,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 22:00:53,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 22:00:53,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:00:53,917 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 27 states. [2019-10-01 22:00:54,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:54,014 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2019-10-01 22:00:54,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-10-01 22:00:54,014 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2019-10-01 22:00:54,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:54,015 INFO L225 Difference]: With dead ends: 119 [2019-10-01 22:00:54,015 INFO L226 Difference]: Without dead ends: 83 [2019-10-01 22:00:54,016 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2019-10-01 22:00:54,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-01 22:00:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-10-01 22:00:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-01 22:00:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-10-01 22:00:54,021 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 110 [2019-10-01 22:00:54,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:54,021 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-10-01 22:00:54,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 22:00:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-10-01 22:00:54,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-01 22:00:54,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:54,022 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:54,023 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:54,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:54,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1680928935, now seen corresponding path program 18 times [2019-10-01 22:00:54,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:54,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:54,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:54,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 514 trivial. 0 not checked. [2019-10-01 22:00:54,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:54,278 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:54,300 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:00:54,672 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-10-01 22:00:54,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:54,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:00:54,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 234 proven. 16 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-10-01 22:00:54,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:54,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7] total 26 [2019-10-01 22:00:54,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:00:54,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:00:54,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:00:54,773 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 26 states. [2019-10-01 22:00:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:54,895 INFO L93 Difference]: Finished difference Result 125 states and 134 transitions. [2019-10-01 22:00:54,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:00:54,898 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2019-10-01 22:00:54,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:54,899 INFO L225 Difference]: With dead ends: 125 [2019-10-01 22:00:54,899 INFO L226 Difference]: Without dead ends: 87 [2019-10-01 22:00:54,900 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=230, Invalid=420, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:00:54,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-10-01 22:00:54,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2019-10-01 22:00:54,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-01 22:00:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2019-10-01 22:00:54,909 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 118 [2019-10-01 22:00:54,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:54,909 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2019-10-01 22:00:54,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:00:54,910 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2019-10-01 22:00:54,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 22:00:54,912 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:54,912 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 19, 19, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:54,912 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:54,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:54,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1116806727, now seen corresponding path program 19 times [2019-10-01 22:00:54,913 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:54,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:54,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:54,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:55,206 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:55,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:55,207 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:55,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:55,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 22:00:55,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:55,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:55,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 22:00:55,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 22:00:55,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 22:00:55,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:00:55,364 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 23 states. [2019-10-01 22:00:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:55,434 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2019-10-01 22:00:55,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:00:55,434 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 122 [2019-10-01 22:00:55,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:55,435 INFO L225 Difference]: With dead ends: 128 [2019-10-01 22:00:55,435 INFO L226 Difference]: Without dead ends: 88 [2019-10-01 22:00:55,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 22:00:55,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-01 22:00:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-01 22:00:55,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-01 22:00:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2019-10-01 22:00:55,443 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 122 [2019-10-01 22:00:55,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:55,443 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2019-10-01 22:00:55,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 22:00:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2019-10-01 22:00:55,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-01 22:00:55,444 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:55,445 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:55,445 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:55,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:55,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1211213925, now seen corresponding path program 20 times [2019-10-01 22:00:55,445 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:55,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:55,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:00:55,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:55,755 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:55,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:55,756 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:55,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:00:55,853 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:00:55,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:55,855 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:00:55,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:55,884 INFO L134 CoverageAnalysis]: Checked inductivity of 923 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:55,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:55,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 22:00:55,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:00:55,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:00:55,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:55,890 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand 24 states. [2019-10-01 22:00:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:55,966 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2019-10-01 22:00:55,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:00:55,967 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 124 [2019-10-01 22:00:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:55,967 INFO L225 Difference]: With dead ends: 130 [2019-10-01 22:00:55,968 INFO L226 Difference]: Without dead ends: 90 [2019-10-01 22:00:55,968 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:00:55,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-01 22:00:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-01 22:00:55,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-01 22:00:55,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2019-10-01 22:00:55,973 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 124 [2019-10-01 22:00:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:55,973 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2019-10-01 22:00:55,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:00:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2019-10-01 22:00:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-01 22:00:55,974 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:55,975 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:55,975 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:55,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:55,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1742217987, now seen corresponding path program 21 times [2019-10-01 22:00:55,975 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:55,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:55,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:55,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:55,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2019-10-01 22:00:56,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:56,320 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:56,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:00:56,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 22:00:56,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:56,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 22:00:56,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 964 backedges. 234 proven. 25 refuted. 0 times theorem prover too weak. 705 trivial. 0 not checked. [2019-10-01 22:00:56,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:56,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8] total 30 [2019-10-01 22:00:56,545 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:00:56,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:00:56,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:00:56,546 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 30 states. [2019-10-01 22:00:56,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:56,674 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2019-10-01 22:00:56,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 22:00:56,675 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2019-10-01 22:00:56,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:56,676 INFO L225 Difference]: With dead ends: 135 [2019-10-01 22:00:56,676 INFO L226 Difference]: Without dead ends: 95 [2019-10-01 22:00:56,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=303, Invalid=567, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:00:56,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-01 22:00:56,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2019-10-01 22:00:56,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-01 22:00:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 97 transitions. [2019-10-01 22:00:56,681 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 97 transitions. Word has length 126 [2019-10-01 22:00:56,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:56,681 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 97 transitions. [2019-10-01 22:00:56,682 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:00:56,682 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 97 transitions. [2019-10-01 22:00:56,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-01 22:00:56,683 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:56,683 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:56,683 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:56,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:56,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2078845859, now seen corresponding path program 22 times [2019-10-01 22:00:56,684 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:56,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:56,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:56,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 22:00:57,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:57,026 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:57,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:00:57,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:00:57,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:00:57,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 22:00:57,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:00:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1018 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 22:00:57,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:00:57,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 22:00:57,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:00:57,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:00:57,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:00:57,182 INFO L87 Difference]: Start difference. First operand 93 states and 97 transitions. Second operand 26 states. [2019-10-01 22:00:57,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:00:57,255 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2019-10-01 22:00:57,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 22:00:57,257 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 130 [2019-10-01 22:00:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:00:57,258 INFO L225 Difference]: With dead ends: 138 [2019-10-01 22:00:57,258 INFO L226 Difference]: Without dead ends: 96 [2019-10-01 22:00:57,258 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:00:57,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-01 22:00:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2019-10-01 22:00:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-01 22:00:57,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 99 transitions. [2019-10-01 22:00:57,264 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 99 transitions. Word has length 130 [2019-10-01 22:00:57,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:00:57,264 INFO L475 AbstractCegarLoop]: Abstraction has 95 states and 99 transitions. [2019-10-01 22:00:57,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:00:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 99 transitions. [2019-10-01 22:00:57,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-01 22:00:57,266 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:00:57,266 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:00:57,266 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:00:57,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:00:57,267 INFO L82 PathProgramCache]: Analyzing trace with hash -627324865, now seen corresponding path program 23 times [2019-10-01 22:00:57,267 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:00:57,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:00:57,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,268 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:00:57,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:00:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:00:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-10-01 22:00:57,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:00:57,681 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:00:57,712 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:01:02,763 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-10-01 22:01:02,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:02,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:01:02,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 228 proven. 49 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-10-01 22:01:02,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:02,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2019-10-01 22:01:02,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:01:02,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:01:02,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:01:02,924 INFO L87 Difference]: Start difference. First operand 95 states and 99 transitions. Second operand 34 states. [2019-10-01 22:01:03,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:03,094 INFO L93 Difference]: Finished difference Result 143 states and 155 transitions. [2019-10-01 22:01:03,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:01:03,095 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 132 [2019-10-01 22:01:03,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:03,096 INFO L225 Difference]: With dead ends: 143 [2019-10-01 22:01:03,096 INFO L226 Difference]: Without dead ends: 101 [2019-10-01 22:01:03,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=369, Invalid=753, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:01:03,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-01 22:01:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2019-10-01 22:01:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-01 22:01:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 103 transitions. [2019-10-01 22:01:03,104 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 103 transitions. Word has length 132 [2019-10-01 22:01:03,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:03,105 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 103 transitions. [2019-10-01 22:01:03,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:01:03,105 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2019-10-01 22:01:03,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-01 22:01:03,109 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:03,110 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:03,110 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:03,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:03,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1976094561, now seen corresponding path program 24 times [2019-10-01 22:01:03,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:03,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:03,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:03,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:03,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2019-10-01 22:01:03,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:03,538 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:03,571 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:01:04,052 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2019-10-01 22:01:04,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:04,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:01:04,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 298 proven. 36 refuted. 0 times theorem prover too weak. 917 trivial. 0 not checked. [2019-10-01 22:01:04,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:04,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 9] total 34 [2019-10-01 22:01:04,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:01:04,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:01:04,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:01:04,227 INFO L87 Difference]: Start difference. First operand 99 states and 103 transitions. Second operand 34 states. [2019-10-01 22:01:04,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:04,335 INFO L93 Difference]: Finished difference Result 149 states and 158 transitions. [2019-10-01 22:01:04,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:01:04,336 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 140 [2019-10-01 22:01:04,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:04,337 INFO L225 Difference]: With dead ends: 149 [2019-10-01 22:01:04,337 INFO L226 Difference]: Without dead ends: 105 [2019-10-01 22:01:04,338 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=386, Invalid=736, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:01:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-01 22:01:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-10-01 22:01:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-01 22:01:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 107 transitions. [2019-10-01 22:01:04,342 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 107 transitions. Word has length 140 [2019-10-01 22:01:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:04,342 INFO L475 AbstractCegarLoop]: Abstraction has 103 states and 107 transitions. [2019-10-01 22:01:04,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:01:04,343 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2019-10-01 22:01:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-01 22:01:04,344 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:04,344 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:04,344 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:04,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1521279999, now seen corresponding path program 25 times [2019-10-01 22:01:04,345 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:04,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:04,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:04,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:04,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:04,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:04,705 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:04,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:04,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:01:04,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1313 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:04,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:04,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 22:01:04,846 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 22:01:04,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 22:01:04,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:01:04,846 INFO L87 Difference]: Start difference. First operand 103 states and 107 transitions. Second operand 29 states. [2019-10-01 22:01:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:04,945 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-10-01 22:01:04,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 22:01:04,946 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 144 [2019-10-01 22:01:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:04,947 INFO L225 Difference]: With dead ends: 152 [2019-10-01 22:01:04,947 INFO L226 Difference]: Without dead ends: 106 [2019-10-01 22:01:04,948 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 22:01:04,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-10-01 22:01:04,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-10-01 22:01:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-01 22:01:04,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 109 transitions. [2019-10-01 22:01:04,953 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 109 transitions. Word has length 144 [2019-10-01 22:01:04,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:04,953 INFO L475 AbstractCegarLoop]: Abstraction has 105 states and 109 transitions. [2019-10-01 22:01:04,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 22:01:04,953 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2019-10-01 22:01:04,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-01 22:01:04,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:04,954 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:04,955 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:04,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:04,955 INFO L82 PathProgramCache]: Analyzing trace with hash -559946655, now seen corresponding path program 26 times [2019-10-01 22:01:04,955 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:04,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:04,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:04,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:04,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:04,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:05,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:05,397 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:05,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:01:05,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:01:05,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:05,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:01:05,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1364 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:05,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:05,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 22:01:05,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 22:01:05,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 22:01:05,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:01:05,572 INFO L87 Difference]: Start difference. First operand 105 states and 109 transitions. Second operand 30 states. [2019-10-01 22:01:05,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:05,655 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2019-10-01 22:01:05,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 22:01:05,655 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-10-01 22:01:05,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:05,656 INFO L225 Difference]: With dead ends: 154 [2019-10-01 22:01:05,657 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 22:01:05,658 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 22:01:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 22:01:05,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-10-01 22:01:05,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-01 22:01:05,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 111 transitions. [2019-10-01 22:01:05,662 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 111 transitions. Word has length 146 [2019-10-01 22:01:05,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:05,663 INFO L475 AbstractCegarLoop]: Abstraction has 107 states and 111 transitions. [2019-10-01 22:01:05,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 22:01:05,663 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2019-10-01 22:01:05,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-01 22:01:05,664 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:05,664 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 24, 24, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:05,664 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:05,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:05,665 INFO L82 PathProgramCache]: Analyzing trace with hash 835998787, now seen corresponding path program 27 times [2019-10-01 22:01:05,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:05,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:05,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:05,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:05,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:01:06,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:06,125 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:06,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:01:06,259 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 22:01:06,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:06,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:01:06,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:06,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 298 proven. 49 refuted. 0 times theorem prover too weak. 1070 trivial. 0 not checked. [2019-10-01 22:01:06,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:06,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 10] total 38 [2019-10-01 22:01:06,431 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:01:06,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:01:06,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:01:06,433 INFO L87 Difference]: Start difference. First operand 107 states and 111 transitions. Second operand 38 states. [2019-10-01 22:01:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:06,591 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2019-10-01 22:01:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 22:01:06,592 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 148 [2019-10-01 22:01:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:06,593 INFO L225 Difference]: With dead ends: 159 [2019-10-01 22:01:06,593 INFO L226 Difference]: Without dead ends: 113 [2019-10-01 22:01:06,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=479, Invalid=927, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:01:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-01 22:01:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-10-01 22:01:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-10-01 22:01:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-10-01 22:01:06,598 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 148 [2019-10-01 22:01:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:06,599 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-10-01 22:01:06,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:01:06,599 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-10-01 22:01:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-01 22:01:06,600 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:06,600 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 24, 24, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:06,600 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:06,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:06,601 INFO L82 PathProgramCache]: Analyzing trace with hash 894020771, now seen corresponding path program 28 times [2019-10-01 22:01:06,601 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:06,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:06,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:06,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:06,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-10-01 22:01:07,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:07,214 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:07,253 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:01:07,324 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:01:07,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:07,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:01:07,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1487 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-10-01 22:01:07,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:07,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 40 [2019-10-01 22:01:07,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-01 22:01:07,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-01 22:01:07,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:01:07,510 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 40 states. [2019-10-01 22:01:07,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:07,648 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2019-10-01 22:01:07,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:01:07,648 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 152 [2019-10-01 22:01:07,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:07,649 INFO L225 Difference]: With dead ends: 165 [2019-10-01 22:01:07,649 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 22:01:07,650 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=519, Invalid=1041, Unknown=0, NotChecked=0, Total=1560 [2019-10-01 22:01:07,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 22:01:07,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-10-01 22:01:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 22:01:07,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 119 transitions. [2019-10-01 22:01:07,655 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 119 transitions. Word has length 152 [2019-10-01 22:01:07,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:07,655 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 119 transitions. [2019-10-01 22:01:07,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-01 22:01:07,656 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 119 transitions. [2019-10-01 22:01:07,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-01 22:01:07,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:07,657 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 27, 27, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:07,657 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:07,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:07,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1573539069, now seen corresponding path program 29 times [2019-10-01 22:01:07,657 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:07,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:07,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:07,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 862 trivial. 0 not checked. [2019-10-01 22:01:08,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:08,104 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:08,144 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:01:24,128 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-10-01 22:01:24,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:24,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:01:24,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 364 proven. 81 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2019-10-01 22:01:24,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:24,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 12] total 42 [2019-10-01 22:01:24,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:01:24,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:01:24,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:01:24,356 INFO L87 Difference]: Start difference. First operand 115 states and 119 transitions. Second operand 42 states. [2019-10-01 22:01:24,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:24,540 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2019-10-01 22:01:24,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 22:01:24,540 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 160 [2019-10-01 22:01:24,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:24,541 INFO L225 Difference]: With dead ends: 171 [2019-10-01 22:01:24,541 INFO L226 Difference]: Without dead ends: 121 [2019-10-01 22:01:24,543 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=1161, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:01:24,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-10-01 22:01:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2019-10-01 22:01:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-01 22:01:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-10-01 22:01:24,549 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 160 [2019-10-01 22:01:24,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:24,549 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-10-01 22:01:24,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:01:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-10-01 22:01:24,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-01 22:01:24,550 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:24,551 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:24,551 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:24,551 INFO L82 PathProgramCache]: Analyzing trace with hash -451694749, now seen corresponding path program 30 times [2019-10-01 22:01:24,551 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:24,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:24,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:24,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:24,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:25,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2019-10-01 22:01:25,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:25,255 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:25,303 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:01:26,690 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-10-01 22:01:26,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:26,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:01:26,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1939 backedges. 450 proven. 64 refuted. 0 times theorem prover too weak. 1425 trivial. 0 not checked. [2019-10-01 22:01:26,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:26,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 11] total 42 [2019-10-01 22:01:26,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:01:26,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:01:26,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:01:26,884 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 42 states. [2019-10-01 22:01:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:27,053 INFO L93 Difference]: Finished difference Result 177 states and 186 transitions. [2019-10-01 22:01:27,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-01 22:01:27,053 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 168 [2019-10-01 22:01:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:27,054 INFO L225 Difference]: With dead ends: 177 [2019-10-01 22:01:27,054 INFO L226 Difference]: Without dead ends: 125 [2019-10-01 22:01:27,055 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=582, Invalid=1140, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:01:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-10-01 22:01:27,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2019-10-01 22:01:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-10-01 22:01:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 127 transitions. [2019-10-01 22:01:27,060 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 127 transitions. Word has length 168 [2019-10-01 22:01:27,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:27,061 INFO L475 AbstractCegarLoop]: Abstraction has 123 states and 127 transitions. [2019-10-01 22:01:27,061 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:01:27,061 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 127 transitions. [2019-10-01 22:01:27,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-01 22:01:27,062 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:27,062 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:27,062 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:27,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:27,063 INFO L82 PathProgramCache]: Analyzing trace with hash 853170883, now seen corresponding path program 31 times [2019-10-01 22:01:27,063 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:27,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:27,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:27,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:27,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:27,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:27,697 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:27,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:27,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 22:01:27,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:27,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:27,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 22:01:27,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 22:01:27,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 22:01:27,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:01:27,874 INFO L87 Difference]: Start difference. First operand 123 states and 127 transitions. Second operand 35 states. [2019-10-01 22:01:27,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:27,982 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2019-10-01 22:01:27,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:01:27,983 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 172 [2019-10-01 22:01:27,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:27,985 INFO L225 Difference]: With dead ends: 180 [2019-10-01 22:01:27,985 INFO L226 Difference]: Without dead ends: 126 [2019-10-01 22:01:27,985 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 22:01:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-10-01 22:01:27,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2019-10-01 22:01:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 22:01:27,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 129 transitions. [2019-10-01 22:01:27,991 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 129 transitions. Word has length 172 [2019-10-01 22:01:27,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:27,992 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 129 transitions. [2019-10-01 22:01:27,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 22:01:27,992 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 129 transitions. [2019-10-01 22:01:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-01 22:01:27,993 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:27,993 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:27,993 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:27,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:27,994 INFO L82 PathProgramCache]: Analyzing trace with hash -320678875, now seen corresponding path program 32 times [2019-10-01 22:01:27,994 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:27,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:27,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:01:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:28,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:28,815 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:28,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:01:28,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:01:28,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:28,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 22:01:28,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:29,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:29,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:29,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 22:01:29,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 22:01:29,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 22:01:29,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:01:29,007 INFO L87 Difference]: Start difference. First operand 125 states and 129 transitions. Second operand 36 states. [2019-10-01 22:01:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:29,117 INFO L93 Difference]: Finished difference Result 182 states and 190 transitions. [2019-10-01 22:01:29,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 22:01:29,118 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 174 [2019-10-01 22:01:29,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:29,120 INFO L225 Difference]: With dead ends: 182 [2019-10-01 22:01:29,120 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 22:01:29,121 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 22:01:29,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 22:01:29,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-10-01 22:01:29,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-01 22:01:29,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-10-01 22:01:29,128 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 174 [2019-10-01 22:01:29,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:29,129 INFO L475 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-10-01 22:01:29,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 22:01:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-10-01 22:01:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-01 22:01:29,131 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:29,131 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 30, 30, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:29,131 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:29,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:29,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1186102535, now seen corresponding path program 33 times [2019-10-01 22:01:29,132 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:29,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:29,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:29,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2019-10-01 22:01:29,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:29,922 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:29,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:01:30,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-10-01 22:01:30,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:30,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:01:30,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 450 proven. 81 refuted. 0 times theorem prover too weak. 1614 trivial. 0 not checked. [2019-10-01 22:01:30,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:30,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 12] total 46 [2019-10-01 22:01:30,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-10-01 22:01:30,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-10-01 22:01:30,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:01:30,355 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 46 states. [2019-10-01 22:01:30,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:30,525 INFO L93 Difference]: Finished difference Result 187 states and 196 transitions. [2019-10-01 22:01:30,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:01:30,526 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 176 [2019-10-01 22:01:30,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:30,527 INFO L225 Difference]: With dead ends: 187 [2019-10-01 22:01:30,527 INFO L226 Difference]: Without dead ends: 133 [2019-10-01 22:01:30,528 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=695, Invalid=1375, Unknown=0, NotChecked=0, Total=2070 [2019-10-01 22:01:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-01 22:01:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2019-10-01 22:01:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-10-01 22:01:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2019-10-01 22:01:30,535 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 176 [2019-10-01 22:01:30,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:30,537 INFO L475 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2019-10-01 22:01:30,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-10-01 22:01:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2019-10-01 22:01:30,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-10-01 22:01:30,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:30,539 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 30, 30, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:30,540 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:30,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:30,540 INFO L82 PathProgramCache]: Analyzing trace with hash 854412647, now seen corresponding path program 34 times [2019-10-01 22:01:30,540 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:30,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:30,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:30,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:30,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1075 trivial. 0 not checked. [2019-10-01 22:01:31,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:31,280 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:31,326 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:01:31,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:01:31,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:01:31,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:01:31,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:01:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 450 proven. 100 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-10-01 22:01:31,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:01:31,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 13] total 48 [2019-10-01 22:01:31,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:01:31,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:01:31,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:01:31,731 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand 48 states. [2019-10-01 22:01:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:01:32,002 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2019-10-01 22:01:32,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-10-01 22:01:32,002 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 180 [2019-10-01 22:01:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:01:32,004 INFO L225 Difference]: With dead ends: 193 [2019-10-01 22:01:32,004 INFO L226 Difference]: Without dead ends: 137 [2019-10-01 22:01:32,005 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=743, Invalid=1513, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:01:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-10-01 22:01:32,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2019-10-01 22:01:32,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-10-01 22:01:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 139 transitions. [2019-10-01 22:01:32,010 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 139 transitions. Word has length 180 [2019-10-01 22:01:32,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:01:32,011 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 139 transitions. [2019-10-01 22:01:32,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:01:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 139 transitions. [2019-10-01 22:01:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-01 22:01:32,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:01:32,013 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 30, 30, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:01:32,013 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:01:32,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:01:32,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1113930553, now seen corresponding path program 35 times [2019-10-01 22:01:32,013 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:01:32,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:01:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:32,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:01:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:01:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:01:32,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2019-10-01 22:01:32,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:01:32,855 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:01:32,937 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:02:16,901 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 35 check-sat command(s) [2019-10-01 22:02:16,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:16,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 22:02:16,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:17,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2321 backedges. 444 proven. 100 refuted. 0 times theorem prover too weak. 1777 trivial. 0 not checked. [2019-10-01 22:02:17,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:17,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 13] total 49 [2019-10-01 22:02:17,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 22:02:17,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 22:02:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:02:17,189 INFO L87 Difference]: Start difference. First operand 135 states and 139 transitions. Second operand 49 states. [2019-10-01 22:02:17,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:17,396 INFO L93 Difference]: Finished difference Result 199 states and 211 transitions. [2019-10-01 22:02:17,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 22:02:17,397 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2019-10-01 22:02:17,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:17,398 INFO L225 Difference]: With dead ends: 199 [2019-10-01 22:02:17,398 INFO L226 Difference]: Without dead ends: 141 [2019-10-01 22:02:17,399 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=1572, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 22:02:17,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-01 22:02:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2019-10-01 22:02:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-10-01 22:02:17,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2019-10-01 22:02:17,404 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 184 [2019-10-01 22:02:17,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:17,404 INFO L475 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2019-10-01 22:02:17,404 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 22:02:17,404 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2019-10-01 22:02:17,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-01 22:02:17,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:17,406 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 33, 33, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:17,406 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:17,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:17,406 INFO L82 PathProgramCache]: Analyzing trace with hash 2006594855, now seen corresponding path program 36 times [2019-10-01 22:02:17,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:17,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:17,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:17,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:17,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:18,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 1291 trivial. 0 not checked. [2019-10-01 22:02:18,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:18,175 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:18,249 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:02:30,711 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2019-10-01 22:02:30,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:30,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:02:30,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:31,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 536 proven. 121 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2019-10-01 22:02:31,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:31,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 14] total 51 [2019-10-01 22:02:31,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-01 22:02:31,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-01 22:02:31,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:02:31,022 INFO L87 Difference]: Start difference. First operand 139 states and 143 transitions. Second operand 51 states. [2019-10-01 22:02:31,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:31,303 INFO L93 Difference]: Finished difference Result 205 states and 217 transitions. [2019-10-01 22:02:31,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-10-01 22:02:31,303 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 192 [2019-10-01 22:02:31,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:31,305 INFO L225 Difference]: With dead ends: 205 [2019-10-01 22:02:31,305 INFO L226 Difference]: Without dead ends: 145 [2019-10-01 22:02:31,307 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2019-10-01 22:02:31,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-01 22:02:31,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-10-01 22:02:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-01 22:02:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 147 transitions. [2019-10-01 22:02:31,315 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 147 transitions. Word has length 192 [2019-10-01 22:02:31,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:31,315 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 147 transitions. [2019-10-01 22:02:31,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-01 22:02:31,316 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 147 transitions. [2019-10-01 22:02:31,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-01 22:02:31,318 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:31,319 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:31,319 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:31,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:31,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2105744263, now seen corresponding path program 37 times [2019-10-01 22:02:31,320 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:31,320 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:31,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:31,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:31,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 22:02:32,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:32,141 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:32,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:02:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:32,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 22:02:32,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:32,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 22:02:32,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:32,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 22:02:32,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:02:32,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:02:32,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:02:32,331 INFO L87 Difference]: Start difference. First operand 143 states and 147 transitions. Second operand 41 states. [2019-10-01 22:02:32,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:32,465 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2019-10-01 22:02:32,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 22:02:32,470 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 200 [2019-10-01 22:02:32,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:32,472 INFO L225 Difference]: With dead ends: 208 [2019-10-01 22:02:32,472 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 22:02:32,473 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:02:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 22:02:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-10-01 22:02:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-01 22:02:32,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 149 transitions. [2019-10-01 22:02:32,477 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 149 transitions. Word has length 200 [2019-10-01 22:02:32,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:32,478 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 149 transitions. [2019-10-01 22:02:32,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:02:32,478 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 149 transitions. [2019-10-01 22:02:32,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-01 22:02:32,479 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:32,479 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:32,479 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:32,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:32,480 INFO L82 PathProgramCache]: Analyzing trace with hash -283013655, now seen corresponding path program 38 times [2019-10-01 22:02:32,480 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:32,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:32,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:32,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:02:32,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 22:02:33,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:33,150 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:33,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:02:33,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:02:33,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:33,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 22:02:33,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:33,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2948 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (40)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:02:33,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:33,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 22:02:33,364 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 22:02:33,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 22:02:33,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:02:33,367 INFO L87 Difference]: Start difference. First operand 145 states and 149 transitions. Second operand 42 states. [2019-10-01 22:02:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:33,530 INFO L93 Difference]: Finished difference Result 210 states and 218 transitions. [2019-10-01 22:02:33,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:02:33,530 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2019-10-01 22:02:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:33,531 INFO L225 Difference]: With dead ends: 210 [2019-10-01 22:02:33,531 INFO L226 Difference]: Without dead ends: 148 [2019-10-01 22:02:33,532 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 22:02:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-10-01 22:02:33,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-10-01 22:02:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-10-01 22:02:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 151 transitions. [2019-10-01 22:02:33,537 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 151 transitions. Word has length 202 [2019-10-01 22:02:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:33,538 INFO L475 AbstractCegarLoop]: Abstraction has 147 states and 151 transitions. [2019-10-01 22:02:33,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 22:02:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 151 transitions. [2019-10-01 22:02:33,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-01 22:02:33,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:33,539 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 36, 36, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:33,540 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:33,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:33,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1928130507, now seen corresponding path program 39 times [2019-10-01 22:02:33,540 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:33,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:33,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:33,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:33,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:34,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 1504 trivial. 0 not checked. [2019-10-01 22:02:34,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:34,266 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:34,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:02:34,669 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-01 22:02:34,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:34,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:02:34,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 632 proven. 144 refuted. 0 times theorem prover too weak. 2249 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (41)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:02:34,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:34,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 15] total 55 [2019-10-01 22:02:34,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-10-01 22:02:34,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-10-01 22:02:34,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:02:34,990 INFO L87 Difference]: Start difference. First operand 147 states and 151 transitions. Second operand 55 states. [2019-10-01 22:02:35,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:35,194 INFO L93 Difference]: Finished difference Result 215 states and 227 transitions. [2019-10-01 22:02:35,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 22:02:35,200 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 204 [2019-10-01 22:02:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:35,202 INFO L225 Difference]: With dead ends: 215 [2019-10-01 22:02:35,202 INFO L226 Difference]: Without dead ends: 153 [2019-10-01 22:02:35,203 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=965, Invalid=2005, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 22:02:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-10-01 22:02:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2019-10-01 22:02:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-10-01 22:02:35,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 155 transitions. [2019-10-01 22:02:35,208 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 155 transitions. Word has length 204 [2019-10-01 22:02:35,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:35,209 INFO L475 AbstractCegarLoop]: Abstraction has 151 states and 155 transitions. [2019-10-01 22:02:35,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-10-01 22:02:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2019-10-01 22:02:35,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-01 22:02:35,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:35,210 INFO L411 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:35,211 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:35,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:35,211 INFO L82 PathProgramCache]: Analyzing trace with hash -15611861, now seen corresponding path program 40 times [2019-10-01 22:02:35,211 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:35,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:35,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:35,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:35,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 22:02:36,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:36,063 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:36,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:02:36,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:02:36,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:02:36,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-01 22:02:36,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:02:36,311 INFO L134 CoverageAnalysis]: Checked inductivity of 3335 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:02:36,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:02:36,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2019-10-01 22:02:36,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 22:02:36,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 22:02:36,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:02:36,318 INFO L87 Difference]: Start difference. First operand 151 states and 155 transitions. Second operand 44 states. [2019-10-01 22:02:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:02:36,441 INFO L93 Difference]: Finished difference Result 218 states and 226 transitions. [2019-10-01 22:02:36,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:02:36,442 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 212 [2019-10-01 22:02:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:02:36,443 INFO L225 Difference]: With dead ends: 218 [2019-10-01 22:02:36,443 INFO L226 Difference]: Without dead ends: 154 [2019-10-01 22:02:36,443 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:02:36,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-01 22:02:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-10-01 22:02:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-10-01 22:02:36,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2019-10-01 22:02:36,448 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 212 [2019-10-01 22:02:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:02:36,449 INFO L475 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2019-10-01 22:02:36,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 22:02:36,449 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2019-10-01 22:02:36,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 22:02:36,450 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:02:36,450 INFO L411 BasicCegarLoop]: trace histogram [41, 41, 39, 39, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:02:36,450 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:02:36,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:02:36,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1698842739, now seen corresponding path program 41 times [2019-10-01 22:02:36,451 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:02:36,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:02:36,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:36,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:02:36,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:02:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:02:37,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 1735 trivial. 0 not checked. [2019-10-01 22:02:37,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:02:37,226 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:02:37,286 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:03:41,620 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2019-10-01 22:03:41,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:41,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:03:41,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3416 backedges. 732 proven. 169 refuted. 0 times theorem prover too weak. 2515 trivial. 0 not checked. [2019-10-01 22:03:41,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:41,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 16] total 58 [2019-10-01 22:03:41,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-10-01 22:03:41,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-10-01 22:03:41,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:03:41,995 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 58 states. [2019-10-01 22:03:42,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:42,202 INFO L93 Difference]: Finished difference Result 223 states and 235 transitions. [2019-10-01 22:03:42,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 22:03:42,203 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 214 [2019-10-01 22:03:42,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:42,205 INFO L225 Difference]: With dead ends: 223 [2019-10-01 22:03:42,205 INFO L226 Difference]: Without dead ends: 159 [2019-10-01 22:03:42,206 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1065, Invalid=2241, Unknown=0, NotChecked=0, Total=3306 [2019-10-01 22:03:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-10-01 22:03:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-10-01 22:03:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-10-01 22:03:42,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2019-10-01 22:03:42,211 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 214 [2019-10-01 22:03:42,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:42,212 INFO L475 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2019-10-01 22:03:42,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-10-01 22:03:42,212 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2019-10-01 22:03:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-10-01 22:03:42,213 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:42,214 INFO L411 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 11, 11, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:03:42,214 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:42,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1200258067, now seen corresponding path program 42 times [2019-10-01 22:03:42,214 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:42,215 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:42,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:42,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:42,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:43,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2019-10-01 22:03:43,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:43,114 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:03:43,174 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:03:46,983 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-10-01 22:03:46,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:46,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 22:03:46,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3748 backedges. 850 proven. 121 refuted. 0 times theorem prover too weak. 2777 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (44)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:03:47,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:47,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 14] total 57 [2019-10-01 22:03:47,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 22:03:47,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 22:03:47,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=2112, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:03:47,406 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 57 states. [2019-10-01 22:03:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:47,608 INFO L93 Difference]: Finished difference Result 229 states and 238 transitions. [2019-10-01 22:03:47,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-01 22:03:47,609 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 222 [2019-10-01 22:03:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:47,610 INFO L225 Difference]: With dead ends: 229 [2019-10-01 22:03:47,610 INFO L226 Difference]: Without dead ends: 163 [2019-10-01 22:03:47,611 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1080, Invalid=2112, Unknown=0, NotChecked=0, Total=3192 [2019-10-01 22:03:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-01 22:03:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2019-10-01 22:03:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-01 22:03:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 165 transitions. [2019-10-01 22:03:47,617 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 165 transitions. Word has length 222 [2019-10-01 22:03:47,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:47,617 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 165 transitions. [2019-10-01 22:03:47,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 22:03:47,618 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 165 transitions. [2019-10-01 22:03:47,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-01 22:03:47,619 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:47,619 INFO L411 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:03:47,619 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:47,620 INFO L82 PathProgramCache]: Analyzing trace with hash 320829261, now seen corresponding path program 43 times [2019-10-01 22:03:47,620 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:47,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:47,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:47,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:47,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:48,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:03:48,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:48,571 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:03:48,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:03:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:48,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 22:03:48,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:48,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3856 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:03:48,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:48,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-10-01 22:03:48,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-10-01 22:03:48,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-10-01 22:03:48,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:03:48,801 INFO L87 Difference]: Start difference. First operand 161 states and 165 transitions. Second operand 47 states. [2019-10-01 22:03:48,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:48,943 INFO L93 Difference]: Finished difference Result 232 states and 240 transitions. [2019-10-01 22:03:48,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-10-01 22:03:48,944 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 226 [2019-10-01 22:03:48,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:48,945 INFO L225 Difference]: With dead ends: 232 [2019-10-01 22:03:48,945 INFO L226 Difference]: Without dead ends: 164 [2019-10-01 22:03:48,947 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-10-01 22:03:48,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-01 22:03:48,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-10-01 22:03:48,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-10-01 22:03:48,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 167 transitions. [2019-10-01 22:03:48,953 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 167 transitions. Word has length 226 [2019-10-01 22:03:48,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:48,953 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 167 transitions. [2019-10-01 22:03:48,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-10-01 22:03:48,953 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 167 transitions. [2019-10-01 22:03:48,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-01 22:03:48,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:48,955 INFO L411 BasicCegarLoop]: trace histogram [44, 44, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:03:48,955 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:48,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:48,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1514417361, now seen corresponding path program 44 times [2019-10-01 22:03:48,955 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:48,956 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:48,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:48,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:03:48,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:03:50,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:50,291 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:03:50,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:03:50,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:03:50,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:50,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-01 22:03:50,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:03:50,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:50,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2019-10-01 22:03:50,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-10-01 22:03:50,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-10-01 22:03:50,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:03:50,533 INFO L87 Difference]: Start difference. First operand 163 states and 167 transitions. Second operand 48 states. [2019-10-01 22:03:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:50,692 INFO L93 Difference]: Finished difference Result 234 states and 242 transitions. [2019-10-01 22:03:50,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 22:03:50,692 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2019-10-01 22:03:50,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:50,693 INFO L225 Difference]: With dead ends: 234 [2019-10-01 22:03:50,693 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 22:03:50,694 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-10-01 22:03:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 22:03:50,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2019-10-01 22:03:50,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-10-01 22:03:50,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2019-10-01 22:03:50,700 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 228 [2019-10-01 22:03:50,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:50,701 INFO L475 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2019-10-01 22:03:50,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-10-01 22:03:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2019-10-01 22:03:50,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-01 22:03:50,702 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:50,702 INFO L411 BasicCegarLoop]: trace histogram [45, 45, 42, 42, 12, 12, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:03:50,703 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:50,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:50,703 INFO L82 PathProgramCache]: Analyzing trace with hash 45137553, now seen corresponding path program 45 times [2019-10-01 22:03:50,703 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:50,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:50,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:50,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:50,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 2007 trivial. 0 not checked. [2019-10-01 22:03:51,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:51,755 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:03:51,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:03:53,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-10-01 22:03:53,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:53,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:03:53,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:53,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 850 proven. 144 refuted. 0 times theorem prover too weak. 3038 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (47)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:03:53,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:53,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 15] total 61 [2019-10-01 22:03:53,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-10-01 22:03:53,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-10-01 22:03:53,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1232, Invalid=2428, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:03:53,711 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 61 states. [2019-10-01 22:03:54,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:54,009 INFO L93 Difference]: Finished difference Result 239 states and 248 transitions. [2019-10-01 22:03:54,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-10-01 22:03:54,009 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 230 [2019-10-01 22:03:54,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:54,011 INFO L225 Difference]: With dead ends: 239 [2019-10-01 22:03:54,011 INFO L226 Difference]: Without dead ends: 171 [2019-10-01 22:03:54,012 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1232, Invalid=2428, Unknown=0, NotChecked=0, Total=3660 [2019-10-01 22:03:54,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-10-01 22:03:54,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2019-10-01 22:03:54,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-10-01 22:03:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 173 transitions. [2019-10-01 22:03:54,018 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 173 transitions. Word has length 230 [2019-10-01 22:03:54,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:54,018 INFO L475 AbstractCegarLoop]: Abstraction has 169 states and 173 transitions. [2019-10-01 22:03:54,018 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-10-01 22:03:54,019 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2019-10-01 22:03:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-10-01 22:03:54,020 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:54,020 INFO L411 BasicCegarLoop]: trace histogram [46, 46, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:03:54,021 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:54,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:54,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1593644785, now seen corresponding path program 46 times [2019-10-01 22:03:54,021 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:54,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:54,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:54,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:54,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4148 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 22:03:55,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:55,153 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:03:55,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:03:55,334 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:03:55,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:03:55,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-01 22:03:55,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:03:55,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4148 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 22:03:55,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:03:55,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-10-01 22:03:55,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 22:03:55,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 22:03:55,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:03:55,405 INFO L87 Difference]: Start difference. First operand 169 states and 173 transitions. Second operand 50 states. [2019-10-01 22:03:55,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:03:55,559 INFO L93 Difference]: Finished difference Result 242 states and 250 transitions. [2019-10-01 22:03:55,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-01 22:03:55,559 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 234 [2019-10-01 22:03:55,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:03:55,560 INFO L225 Difference]: With dead ends: 242 [2019-10-01 22:03:55,560 INFO L226 Difference]: Without dead ends: 172 [2019-10-01 22:03:55,561 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-10-01 22:03:55,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-01 22:03:55,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2019-10-01 22:03:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 22:03:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 175 transitions. [2019-10-01 22:03:55,566 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 175 transitions. Word has length 234 [2019-10-01 22:03:55,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:03:55,567 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 175 transitions. [2019-10-01 22:03:55,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 22:03:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 175 transitions. [2019-10-01 22:03:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-01 22:03:55,568 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:03:55,569 INFO L411 BasicCegarLoop]: trace histogram [47, 47, 42, 42, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:03:55,569 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:03:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:03:55,569 INFO L82 PathProgramCache]: Analyzing trace with hash -847744813, now seen corresponding path program 47 times [2019-10-01 22:03:55,569 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:03:55,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:03:55,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:55,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:03:55,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:03:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:03:56,512 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 2032 trivial. 0 not checked. [2019-10-01 22:03:56,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:03:56,513 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:03:56,585 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:05:58,635 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2019-10-01 22:05:58,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:05:58,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:05:58,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:05:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4241 backedges. 844 proven. 196 refuted. 0 times theorem prover too weak. 3201 trivial. 0 not checked. [2019-10-01 22:05:59,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:05:59,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 17] total 65 [2019-10-01 22:05:59,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 22:05:59,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 22:05:59,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1360, Invalid=2800, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 22:05:59,141 INFO L87 Difference]: Start difference. First operand 171 states and 175 transitions. Second operand 65 states. [2019-10-01 22:05:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:05:59,374 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2019-10-01 22:05:59,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 22:05:59,380 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 236 [2019-10-01 22:05:59,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:05:59,381 INFO L225 Difference]: With dead ends: 247 [2019-10-01 22:05:59,381 INFO L226 Difference]: Without dead ends: 177 [2019-10-01 22:05:59,382 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1360, Invalid=2800, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 22:05:59,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-01 22:05:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2019-10-01 22:05:59,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-01 22:05:59,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 179 transitions. [2019-10-01 22:05:59,393 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 179 transitions. Word has length 236 [2019-10-01 22:05:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:05:59,395 INFO L475 AbstractCegarLoop]: Abstraction has 175 states and 179 transitions. [2019-10-01 22:05:59,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 22:05:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 179 transitions. [2019-10-01 22:05:59,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-01 22:05:59,399 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:05:59,400 INFO L411 BasicCegarLoop]: trace histogram [48, 48, 45, 45, 13, 13, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:05:59,400 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:05:59,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:05:59,400 INFO L82 PathProgramCache]: Analyzing trace with hash -96970445, now seen corresponding path program 48 times [2019-10-01 22:05:59,400 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:05:59,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:05:59,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:59,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:05:59,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:05:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:00,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4603 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2019-10-01 22:06:00,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:00,396 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:00,471 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:06:19,880 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-10-01 22:06:19,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:19,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:06:19,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:20,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4603 backedges. 970 proven. 169 refuted. 0 times theorem prover too weak. 3464 trivial. 0 not checked. [2019-10-01 22:06:20,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:20,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 16] total 65 [2019-10-01 22:06:20,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-10-01 22:06:20,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-10-01 22:06:20,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1394, Invalid=2766, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 22:06:20,521 INFO L87 Difference]: Start difference. First operand 175 states and 179 transitions. Second operand 65 states. [2019-10-01 22:06:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:20,860 INFO L93 Difference]: Finished difference Result 253 states and 262 transitions. [2019-10-01 22:06:20,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 22:06:20,864 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 244 [2019-10-01 22:06:20,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:20,865 INFO L225 Difference]: With dead ends: 253 [2019-10-01 22:06:20,865 INFO L226 Difference]: Without dead ends: 181 [2019-10-01 22:06:20,867 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1394, Invalid=2766, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 22:06:20,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-10-01 22:06:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-10-01 22:06:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-10-01 22:06:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 183 transitions. [2019-10-01 22:06:20,875 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 183 transitions. Word has length 244 [2019-10-01 22:06:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:20,875 INFO L475 AbstractCegarLoop]: Abstraction has 179 states and 183 transitions. [2019-10-01 22:06:20,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-10-01 22:06:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2019-10-01 22:06:20,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-01 22:06:20,877 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:20,877 INFO L411 BasicCegarLoop]: trace histogram [49, 49, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:20,877 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:20,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1392071277, now seen corresponding path program 49 times [2019-10-01 22:06:20,878 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:20,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:20,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:20,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:20,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4727 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:21,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:21,926 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:22,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:06:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:22,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 22:06:22,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:22,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4727 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:22,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:22,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-10-01 22:06:22,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-01 22:06:22,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-01 22:06:22,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:06:22,210 INFO L87 Difference]: Start difference. First operand 179 states and 183 transitions. Second operand 53 states. [2019-10-01 22:06:22,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:22,409 INFO L93 Difference]: Finished difference Result 256 states and 264 transitions. [2019-10-01 22:06:22,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 22:06:22,409 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 248 [2019-10-01 22:06:22,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:22,411 INFO L225 Difference]: With dead ends: 256 [2019-10-01 22:06:22,412 INFO L226 Difference]: Without dead ends: 182 [2019-10-01 22:06:22,413 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-10-01 22:06:22,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-10-01 22:06:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-10-01 22:06:22,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-10-01 22:06:22,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 185 transitions. [2019-10-01 22:06:22,419 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 185 transitions. Word has length 248 [2019-10-01 22:06:22,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:22,420 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 185 transitions. [2019-10-01 22:06:22,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-01 22:06:22,420 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 185 transitions. [2019-10-01 22:06:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 22:06:22,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:22,423 INFO L411 BasicCegarLoop]: trace histogram [50, 50, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:22,423 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:22,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:22,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1139151861, now seen corresponding path program 50 times [2019-10-01 22:06:22,424 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:22,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:22,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:06:22,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:24,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:24,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:24,275 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:24,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:06:24,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:06:24,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:24,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-01 22:06:24,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4826 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:24,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:24,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-10-01 22:06:24,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 22:06:24,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 22:06:24,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:06:24,569 INFO L87 Difference]: Start difference. First operand 181 states and 185 transitions. Second operand 54 states. [2019-10-01 22:06:24,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:24,767 INFO L93 Difference]: Finished difference Result 258 states and 266 transitions. [2019-10-01 22:06:24,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 22:06:24,768 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 250 [2019-10-01 22:06:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:24,769 INFO L225 Difference]: With dead ends: 258 [2019-10-01 22:06:24,769 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 22:06:24,770 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 22:06:24,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 22:06:24,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2019-10-01 22:06:24,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-10-01 22:06:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 187 transitions. [2019-10-01 22:06:24,775 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 187 transitions. Word has length 250 [2019-10-01 22:06:24,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:24,775 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 187 transitions. [2019-10-01 22:06:24,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 22:06:24,775 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 187 transitions. [2019-10-01 22:06:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-01 22:06:24,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:24,777 INFO L411 BasicCegarLoop]: trace histogram [51, 51, 45, 45, 14, 14, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:24,777 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:24,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:24,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1601869353, now seen corresponding path program 51 times [2019-10-01 22:06:24,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:24,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:24,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:24,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:24,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:25,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 2326 trivial. 0 not checked. [2019-10-01 22:06:25,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:25,975 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:26,061 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:06:27,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 22:06:27,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:27,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:06:27,485 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4927 backedges. 970 proven. 196 refuted. 0 times theorem prover too weak. 3761 trivial. 0 not checked. [2019-10-01 22:06:27,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:27,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 17] total 69 [2019-10-01 22:06:27,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-01 22:06:27,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-01 22:06:27,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 22:06:27,888 INFO L87 Difference]: Start difference. First operand 183 states and 187 transitions. Second operand 69 states. [2019-10-01 22:06:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:28,231 INFO L93 Difference]: Finished difference Result 263 states and 272 transitions. [2019-10-01 22:06:28,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-10-01 22:06:28,232 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 252 [2019-10-01 22:06:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:28,233 INFO L225 Difference]: With dead ends: 263 [2019-10-01 22:06:28,233 INFO L226 Difference]: Without dead ends: 189 [2019-10-01 22:06:28,234 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 22:06:28,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-01 22:06:28,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2019-10-01 22:06:28,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-01 22:06:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 191 transitions. [2019-10-01 22:06:28,239 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 191 transitions. Word has length 252 [2019-10-01 22:06:28,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:28,239 INFO L475 AbstractCegarLoop]: Abstraction has 187 states and 191 transitions. [2019-10-01 22:06:28,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-01 22:06:28,240 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 191 transitions. [2019-10-01 22:06:28,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-01 22:06:28,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:28,241 INFO L411 BasicCegarLoop]: trace histogram [52, 52, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:28,242 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:28,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:28,242 INFO L82 PathProgramCache]: Analyzing trace with hash -121232585, now seen corresponding path program 52 times [2019-10-01 22:06:28,242 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:28,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:28,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:28,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:28,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:29,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5059 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 22:06:29,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:29,433 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:29,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:06:29,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:06:29,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:06:29,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 22:06:29,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:06:29,695 INFO L134 CoverageAnalysis]: Checked inductivity of 5059 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 22:06:29,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:06:29,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 56 [2019-10-01 22:06:29,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-10-01 22:06:29,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-10-01 22:06:29,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:06:29,702 INFO L87 Difference]: Start difference. First operand 187 states and 191 transitions. Second operand 56 states. [2019-10-01 22:06:29,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:06:29,905 INFO L93 Difference]: Finished difference Result 266 states and 274 transitions. [2019-10-01 22:06:29,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-10-01 22:06:29,905 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 256 [2019-10-01 22:06:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:06:29,906 INFO L225 Difference]: With dead ends: 266 [2019-10-01 22:06:29,906 INFO L226 Difference]: Without dead ends: 190 [2019-10-01 22:06:29,907 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-10-01 22:06:29,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-01 22:06:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2019-10-01 22:06:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-01 22:06:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2019-10-01 22:06:29,913 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 256 [2019-10-01 22:06:29,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:06:29,913 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2019-10-01 22:06:29,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-10-01 22:06:29,913 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2019-10-01 22:06:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-01 22:06:29,915 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:06:29,915 INFO L411 BasicCegarLoop]: trace histogram [53, 53, 45, 45, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:06:29,915 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:06:29,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:06:29,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1192363929, now seen corresponding path program 53 times [2019-10-01 22:06:29,916 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:06:29,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:06:29,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:29,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:06:29,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:06:29,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:06:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 2355 trivial. 0 not checked. [2019-10-01 22:06:31,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:06:31,162 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:06:31,253 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:08:49,508 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 53 check-sat command(s) [2019-10-01 22:08:49,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:08:49,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:08:49,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:08:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5164 backedges. 964 proven. 225 refuted. 0 times theorem prover too weak. 3975 trivial. 0 not checked. [2019-10-01 22:08:50,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:08:50,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 18] total 72 [2019-10-01 22:08:50,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-10-01 22:08:50,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-10-01 22:08:50,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1692, Invalid=3420, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 22:08:50,065 INFO L87 Difference]: Start difference. First operand 189 states and 193 transitions. Second operand 72 states. [2019-10-01 22:08:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:08:50,397 INFO L93 Difference]: Finished difference Result 271 states and 283 transitions. [2019-10-01 22:08:50,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-01 22:08:50,398 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 258 [2019-10-01 22:08:50,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:08:50,399 INFO L225 Difference]: With dead ends: 271 [2019-10-01 22:08:50,399 INFO L226 Difference]: Without dead ends: 195 [2019-10-01 22:08:50,400 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1692, Invalid=3420, Unknown=0, NotChecked=0, Total=5112 [2019-10-01 22:08:50,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-01 22:08:50,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2019-10-01 22:08:50,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-01 22:08:50,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 197 transitions. [2019-10-01 22:08:50,405 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 197 transitions. Word has length 258 [2019-10-01 22:08:50,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:08:50,406 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 197 transitions. [2019-10-01 22:08:50,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-10-01 22:08:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 197 transitions. [2019-10-01 22:08:50,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-01 22:08:50,407 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:08:50,407 INFO L411 BasicCegarLoop]: trace histogram [54, 54, 48, 48, 15, 15, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:08:50,408 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:08:50,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:08:50,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1802007559, now seen corresponding path program 54 times [2019-10-01 22:08:50,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:08:50,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:08:50,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:50,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:08:50,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:08:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:08:51,731 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2019-10-01 22:08:51,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:08:51,732 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:08:51,824 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:09:54,568 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-10-01 22:09:54,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:54,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 26 conjunts are in the unsatisfiable core [2019-10-01 22:09:54,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:55,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5556 backedges. 1098 proven. 225 refuted. 0 times theorem prover too weak. 4233 trivial. 0 not checked. [2019-10-01 22:09:55,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:55,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 18] total 73 [2019-10-01 22:09:55,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-10-01 22:09:55,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-10-01 22:09:55,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:09:55,087 INFO L87 Difference]: Start difference. First operand 193 states and 197 transitions. Second operand 73 states. [2019-10-01 22:09:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:55,428 INFO L93 Difference]: Finished difference Result 277 states and 286 transitions. [2019-10-01 22:09:55,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-10-01 22:09:55,428 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 266 [2019-10-01 22:09:55,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:55,430 INFO L225 Difference]: With dead ends: 277 [2019-10-01 22:09:55,430 INFO L226 Difference]: Without dead ends: 199 [2019-10-01 22:09:55,430 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 864 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1748, Invalid=3508, Unknown=0, NotChecked=0, Total=5256 [2019-10-01 22:09:55,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-10-01 22:09:55,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2019-10-01 22:09:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-10-01 22:09:55,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2019-10-01 22:09:55,435 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 266 [2019-10-01 22:09:55,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:55,435 INFO L475 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2019-10-01 22:09:55,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-10-01 22:09:55,435 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2019-10-01 22:09:55,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-01 22:09:55,437 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:55,437 INFO L411 BasicCegarLoop]: trace histogram [55, 55, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:55,437 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:55,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:55,438 INFO L82 PathProgramCache]: Analyzing trace with hash 566100313, now seen corresponding path program 55 times [2019-10-01 22:09:55,438 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:55,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:55,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:55,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:55,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5696 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:56,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:56,705 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:56,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:09:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:56,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 22:09:56,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5696 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:56,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:56,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 59 [2019-10-01 22:09:56,978 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 22:09:56,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 22:09:56,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:09:56,979 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand 59 states. [2019-10-01 22:09:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:57,251 INFO L93 Difference]: Finished difference Result 280 states and 288 transitions. [2019-10-01 22:09:57,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-10-01 22:09:57,254 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 270 [2019-10-01 22:09:57,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:57,256 INFO L225 Difference]: With dead ends: 280 [2019-10-01 22:09:57,256 INFO L226 Difference]: Without dead ends: 200 [2019-10-01 22:09:57,257 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 22:09:57,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-10-01 22:09:57,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-10-01 22:09:57,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-10-01 22:09:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2019-10-01 22:09:57,261 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 270 [2019-10-01 22:09:57,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:57,262 INFO L475 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2019-10-01 22:09:57,262 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 22:09:57,262 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2019-10-01 22:09:57,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-10-01 22:09:57,264 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:57,264 INFO L411 BasicCegarLoop]: trace histogram [56, 56, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:57,264 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:57,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:57,265 INFO L82 PathProgramCache]: Analyzing trace with hash -513174981, now seen corresponding path program 56 times [2019-10-01 22:09:57,265 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:57,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:57,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:57,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:09:57,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:09:58,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5807 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:58,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:09:58,568 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:09:58,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:09:58,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:09:58,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:09:58,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-01 22:09:58,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:09:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 5807 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:09:58,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:09:58,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-10-01 22:09:58,875 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-10-01 22:09:58,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-10-01 22:09:58,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:09:58,876 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 60 states. [2019-10-01 22:09:59,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:09:59,038 INFO L93 Difference]: Finished difference Result 282 states and 290 transitions. [2019-10-01 22:09:59,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 22:09:59,038 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 272 [2019-10-01 22:09:59,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:09:59,039 INFO L225 Difference]: With dead ends: 282 [2019-10-01 22:09:59,040 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 22:09:59,040 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-10-01 22:09:59,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 22:09:59,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2019-10-01 22:09:59,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-01 22:09:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 205 transitions. [2019-10-01 22:09:59,045 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 205 transitions. Word has length 272 [2019-10-01 22:09:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:09:59,046 INFO L475 AbstractCegarLoop]: Abstraction has 201 states and 205 transitions. [2019-10-01 22:09:59,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-10-01 22:09:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 205 transitions. [2019-10-01 22:09:59,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-01 22:09:59,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:09:59,048 INFO L411 BasicCegarLoop]: trace histogram [57, 57, 48, 48, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:09:59,048 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:09:59,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:09:59,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1685353117, now seen corresponding path program 57 times [2019-10-01 22:09:59,049 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:09:59,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:09:59,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:59,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:09:59,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:09:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:00,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 2671 trivial. 0 not checked. [2019-10-01 22:10:00,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:10:00,409 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:10:00,515 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:10:01,740 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-10-01 22:10:01,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:10:01,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:10:01,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:10:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5920 backedges. 1096 proven. 256 refuted. 0 times theorem prover too weak. 4568 trivial. 0 not checked. [2019-10-01 22:10:02,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:10:02,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 19] total 77 [2019-10-01 22:10:02,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-10-01 22:10:02,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-10-01 22:10:02,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1940, Invalid=3912, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 22:10:02,252 INFO L87 Difference]: Start difference. First operand 201 states and 205 transitions. Second operand 77 states. [2019-10-01 22:10:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:10:02,673 INFO L93 Difference]: Finished difference Result 287 states and 299 transitions. [2019-10-01 22:10:02,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-01 22:10:02,674 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 274 [2019-10-01 22:10:02,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:10:02,675 INFO L225 Difference]: With dead ends: 287 [2019-10-01 22:10:02,675 INFO L226 Difference]: Without dead ends: 207 [2019-10-01 22:10:02,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1940, Invalid=3912, Unknown=0, NotChecked=0, Total=5852 [2019-10-01 22:10:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-01 22:10:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2019-10-01 22:10:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-01 22:10:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 209 transitions. [2019-10-01 22:10:02,680 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 209 transitions. Word has length 274 [2019-10-01 22:10:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:10:02,681 INFO L475 AbstractCegarLoop]: Abstraction has 205 states and 209 transitions. [2019-10-01 22:10:02,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-10-01 22:10:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 209 transitions. [2019-10-01 22:10:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-01 22:10:02,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:10:02,683 INFO L411 BasicCegarLoop]: trace histogram [58, 58, 51, 51, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:10:02,683 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:10:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:10:02,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1256833283, now seen corresponding path program 58 times [2019-10-01 22:10:02,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:10:02,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:10:02,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:02,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:10:02,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 2974 trivial. 0 not checked. [2019-10-01 22:10:04,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:10:04,051 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:10:04,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:10:04,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:10:04,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:10:04,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:10:04,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:10:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6338 backedges. 1232 proven. 289 refuted. 0 times theorem prover too weak. 4817 trivial. 0 not checked. [2019-10-01 22:10:04,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:10:04,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 20] total 79 [2019-10-01 22:10:04,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-10-01 22:10:04,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-10-01 22:10:04,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=4143, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 22:10:04,889 INFO L87 Difference]: Start difference. First operand 205 states and 209 transitions. Second operand 79 states. [2019-10-01 22:10:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:10:05,212 INFO L93 Difference]: Finished difference Result 293 states and 305 transitions. [2019-10-01 22:10:05,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-10-01 22:10:05,213 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 282 [2019-10-01 22:10:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:10:05,214 INFO L225 Difference]: With dead ends: 293 [2019-10-01 22:10:05,214 INFO L226 Difference]: Without dead ends: 211 [2019-10-01 22:10:05,215 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1044 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2019, Invalid=4143, Unknown=0, NotChecked=0, Total=6162 [2019-10-01 22:10:05,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-01 22:10:05,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-10-01 22:10:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-01 22:10:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 213 transitions. [2019-10-01 22:10:05,220 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 213 transitions. Word has length 282 [2019-10-01 22:10:05,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:10:05,220 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 213 transitions. [2019-10-01 22:10:05,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-10-01 22:10:05,220 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 213 transitions. [2019-10-01 22:10:05,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-01 22:10:05,222 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:10:05,222 INFO L411 BasicCegarLoop]: trace histogram [59, 59, 54, 54, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:10:05,222 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:10:05,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:10:05,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1789919581, now seen corresponding path program 59 times [2019-10-01 22:10:05,223 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:10:05,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:10:05,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:05,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:10:05,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:10:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:10:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6776 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 3295 trivial. 0 not checked. [2019-10-01 22:10:06,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:10:06,795 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:10:06,900 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:13:08,542 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 59 check-sat command(s) [2019-10-01 22:13:08,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:13:08,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 20 conjunts are in the unsatisfiable core [2019-10-01 22:13:08,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:13:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6776 backedges. 1372 proven. 324 refuted. 0 times theorem prover too weak. 5080 trivial. 0 not checked. [2019-10-01 22:13:09,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:13:09,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 21] total 81 [2019-10-01 22:13:09,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-10-01 22:13:09,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-10-01 22:13:09,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2100, Invalid=4380, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 22:13:09,236 INFO L87 Difference]: Start difference. First operand 209 states and 213 transitions. Second operand 81 states. [2019-10-01 22:13:09,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:13:09,562 INFO L93 Difference]: Finished difference Result 299 states and 311 transitions. [2019-10-01 22:13:09,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-10-01 22:13:09,563 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 290 [2019-10-01 22:13:09,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:13:09,564 INFO L225 Difference]: With dead ends: 299 [2019-10-01 22:13:09,564 INFO L226 Difference]: Without dead ends: 215 [2019-10-01 22:13:09,565 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2100, Invalid=4380, Unknown=0, NotChecked=0, Total=6480 [2019-10-01 22:13:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-01 22:13:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-10-01 22:13:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-10-01 22:13:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 217 transitions. [2019-10-01 22:13:09,570 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 217 transitions. Word has length 290 [2019-10-01 22:13:09,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:13:09,570 INFO L475 AbstractCegarLoop]: Abstraction has 213 states and 217 transitions. [2019-10-01 22:13:09,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-10-01 22:13:09,571 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 217 transitions. [2019-10-01 22:13:09,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-01 22:13:09,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:13:09,573 INFO L411 BasicCegarLoop]: trace histogram [60, 60, 57, 57, 16, 16, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:13:09,573 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:13:09,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:13:09,573 INFO L82 PathProgramCache]: Analyzing trace with hash 2012920253, now seen corresponding path program 60 times [2019-10-01 22:13:09,574 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:13:09,574 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:13:09,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:13:09,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:13:09,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:13:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:13:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7234 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 3634 trivial. 0 not checked. [2019-10-01 22:13:11,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:13:11,181 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:13:11,292 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:14:36,932 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 35 check-sat command(s) [2019-10-01 22:14:36,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:14:36,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 22:14:36,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 7234 backedges. 1649 proven. 256 refuted. 0 times theorem prover too weak. 5329 trivial. 0 not checked. [2019-10-01 22:14:37,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:37,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 21] total 82 [2019-10-01 22:14:37,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-10-01 22:14:37,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-10-01 22:14:37,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2250, Invalid=4392, Unknown=0, NotChecked=0, Total=6642 [2019-10-01 22:14:37,629 INFO L87 Difference]: Start difference. First operand 213 states and 217 transitions. Second operand 82 states. [2019-10-01 22:14:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:39,190 INFO L93 Difference]: Finished difference Result 306 states and 316 transitions. [2019-10-01 22:14:39,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-10-01 22:14:39,191 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 298 [2019-10-01 22:14:39,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:39,192 INFO L225 Difference]: With dead ends: 306 [2019-10-01 22:14:39,192 INFO L226 Difference]: Without dead ends: 220 [2019-10-01 22:14:39,194 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2590, Invalid=7112, Unknown=0, NotChecked=0, Total=9702 [2019-10-01 22:14:39,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-01 22:14:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2019-10-01 22:14:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-10-01 22:14:39,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 223 transitions. [2019-10-01 22:14:39,204 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 223 transitions. Word has length 298 [2019-10-01 22:14:39,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:39,204 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 223 transitions. [2019-10-01 22:14:39,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-10-01 22:14:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2019-10-01 22:14:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-10-01 22:14:39,206 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:39,206 INFO L411 BasicCegarLoop]: trace histogram [62, 62, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:14:39,206 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:39,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:39,207 INFO L82 PathProgramCache]: Analyzing trace with hash -597352705, now seen corresponding path program 61 times [2019-10-01 22:14:39,207 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:39,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:39,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:39,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:14:39,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 7511 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:14:41,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:41,452 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:14:41,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:14:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:41,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 64 conjunts are in the unsatisfiable core [2019-10-01 22:14:41,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:41,756 INFO L134 CoverageAnalysis]: Checked inductivity of 7511 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:14:41,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:41,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 66 [2019-10-01 22:14:41,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-10-01 22:14:41,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-10-01 22:14:41,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:14:41,762 INFO L87 Difference]: Start difference. First operand 219 states and 223 transitions. Second operand 66 states. [2019-10-01 22:14:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:42,016 INFO L93 Difference]: Finished difference Result 310 states and 318 transitions. [2019-10-01 22:14:42,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 22:14:42,016 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 304 [2019-10-01 22:14:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:42,018 INFO L225 Difference]: With dead ends: 310 [2019-10-01 22:14:42,018 INFO L226 Difference]: Without dead ends: 222 [2019-10-01 22:14:42,019 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-10-01 22:14:42,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-10-01 22:14:42,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2019-10-01 22:14:42,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-10-01 22:14:42,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 225 transitions. [2019-10-01 22:14:42,026 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 225 transitions. Word has length 304 [2019-10-01 22:14:42,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:42,026 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 225 transitions. [2019-10-01 22:14:42,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-10-01 22:14:42,026 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 225 transitions. [2019-10-01 22:14:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-01 22:14:42,028 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:42,028 INFO L411 BasicCegarLoop]: trace histogram [63, 63, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:14:42,029 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:42,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:42,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1467615391, now seen corresponding path program 62 times [2019-10-01 22:14:42,029 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:42,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:42,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:42,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:14:42,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:43,690 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:14:43,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:43,690 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:14:43,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:14:43,956 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:14:43,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:14:43,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-01 22:14:43,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 7636 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:14:44,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:44,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-10-01 22:14:44,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 22:14:44,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 22:14:44,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 22:14:44,086 INFO L87 Difference]: Start difference. First operand 221 states and 225 transitions. Second operand 67 states. [2019-10-01 22:14:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:44,339 INFO L93 Difference]: Finished difference Result 312 states and 320 transitions. [2019-10-01 22:14:44,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-10-01 22:14:44,340 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 306 [2019-10-01 22:14:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:44,341 INFO L225 Difference]: With dead ends: 312 [2019-10-01 22:14:44,341 INFO L226 Difference]: Without dead ends: 224 [2019-10-01 22:14:44,343 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-10-01 22:14:44,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-10-01 22:14:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-10-01 22:14:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-01 22:14:44,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 227 transitions. [2019-10-01 22:14:44,348 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 227 transitions. Word has length 306 [2019-10-01 22:14:44,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:44,348 INFO L475 AbstractCegarLoop]: Abstraction has 223 states and 227 transitions. [2019-10-01 22:14:44,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 22:14:44,348 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 227 transitions. [2019-10-01 22:14:44,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-01 22:14:44,350 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:44,350 INFO L411 BasicCegarLoop]: trace histogram [64, 64, 57, 57, 17, 17, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:14:44,351 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:44,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:44,351 INFO L82 PathProgramCache]: Analyzing trace with hash -271433917, now seen corresponding path program 63 times [2019-10-01 22:14:44,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:44,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:44,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:44,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:14:44,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:14:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 3667 trivial. 0 not checked. [2019-10-01 22:14:46,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:14:46,019 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:14:46,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:14:52,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-10-01 22:14:52,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:14:52,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 22:14:52,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:14:52,671 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 1530 proven. 289 refuted. 0 times theorem prover too weak. 5944 trivial. 0 not checked. [2019-10-01 22:14:52,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:14:52,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 20] total 85 [2019-10-01 22:14:52,679 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-10-01 22:14:52,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-10-01 22:14:52,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=4740, Unknown=0, NotChecked=0, Total=7140 [2019-10-01 22:14:52,680 INFO L87 Difference]: Start difference. First operand 223 states and 227 transitions. Second operand 85 states. [2019-10-01 22:14:53,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:14:53,118 INFO L93 Difference]: Finished difference Result 317 states and 326 transitions. [2019-10-01 22:14:53,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-10-01 22:14:53,119 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 308 [2019-10-01 22:14:53,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:14:53,121 INFO L225 Difference]: With dead ends: 317 [2019-10-01 22:14:53,121 INFO L226 Difference]: Without dead ends: 229 [2019-10-01 22:14:53,122 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1152 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2400, Invalid=4740, Unknown=0, NotChecked=0, Total=7140 [2019-10-01 22:14:53,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-01 22:14:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2019-10-01 22:14:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-01 22:14:53,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2019-10-01 22:14:53,127 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 308 [2019-10-01 22:14:53,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:14:53,127 INFO L475 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2019-10-01 22:14:53,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-10-01 22:14:53,127 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2019-10-01 22:14:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-10-01 22:14:53,129 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:14:53,129 INFO L411 BasicCegarLoop]: trace histogram [65, 65, 57, 57, 18, 18, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:14:53,129 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:14:53,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:14:53,129 INFO L82 PathProgramCache]: Analyzing trace with hash 71499683, now seen corresponding path program 64 times [2019-10-01 22:14:53,130 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:14:53,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:14:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:53,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:14:53,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:14:53,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat