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-examples/sorting_selectionsort_ground-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 09:27:41,932 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 09:27:41,934 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 09:27:41,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 09:27:41,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 09:27:41,946 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 09:27:41,948 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 09:27:41,949 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 09:27:41,951 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 09:27:41,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 09:27:41,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 09:27:41,954 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 09:27:41,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 09:27:41,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 09:27:41,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 09:27:41,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 09:27:41,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 09:27:41,959 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 09:27:41,961 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 09:27:41,963 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 09:27:41,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 09:27:41,966 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 09:27:41,967 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 09:27:41,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 09:27:41,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 09:27:41,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 09:27:41,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 09:27:41,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 09:27:41,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 09:27:41,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 09:27:41,973 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 09:27:41,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 09:27:41,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 09:27:41,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 09:27:41,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 09:27:41,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 09:27:41,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 09:27:41,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 09:27:41,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 09:27:41,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 09:27:41,980 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 09:27:41,980 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-09-07 09:27:41,995 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 09:27:41,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 09:27:41,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 09:27:41,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 09:27:41,997 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 09:27:41,998 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 09:27:41,998 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 09:27:41,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 09:27:41,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 09:27:41,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 09:27:41,999 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 09:27:41,999 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 09:27:41,999 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 09:27:41,999 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 09:27:41,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 09:27:41,999 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 09:27:42,000 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 09:27:42,000 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 09:27:42,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 09:27:42,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 09:27:42,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 09:27:42,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 09:27:42,001 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 09:27:42,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 09:27:42,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 09:27:42,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 09:27:42,002 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 09:27:42,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 09:27:42,002 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 09:27:42,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 09:27:42,041 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 09:27:42,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 09:27:42,046 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 09:27:42,046 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 09:27:42,047 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i [2019-09-07 09:27:42,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1944d45/663b1c7dc87b4105b0c5dbcd666a5c97/FLAGd529ddcb1 [2019-09-07 09:27:42,521 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 09:27:42,522 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_ground-2.i [2019-09-07 09:27:42,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1944d45/663b1c7dc87b4105b0c5dbcd666a5c97/FLAGd529ddcb1 [2019-09-07 09:27:42,917 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1944d45/663b1c7dc87b4105b0c5dbcd666a5c97 [2019-09-07 09:27:42,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 09:27:42,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 09:27:42,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 09:27:42,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 09:27:42,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 09:27:42,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:27:42" (1/1) ... [2019-09-07 09:27:42,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fa8fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:27:42, skipping insertion in model container [2019-09-07 09:27:42,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:27:42" (1/1) ... [2019-09-07 09:27:42,945 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 09:27:42,965 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 09:27:43,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:27:43,193 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 09:27:43,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:27:43,238 INFO L192 MainTranslator]: Completed translation [2019-09-07 09:27:43,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:27:43 WrapperNode [2019-09-07 09:27:43,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 09:27:43,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 09:27:43,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 09:27:43,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 09:27:43,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:27:43" (1/1) ... [2019-09-07 09:27:43,343 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:27:43" (1/1) ... [2019-09-07 09:27:43,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:27:43" (1/1) ... [2019-09-07 09:27:43,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:27:43" (1/1) ... [2019-09-07 09:27:43,372 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:27:43" (1/1) ... [2019-09-07 09:27:43,383 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:27:43" (1/1) ... [2019-09-07 09:27:43,385 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:27:43" (1/1) ... [2019-09-07 09:27:43,387 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 09:27:43,388 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 09:27:43,388 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 09:27:43,388 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 09:27:43,389 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:27:43" (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-09-07 09:27:43,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 09:27:43,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 09:27:43,446 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 09:27:43,446 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 09:27:43,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 09:27:43,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 09:27:43,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 09:27:43,447 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 09:27:43,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 09:27:43,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 09:27:43,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 09:27:43,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 09:27:43,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 09:27:43,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 09:27:43,804 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 09:27:43,805 INFO L283 CfgBuilder]: Removed 8 assume(true) statements. [2019-09-07 09:27:43,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:27:43 BoogieIcfgContainer [2019-09-07 09:27:43,806 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 09:27:43,807 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 09:27:43,807 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 09:27:43,810 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 09:27:43,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:27:42" (1/3) ... [2019-09-07 09:27:43,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f448a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:27:43, skipping insertion in model container [2019-09-07 09:27:43,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:27:43" (2/3) ... [2019-09-07 09:27:43,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f448a87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:27:43, skipping insertion in model container [2019-09-07 09:27:43,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:27:43" (3/3) ... [2019-09-07 09:27:43,813 INFO L109 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_ground-2.i [2019-09-07 09:27:43,823 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 09:27:43,831 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 09:27:43,847 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 09:27:43,876 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 09:27:43,877 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 09:27:43,877 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 09:27:43,877 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 09:27:43,877 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 09:27:43,878 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 09:27:43,878 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 09:27:43,878 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 09:27:43,878 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 09:27:43,896 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-09-07 09:27:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 09:27:43,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:43,902 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:43,904 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:43,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:43,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1156372912, now seen corresponding path program 1 times [2019-09-07 09:27:43,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:43,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:43,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:43,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:43,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:27:44,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:27:44,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 09:27:44,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 09:27:44,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 09:27:44,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 09:27:44,061 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2019-09-07 09:27:44,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:44,083 INFO L93 Difference]: Finished difference Result 82 states and 123 transitions. [2019-09-07 09:27:44,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 09:27:44,084 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-09-07 09:27:44,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:44,094 INFO L225 Difference]: With dead ends: 82 [2019-09-07 09:27:44,094 INFO L226 Difference]: Without dead ends: 40 [2019-09-07 09:27:44,097 INFO L628 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-09-07 09:27:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-09-07 09:27:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-09-07 09:27:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 09:27:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-09-07 09:27:44,140 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 16 [2019-09-07 09:27:44,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:44,141 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-09-07 09:27:44,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 09:27:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2019-09-07 09:27:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-07 09:27:44,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:44,142 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:44,143 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:44,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:44,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2078459264, now seen corresponding path program 1 times [2019-09-07 09:27:44,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:44,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:44,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:44,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:44,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:44,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:27:44,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:27:44,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:27:44,199 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:27:44,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:27:44,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:27:44,201 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 3 states. [2019-09-07 09:27:44,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:44,238 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2019-09-07 09:27:44,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:27:44,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-09-07 09:27:44,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:44,241 INFO L225 Difference]: With dead ends: 74 [2019-09-07 09:27:44,241 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 09:27:44,242 INFO L628 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-09-07 09:27:44,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 09:27:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2019-09-07 09:27:44,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-07 09:27:44,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2019-09-07 09:27:44,251 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 16 [2019-09-07 09:27:44,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:44,252 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-09-07 09:27:44,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:27:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2019-09-07 09:27:44,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-07 09:27:44,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:44,253 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:44,253 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:44,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:44,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1609541534, now seen corresponding path program 1 times [2019-09-07 09:27:44,254 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:44,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:44,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:44,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:44,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:27:44,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:27:44,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:27:44,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:27:44,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:27:44,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:27:44,306 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 3 states. [2019-09-07 09:27:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:44,381 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2019-09-07 09:27:44,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:27:44,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-09-07 09:27:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:44,384 INFO L225 Difference]: With dead ends: 72 [2019-09-07 09:27:44,384 INFO L226 Difference]: Without dead ends: 59 [2019-09-07 09:27:44,385 INFO L628 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-09-07 09:27:44,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-07 09:27:44,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-09-07 09:27:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 09:27:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-09-07 09:27:44,396 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 18 [2019-09-07 09:27:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:44,396 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-09-07 09:27:44,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:27:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-09-07 09:27:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 09:27:44,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:44,398 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:44,398 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:44,399 INFO L82 PathProgramCache]: Analyzing trace with hash -898844059, now seen corresponding path program 1 times [2019-09-07 09:27:44,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:44,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:44,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:44,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:44,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:44,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:27:44,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:27:44,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:27:44,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:27:44,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:27:44,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:27:44,450 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 3 states. [2019-09-07 09:27:44,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:44,525 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2019-09-07 09:27:44,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:27:44,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-09-07 09:27:44,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:44,528 INFO L225 Difference]: With dead ends: 90 [2019-09-07 09:27:44,528 INFO L226 Difference]: Without dead ends: 59 [2019-09-07 09:27:44,528 INFO L628 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-09-07 09:27:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-07 09:27:44,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2019-09-07 09:27:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-07 09:27:44,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2019-09-07 09:27:44,548 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 20 [2019-09-07 09:27:44,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:44,549 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2019-09-07 09:27:44,549 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:27:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2019-09-07 09:27:44,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 09:27:44,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:44,550 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:44,550 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:44,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:44,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1708190685, now seen corresponding path program 1 times [2019-09-07 09:27:44,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:44,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:44,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:44,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:44,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:27:44,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:27:44,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 09:27:44,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 09:27:44,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 09:27:44,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 09:27:44,645 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand 4 states. [2019-09-07 09:27:44,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:44,757 INFO L93 Difference]: Finished difference Result 106 states and 143 transitions. [2019-09-07 09:27:44,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 09:27:44,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-07 09:27:44,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:44,761 INFO L225 Difference]: With dead ends: 106 [2019-09-07 09:27:44,763 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 09:27:44,764 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-07 09:27:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 09:27:44,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2019-09-07 09:27:44,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 09:27:44,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-09-07 09:27:44,783 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 20 [2019-09-07 09:27:44,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:44,784 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-09-07 09:27:44,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 09:27:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-09-07 09:27:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-07 09:27:44,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:44,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:44,785 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:44,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:44,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1561235658, now seen corresponding path program 1 times [2019-09-07 09:27:44,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:44,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:44,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:44,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:44,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:44,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:27:44,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:44,853 INFO L223 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-09-07 09:27:44,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:44,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 09:27:44,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:27:44,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:44,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 09:27:44,944 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 09:27:44,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 09:27:44,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 09:27:44,945 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 5 states. [2019-09-07 09:27:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:44,989 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2019-09-07 09:27:44,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 09:27:44,993 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-09-07 09:27:44,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:44,994 INFO L225 Difference]: With dead ends: 88 [2019-09-07 09:27:44,994 INFO L226 Difference]: Without dead ends: 50 [2019-09-07 09:27:44,995 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 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-09-07 09:27:44,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-07 09:27:45,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-09-07 09:27:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-07 09:27:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2019-09-07 09:27:45,002 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 23 [2019-09-07 09:27:45,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:45,002 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2019-09-07 09:27:45,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 09:27:45,002 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2019-09-07 09:27:45,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-09-07 09:27:45,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:45,004 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:45,004 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:45,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:45,004 INFO L82 PathProgramCache]: Analyzing trace with hash -159559916, now seen corresponding path program 2 times [2019-09-07 09:27:45,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:45,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:45,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:45,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:45,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:45,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:27:45,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:45,057 INFO L223 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-09-07 09:27:45,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:45,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-07 09:27:45,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:45,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 09:27:45,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:45,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:27:45,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 09:27:45,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-09-07 09:27:45,130 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 09:27:45,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 09:27:45,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:27:45,131 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand 7 states. [2019-09-07 09:27:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:45,236 INFO L93 Difference]: Finished difference Result 106 states and 140 transitions. [2019-09-07 09:27:45,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 09:27:45,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-09-07 09:27:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:45,238 INFO L225 Difference]: With dead ends: 106 [2019-09-07 09:27:45,238 INFO L226 Difference]: Without dead ends: 68 [2019-09-07 09:27:45,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-09-07 09:27:45,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-07 09:27:45,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 61. [2019-09-07 09:27:45,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 09:27:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 79 transitions. [2019-09-07 09:27:45,247 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 79 transitions. Word has length 25 [2019-09-07 09:27:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:45,247 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 79 transitions. [2019-09-07 09:27:45,247 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 09:27:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 79 transitions. [2019-09-07 09:27:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-07 09:27:45,248 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:45,249 INFO L399 BasicCegarLoop]: trace histogram [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-09-07 09:27:45,249 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:45,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:45,249 INFO L82 PathProgramCache]: Analyzing trace with hash -485006498, now seen corresponding path program 1 times [2019-09-07 09:27:45,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:45,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:45,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:45,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:45,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:45,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:27:45,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:45,311 INFO L223 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) [2019-09-07 09:27:45,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:45,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 09:27:45,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:45,360 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:27:45,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:45,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 09:27:45,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 09:27:45,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 09:27:45,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:27:45,371 INFO L87 Difference]: Start difference. First operand 61 states and 79 transitions. Second operand 7 states. [2019-09-07 09:27:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:45,400 INFO L93 Difference]: Finished difference Result 112 states and 148 transitions. [2019-09-07 09:27:45,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 09:27:45,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-09-07 09:27:45,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:45,405 INFO L225 Difference]: With dead ends: 112 [2019-09-07 09:27:45,405 INFO L226 Difference]: Without dead ends: 64 [2019-09-07 09:27:45,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:27:45,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-07 09:27:45,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-07 09:27:45,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-07 09:27:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 81 transitions. [2019-09-07 09:27:45,412 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 81 transitions. Word has length 28 [2019-09-07 09:27:45,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:45,413 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 81 transitions. [2019-09-07 09:27:45,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 09:27:45,413 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 81 transitions. [2019-09-07 09:27:45,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 09:27:45,414 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:45,414 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:45,414 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:45,415 INFO L82 PathProgramCache]: Analyzing trace with hash 301121088, now seen corresponding path program 2 times [2019-09-07 09:27:45,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:45,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:45,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:45,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:45,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:45,498 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:27:45,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:45,499 INFO L223 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) [2019-09-07 09:27:45,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:45,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-09-07 09:27:45,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:45,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 09:27:45,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:45,596 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:27:45,597 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 59 [2019-09-07 09:27:45,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:27:45,605 INFO L567 ElimStorePlain]: treesize reduction 25, result has 30.6 percent of original size [2019-09-07 09:27:45,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:27:45,606 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:1 [2019-09-07 09:27:45,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2019-09-07 09:27:45,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:27:45,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:27:45,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:27:45,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:23, output treesize:3 [2019-09-07 09:27:45,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-07 09:27:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-07 09:27:45,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-07 09:27:45,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2019-09-07 09:27:45,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 09:27:45,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 09:27:45,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-09-07 09:27:45,668 INFO L87 Difference]: Start difference. First operand 63 states and 81 transitions. Second operand 11 states. [2019-09-07 09:27:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:45,817 INFO L93 Difference]: Finished difference Result 123 states and 161 transitions. [2019-09-07 09:27:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 09:27:45,818 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-09-07 09:27:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:45,819 INFO L225 Difference]: With dead ends: 123 [2019-09-07 09:27:45,819 INFO L226 Difference]: Without dead ends: 75 [2019-09-07 09:27:45,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:27:45,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-07 09:27:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2019-09-07 09:27:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-07 09:27:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2019-09-07 09:27:45,828 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 30 [2019-09-07 09:27:45,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:45,828 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2019-09-07 09:27:45,828 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 09:27:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2019-09-07 09:27:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 09:27:45,830 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:45,830 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 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-09-07 09:27:45,830 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:45,831 INFO L82 PathProgramCache]: Analyzing trace with hash -533555562, now seen corresponding path program 1 times [2019-09-07 09:27:45,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:45,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:45,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:45,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:45,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 09:27:45,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:27:45,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-07 09:27:45,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-07 09:27:45,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-07 09:27:45,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-07 09:27:45,887 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 4 states. [2019-09-07 09:27:45,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:45,959 INFO L93 Difference]: Finished difference Result 135 states and 176 transitions. [2019-09-07 09:27:45,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 09:27:45,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-09-07 09:27:45,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:45,963 INFO L225 Difference]: With dead ends: 135 [2019-09-07 09:27:45,963 INFO L226 Difference]: Without dead ends: 94 [2019-09-07 09:27:45,964 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-07 09:27:45,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-07 09:27:45,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 73. [2019-09-07 09:27:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-07 09:27:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 92 transitions. [2019-09-07 09:27:45,973 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 92 transitions. Word has length 37 [2019-09-07 09:27:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:45,974 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 92 transitions. [2019-09-07 09:27:45,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-07 09:27:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2019-09-07 09:27:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-07 09:27:45,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:45,976 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:45,976 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:45,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:45,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2120066741, now seen corresponding path program 1 times [2019-09-07 09:27:45,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:45,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:45,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:45,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:45,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 09:27:46,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:46,089 INFO L223 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-09-07 09:27:46,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:46,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 09:27:46,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:46,161 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:27:46,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:46,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-07 09:27:46,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 09:27:46,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 09:27:46,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 09:27:46,172 INFO L87 Difference]: Start difference. First operand 73 states and 92 transitions. Second operand 9 states. [2019-09-07 09:27:46,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:46,206 INFO L93 Difference]: Finished difference Result 132 states and 170 transitions. [2019-09-07 09:27:46,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-07 09:27:46,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-09-07 09:27:46,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:46,208 INFO L225 Difference]: With dead ends: 132 [2019-09-07 09:27:46,208 INFO L226 Difference]: Without dead ends: 76 [2019-09-07 09:27:46,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 09:27:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-07 09:27:46,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-09-07 09:27:46,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-09-07 09:27:46,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2019-09-07 09:27:46,215 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 40 [2019-09-07 09:27:46,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:46,215 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2019-09-07 09:27:46,215 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 09:27:46,215 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2019-09-07 09:27:46,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 09:27:46,217 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:46,217 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:46,217 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:46,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:46,218 INFO L82 PathProgramCache]: Analyzing trace with hash -592593257, now seen corresponding path program 2 times [2019-09-07 09:27:46,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:46,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:46,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:46,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:46,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 09:27:46,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:46,305 INFO L223 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-09-07 09:27:46,322 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:46,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:27:46,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:46,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 09:27:46,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:27:46,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:46,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-09-07 09:27:46,374 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 09:27:46,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 09:27:46,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 09:27:46,374 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand 10 states. [2019-09-07 09:27:46,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:46,415 INFO L93 Difference]: Finished difference Result 134 states and 172 transitions. [2019-09-07 09:27:46,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 09:27:46,416 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2019-09-07 09:27:46,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:46,417 INFO L225 Difference]: With dead ends: 134 [2019-09-07 09:27:46,417 INFO L226 Difference]: Without dead ends: 78 [2019-09-07 09:27:46,418 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 09:27:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-09-07 09:27:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2019-09-07 09:27:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-07 09:27:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 96 transitions. [2019-09-07 09:27:46,423 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 96 transitions. Word has length 42 [2019-09-07 09:27:46,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:46,424 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 96 transitions. [2019-09-07 09:27:46,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 09:27:46,424 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2019-09-07 09:27:46,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-07 09:27:46,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:46,425 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:46,425 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:46,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:46,426 INFO L82 PathProgramCache]: Analyzing trace with hash -413702663, now seen corresponding path program 3 times [2019-09-07 09:27:46,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:46,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:46,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:46,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:46,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:46,542 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-07 09:27:46,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:46,543 INFO L223 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-09-07 09:27:46,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:27:46,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-07 09:27:46,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:46,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 09:27:46,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:46,700 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-07 09:27:46,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:46,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 13 [2019-09-07 09:27:46,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 09:27:46,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 09:27:46,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:27:46,706 INFO L87 Difference]: Start difference. First operand 77 states and 96 transitions. Second operand 13 states. [2019-09-07 09:27:46,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:46,929 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2019-09-07 09:27:46,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 09:27:46,930 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2019-09-07 09:27:46,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:46,931 INFO L225 Difference]: With dead ends: 151 [2019-09-07 09:27:46,931 INFO L226 Difference]: Without dead ends: 95 [2019-09-07 09:27:46,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-09-07 09:27:46,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-07 09:27:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2019-09-07 09:27:46,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-07 09:27:46,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 104 transitions. [2019-09-07 09:27:46,942 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 104 transitions. Word has length 44 [2019-09-07 09:27:46,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:46,943 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 104 transitions. [2019-09-07 09:27:46,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 09:27:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 104 transitions. [2019-09-07 09:27:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-07 09:27:46,946 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:46,946 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:46,946 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:46,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:46,946 INFO L82 PathProgramCache]: Analyzing trace with hash 96986128, now seen corresponding path program 4 times [2019-09-07 09:27:46,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:46,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:46,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:46,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:47,054 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 2 proven. 64 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 09:27:47,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:47,055 INFO L223 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) [2019-09-07 09:27:47,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:47,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:27:47,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:47,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 09:27:47,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:47,152 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:27:47,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:47,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-09-07 09:27:47,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 09:27:47,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 09:27:47,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 09:27:47,163 INFO L87 Difference]: Start difference. First operand 84 states and 104 transitions. Second operand 12 states. [2019-09-07 09:27:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:47,200 INFO L93 Difference]: Finished difference Result 148 states and 188 transitions. [2019-09-07 09:27:47,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-07 09:27:47,201 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-09-07 09:27:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:47,202 INFO L225 Difference]: With dead ends: 148 [2019-09-07 09:27:47,202 INFO L226 Difference]: Without dead ends: 87 [2019-09-07 09:27:47,203 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 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-09-07 09:27:47,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-09-07 09:27:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-09-07 09:27:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-07 09:27:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 106 transitions. [2019-09-07 09:27:47,208 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 106 transitions. Word has length 49 [2019-09-07 09:27:47,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:47,208 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 106 transitions. [2019-09-07 09:27:47,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 09:27:47,208 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2019-09-07 09:27:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 09:27:47,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:47,212 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:47,212 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:47,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:47,213 INFO L82 PathProgramCache]: Analyzing trace with hash 58165870, now seen corresponding path program 5 times [2019-09-07 09:27:47,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:47,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:47,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:47,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:47,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 2 proven. 81 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 09:27:47,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:47,313 INFO L223 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-09-07 09:27:47,328 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:27:47,402 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2019-09-07 09:27:47,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:47,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 09:27:47,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:47,437 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:27:47,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:47,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 09:27:47,441 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 09:27:47,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 09:27:47,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:27:47,442 INFO L87 Difference]: Start difference. First operand 86 states and 106 transitions. Second operand 13 states. [2019-09-07 09:27:47,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:47,487 INFO L93 Difference]: Finished difference Result 150 states and 190 transitions. [2019-09-07 09:27:47,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 09:27:47,488 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-09-07 09:27:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:47,490 INFO L225 Difference]: With dead ends: 150 [2019-09-07 09:27:47,490 INFO L226 Difference]: Without dead ends: 89 [2019-09-07 09:27:47,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:27:47,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-09-07 09:27:47,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-09-07 09:27:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-09-07 09:27:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 108 transitions. [2019-09-07 09:27:47,503 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 108 transitions. Word has length 51 [2019-09-07 09:27:47,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:47,503 INFO L475 AbstractCegarLoop]: Abstraction has 88 states and 108 transitions. [2019-09-07 09:27:47,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 09:27:47,504 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 108 transitions. [2019-09-07 09:27:47,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-07 09:27:47,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:47,504 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:47,504 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:47,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:47,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1406603596, now seen corresponding path program 6 times [2019-09-07 09:27:47,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:47,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:47,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:47,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:47,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:47,616 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 2 proven. 100 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-07 09:27:47,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:47,617 INFO L223 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) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:47,627 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:27:47,671 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 09:27:47,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:47,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 09:27:47,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-09-07 09:27:47,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:47,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 6] total 17 [2019-09-07 09:27:47,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 09:27:47,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 09:27:47,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-09-07 09:27:47,734 INFO L87 Difference]: Start difference. First operand 88 states and 108 transitions. Second operand 17 states. [2019-09-07 09:27:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:48,082 INFO L93 Difference]: Finished difference Result 168 states and 217 transitions. [2019-09-07 09:27:48,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 09:27:48,083 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 53 [2019-09-07 09:27:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:48,084 INFO L225 Difference]: With dead ends: 168 [2019-09-07 09:27:48,084 INFO L226 Difference]: Without dead ends: 107 [2019-09-07 09:27:48,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:27:48,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-07 09:27:48,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 96. [2019-09-07 09:27:48,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-09-07 09:27:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2019-09-07 09:27:48,092 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 53 [2019-09-07 09:27:48,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:48,092 INFO L475 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2019-09-07 09:27:48,092 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 09:27:48,093 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2019-09-07 09:27:48,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 09:27:48,094 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:48,094 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:48,094 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:48,095 INFO L82 PathProgramCache]: Analyzing trace with hash -2105507359, now seen corresponding path program 7 times [2019-09-07 09:27:48,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:48,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:48,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:48,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:48,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:48,209 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 2 proven. 121 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-07 09:27:48,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:48,209 INFO L223 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-09-07 09:27:48,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:48,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 09:27:48,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:27:48,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:48,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-09-07 09:27:48,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 09:27:48,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 09:27:48,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:27:48,295 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand 15 states. [2019-09-07 09:27:48,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:48,342 INFO L93 Difference]: Finished difference Result 166 states and 210 transitions. [2019-09-07 09:27:48,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 09:27:48,345 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2019-09-07 09:27:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:48,346 INFO L225 Difference]: With dead ends: 166 [2019-09-07 09:27:48,346 INFO L226 Difference]: Without dead ends: 99 [2019-09-07 09:27:48,347 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:27:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-09-07 09:27:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-09-07 09:27:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-07 09:27:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2019-09-07 09:27:48,352 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 58 [2019-09-07 09:27:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:48,353 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2019-09-07 09:27:48,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 09:27:48,353 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2019-09-07 09:27:48,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 09:27:48,354 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:48,354 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:48,354 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:48,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:48,354 INFO L82 PathProgramCache]: Analyzing trace with hash -872209085, now seen corresponding path program 8 times [2019-09-07 09:27:48,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:48,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:48,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:48,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:48,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:48,477 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 2 proven. 144 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-07 09:27:48,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:48,478 INFO L223 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-09-07 09:27:48,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:27:48,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:27:48,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:48,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 09:27:48,529 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:27:48,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:48,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2019-09-07 09:27:48,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-07 09:27:48,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-07 09:27:48,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:27:48,549 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand 16 states. [2019-09-07 09:27:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:48,594 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2019-09-07 09:27:48,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 09:27:48,595 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2019-09-07 09:27:48,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:48,596 INFO L225 Difference]: With dead ends: 168 [2019-09-07 09:27:48,596 INFO L226 Difference]: Without dead ends: 101 [2019-09-07 09:27:48,597 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-09-07 09:27:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-09-07 09:27:48,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-09-07 09:27:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-07 09:27:48,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 122 transitions. [2019-09-07 09:27:48,602 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 122 transitions. Word has length 60 [2019-09-07 09:27:48,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:48,603 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 122 transitions. [2019-09-07 09:27:48,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-07 09:27:48,603 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 122 transitions. [2019-09-07 09:27:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-09-07 09:27:48,603 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:48,604 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:48,604 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:48,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:48,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1083541467, now seen corresponding path program 9 times [2019-09-07 09:27:48,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:48,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:48,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:48,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:48,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:48,747 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 2 proven. 169 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-07 09:27:48,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:48,748 INFO L223 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) [2019-09-07 09:27:48,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:48,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 09:27:48,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:48,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 09:27:48,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:48,892 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-09-07 09:27:48,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:48,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 7] total 21 [2019-09-07 09:27:48,896 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 09:27:48,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 09:27:48,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:27:48,897 INFO L87 Difference]: Start difference. First operand 100 states and 122 transitions. Second operand 21 states. [2019-09-07 09:27:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:49,322 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2019-09-07 09:27:49,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 09:27:49,323 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2019-09-07 09:27:49,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:49,324 INFO L225 Difference]: With dead ends: 186 [2019-09-07 09:27:49,324 INFO L226 Difference]: Without dead ends: 119 [2019-09-07 09:27:49,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=402, Invalid=1080, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:27:49,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-07 09:27:49,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2019-09-07 09:27:49,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-09-07 09:27:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2019-09-07 09:27:49,333 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 62 [2019-09-07 09:27:49,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:49,334 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2019-09-07 09:27:49,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 09:27:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2019-09-07 09:27:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-07 09:27:49,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:49,335 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:49,335 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:49,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:49,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2053564700, now seen corresponding path program 10 times [2019-09-07 09:27:49,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:49,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:49,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:49,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:49,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:49,478 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 2 proven. 196 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 09:27:49,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:49,479 INFO L223 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-09-07 09:27:49,488 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:27:49,527 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:27:49,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:49,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 09:27:49,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:49,550 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 09:27:49,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:49,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-09-07 09:27:49,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 09:27:49,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 09:27:49,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 09:27:49,555 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand 18 states. [2019-09-07 09:27:49,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:49,611 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2019-09-07 09:27:49,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 09:27:49,611 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-09-07 09:27:49,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:49,613 INFO L225 Difference]: With dead ends: 184 [2019-09-07 09:27:49,613 INFO L226 Difference]: Without dead ends: 111 [2019-09-07 09:27:49,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 67 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-09-07 09:27:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-07 09:27:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-09-07 09:27:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-07 09:27:49,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2019-09-07 09:27:49,621 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 67 [2019-09-07 09:27:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:49,621 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2019-09-07 09:27:49,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 09:27:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2019-09-07 09:27:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 09:27:49,622 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:49,622 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:49,623 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:49,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash 360391106, now seen corresponding path program 11 times [2019-09-07 09:27:49,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:49,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:49,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:49,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:49,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:49,844 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 2 proven. 225 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 09:27:49,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:49,845 INFO L223 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-09-07 09:27:49,870 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:27:50,015 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2019-09-07 09:27:50,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:50,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 09:27:50,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-07 09:27:50,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:50,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 09:27:50,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 09:27:50,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 09:27:50,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:27:50,041 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand 19 states. [2019-09-07 09:27:50,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:50,097 INFO L93 Difference]: Finished difference Result 186 states and 234 transitions. [2019-09-07 09:27:50,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 09:27:50,097 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2019-09-07 09:27:50,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:50,098 INFO L225 Difference]: With dead ends: 186 [2019-09-07 09:27:50,098 INFO L226 Difference]: Without dead ends: 113 [2019-09-07 09:27:50,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:27:50,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-09-07 09:27:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-09-07 09:27:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-07 09:27:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2019-09-07 09:27:50,104 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 69 [2019-09-07 09:27:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:50,104 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2019-09-07 09:27:50,104 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 09:27:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2019-09-07 09:27:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-07 09:27:50,105 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:50,105 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:50,105 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:50,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:50,106 INFO L82 PathProgramCache]: Analyzing trace with hash 889580832, now seen corresponding path program 12 times [2019-09-07 09:27:50,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:50,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:50,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:50,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:50,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:50,272 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 2 proven. 256 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-07 09:27:50,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:50,272 INFO L223 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) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:50,286 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:27:50,350 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-07 09:27:50,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:50,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 09:27:50,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2019-09-07 09:27:50,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:50,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 8] total 25 [2019-09-07 09:27:50,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 09:27:50,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 09:27:50,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=407, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:27:50,439 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand 25 states. [2019-09-07 09:27:50,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:50,926 INFO L93 Difference]: Finished difference Result 204 states and 261 transitions. [2019-09-07 09:27:50,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 09:27:50,929 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 71 [2019-09-07 09:27:50,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:50,930 INFO L225 Difference]: With dead ends: 204 [2019-09-07 09:27:50,930 INFO L226 Difference]: Without dead ends: 131 [2019-09-07 09:27:50,931 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=573, Invalid=1589, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:27:50,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-07 09:27:50,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2019-09-07 09:27:50,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-07 09:27:50,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2019-09-07 09:27:50,940 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 71 [2019-09-07 09:27:50,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:50,940 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2019-09-07 09:27:50,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 09:27:50,941 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2019-09-07 09:27:50,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 09:27:50,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:50,941 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:50,942 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:50,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:50,942 INFO L82 PathProgramCache]: Analyzing trace with hash 640397581, now seen corresponding path program 13 times [2019-09-07 09:27:50,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:50,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:50,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:50,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:50,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:51,152 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 2 proven. 289 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 09:27:51,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:51,153 INFO L223 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-09-07 09:27:51,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:51,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 09:27:51,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-07 09:27:51,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:51,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 09:27:51,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 09:27:51,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 09:27:51,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:27:51,235 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand 21 states. [2019-09-07 09:27:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:51,290 INFO L93 Difference]: Finished difference Result 202 states and 254 transitions. [2019-09-07 09:27:51,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 09:27:51,290 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 76 [2019-09-07 09:27:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:51,291 INFO L225 Difference]: With dead ends: 202 [2019-09-07 09:27:51,291 INFO L226 Difference]: Without dead ends: 123 [2019-09-07 09:27:51,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:27:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-09-07 09:27:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-09-07 09:27:51,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-07 09:27:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2019-09-07 09:27:51,297 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 76 [2019-09-07 09:27:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:51,298 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2019-09-07 09:27:51,298 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 09:27:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2019-09-07 09:27:51,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 09:27:51,298 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:51,299 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:51,299 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:51,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:51,299 INFO L82 PathProgramCache]: Analyzing trace with hash 178585583, now seen corresponding path program 14 times [2019-09-07 09:27:51,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:51,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:51,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:51,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:51,534 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 2 proven. 324 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 09:27:51,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:51,535 INFO L223 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-09-07 09:27:51,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:27:51,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:27:51,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:51,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 09:27:51,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:27:51,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:51,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2019-09-07 09:27:51,646 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 09:27:51,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 09:27:51,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 09:27:51,647 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand 22 states. [2019-09-07 09:27:51,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:51,717 INFO L93 Difference]: Finished difference Result 204 states and 256 transitions. [2019-09-07 09:27:51,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 09:27:51,718 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 78 [2019-09-07 09:27:51,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:51,719 INFO L225 Difference]: With dead ends: 204 [2019-09-07 09:27:51,719 INFO L226 Difference]: Without dead ends: 125 [2019-09-07 09:27:51,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-09-07 09:27:51,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-07 09:27:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-09-07 09:27:51,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-09-07 09:27:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 150 transitions. [2019-09-07 09:27:51,727 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 150 transitions. Word has length 78 [2019-09-07 09:27:51,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:51,727 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 150 transitions. [2019-09-07 09:27:51,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 09:27:51,727 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 150 transitions. [2019-09-07 09:27:51,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-07 09:27:51,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:51,728 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:51,728 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:51,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:51,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1241113007, now seen corresponding path program 15 times [2019-09-07 09:27:51,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:51,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:51,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:51,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:51,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:51,962 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 2 proven. 361 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-07 09:27:51,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:51,982 INFO L223 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) [2019-09-07 09:27:52,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:52,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 09:27:52,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:52,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 09:27:52,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:52,206 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 37 proven. 35 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-09-07 09:27:52,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:52,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11] total 31 [2019-09-07 09:27:52,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 09:27:52,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 09:27:52,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=625, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:27:52,211 INFO L87 Difference]: Start difference. First operand 124 states and 150 transitions. Second operand 31 states. [2019-09-07 09:27:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:53,064 INFO L93 Difference]: Finished difference Result 223 states and 285 transitions. [2019-09-07 09:27:53,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 09:27:53,066 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 80 [2019-09-07 09:27:53,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:53,067 INFO L225 Difference]: With dead ends: 223 [2019-09-07 09:27:53,067 INFO L226 Difference]: Without dead ends: 144 [2019-09-07 09:27:53,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=921, Invalid=2501, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 09:27:53,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-09-07 09:27:53,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2019-09-07 09:27:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-07 09:27:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 162 transitions. [2019-09-07 09:27:53,078 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 162 transitions. Word has length 80 [2019-09-07 09:27:53,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:53,078 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 162 transitions. [2019-09-07 09:27:53,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 09:27:53,079 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 162 transitions. [2019-09-07 09:27:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-07 09:27:53,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:53,082 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:53,082 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1265984790, now seen corresponding path program 16 times [2019-09-07 09:27:53,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:53,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:53,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:53,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:53,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:53,417 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 2 proven. 441 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-07 09:27:53,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:53,418 INFO L223 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-09-07 09:27:53,441 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:27:53,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:27:53,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:53,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 09:27:53,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:53,504 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-07 09:27:53,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:53,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 09:27:53,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 09:27:53,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 09:27:53,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:27:53,518 INFO L87 Difference]: Start difference. First operand 134 states and 162 transitions. Second operand 25 states. [2019-09-07 09:27:53,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:53,592 INFO L93 Difference]: Finished difference Result 222 states and 278 transitions. [2019-09-07 09:27:53,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 09:27:53,592 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 87 [2019-09-07 09:27:53,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:53,594 INFO L225 Difference]: With dead ends: 222 [2019-09-07 09:27:53,594 INFO L226 Difference]: Without dead ends: 137 [2019-09-07 09:27:53,595 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:27:53,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-07 09:27:53,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-09-07 09:27:53,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-09-07 09:27:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 164 transitions. [2019-09-07 09:27:53,600 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 164 transitions. Word has length 87 [2019-09-07 09:27:53,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:53,601 INFO L475 AbstractCegarLoop]: Abstraction has 136 states and 164 transitions. [2019-09-07 09:27:53,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 09:27:53,601 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 164 transitions. [2019-09-07 09:27:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-07 09:27:53,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:53,602 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:53,602 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:53,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:53,602 INFO L82 PathProgramCache]: Analyzing trace with hash -57453324, now seen corresponding path program 17 times [2019-09-07 09:27:53,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:53,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:53,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:53,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:53,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 2 proven. 484 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-07 09:27:53,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:53,924 INFO L223 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) [2019-09-07 09:27:53,942 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:54,631 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-09-07 09:27:54,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:54,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 09:27:54,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-07 09:27:54,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:54,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-09-07 09:27:54,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 09:27:54,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 09:27:54,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 09:27:54,663 INFO L87 Difference]: Start difference. First operand 136 states and 164 transitions. Second operand 26 states. [2019-09-07 09:27:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:54,741 INFO L93 Difference]: Finished difference Result 224 states and 280 transitions. [2019-09-07 09:27:54,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 09:27:54,742 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2019-09-07 09:27:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:54,743 INFO L225 Difference]: With dead ends: 224 [2019-09-07 09:27:54,743 INFO L226 Difference]: Without dead ends: 139 [2019-09-07 09:27:54,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 89 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-09-07 09:27:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-09-07 09:27:54,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-09-07 09:27:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-07 09:27:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2019-09-07 09:27:54,749 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 89 [2019-09-07 09:27:54,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:54,749 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2019-09-07 09:27:54,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 09:27:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2019-09-07 09:27:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 09:27:54,751 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:54,751 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:54,751 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:54,751 INFO L82 PathProgramCache]: Analyzing trace with hash -571161262, now seen corresponding path program 18 times [2019-09-07 09:27:54,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:54,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:54,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:54,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:54,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 2 proven. 529 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-09-07 09:27:55,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:55,045 INFO L223 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-09-07 09:27:55,056 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:27:55,284 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-09-07 09:27:55,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:55,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 09:27:55,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:55,436 INFO L134 CoverageAnalysis]: Checked inductivity of 584 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2019-09-07 09:27:55,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:55,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 34 [2019-09-07 09:27:55,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 09:27:55,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 09:27:55,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=760, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:27:55,447 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand 34 states. [2019-09-07 09:27:56,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:56,453 INFO L93 Difference]: Finished difference Result 242 states and 307 transitions. [2019-09-07 09:27:56,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 09:27:56,453 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 91 [2019-09-07 09:27:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:56,455 INFO L225 Difference]: With dead ends: 242 [2019-09-07 09:27:56,455 INFO L226 Difference]: Without dead ends: 157 [2019-09-07 09:27:56,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 649 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1080, Invalid=3080, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 09:27:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-09-07 09:27:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 146. [2019-09-07 09:27:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-09-07 09:27:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2019-09-07 09:27:56,462 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 91 [2019-09-07 09:27:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:56,463 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2019-09-07 09:27:56,463 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 09:27:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2019-09-07 09:27:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 09:27:56,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:56,464 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:56,464 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:56,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:56,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1806889317, now seen corresponding path program 19 times [2019-09-07 09:27:56,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:56,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:56,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:56,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:56,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:56,852 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 2 proven. 576 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-07 09:27:56,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:56,852 INFO L223 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-09-07 09:27:56,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:56,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 09:27:56,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (24)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:27:56,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:56,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2019-09-07 09:27:56,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-07 09:27:56,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-07 09:27:56,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 09:27:56,935 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand 28 states. [2019-09-07 09:27:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:57,063 INFO L93 Difference]: Finished difference Result 240 states and 300 transitions. [2019-09-07 09:27:57,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 09:27:57,064 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 96 [2019-09-07 09:27:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:57,065 INFO L225 Difference]: With dead ends: 240 [2019-09-07 09:27:57,065 INFO L226 Difference]: Without dead ends: 149 [2019-09-07 09:27:57,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-09-07 09:27:57,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-09-07 09:27:57,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-09-07 09:27:57,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-09-07 09:27:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 178 transitions. [2019-09-07 09:27:57,072 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 178 transitions. Word has length 96 [2019-09-07 09:27:57,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:57,073 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 178 transitions. [2019-09-07 09:27:57,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-07 09:27:57,073 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 178 transitions. [2019-09-07 09:27:57,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-07 09:27:57,074 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:57,074 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:57,074 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:57,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:57,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1008474237, now seen corresponding path program 20 times [2019-09-07 09:27:57,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:57,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:57,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:57,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:27:57,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:57,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:57,522 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 2 proven. 625 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-07 09:27:57,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:57,522 INFO L223 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) [2019-09-07 09:27:57,535 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:57,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:27:57,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:57,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 09:27:57,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:57,612 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-07 09:27:57,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:57,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-09-07 09:27:57,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 09:27:57,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 09:27:57,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 09:27:57,618 INFO L87 Difference]: Start difference. First operand 148 states and 178 transitions. Second operand 29 states. [2019-09-07 09:27:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:57,701 INFO L93 Difference]: Finished difference Result 242 states and 302 transitions. [2019-09-07 09:27:57,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-07 09:27:57,702 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 98 [2019-09-07 09:27:57,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:57,703 INFO L225 Difference]: With dead ends: 242 [2019-09-07 09:27:57,703 INFO L226 Difference]: Without dead ends: 151 [2019-09-07 09:27:57,704 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 09:27:57,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-09-07 09:27:57,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2019-09-07 09:27:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-07 09:27:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2019-09-07 09:27:57,710 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 98 [2019-09-07 09:27:57,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:57,710 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2019-09-07 09:27:57,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 09:27:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2019-09-07 09:27:57,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-07 09:27:57,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:57,712 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:57,712 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:57,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:57,712 INFO L82 PathProgramCache]: Analyzing trace with hash 743453151, now seen corresponding path program 21 times [2019-09-07 09:27:57,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:57,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:57,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:57,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:58,142 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 2 proven. 676 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-07 09:27:58,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:58,143 INFO L223 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) [2019-09-07 09:27:58,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:27:58,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-09-07 09:27:58,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:58,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 09:27:58,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:58,396 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 680 trivial. 0 not checked. [2019-09-07 09:27:58,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:58,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 11] total 38 [2019-09-07 09:27:58,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 09:27:58,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 09:27:58,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=954, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:27:58,401 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand 38 states. [2019-09-07 09:27:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:27:59,484 INFO L93 Difference]: Finished difference Result 260 states and 329 transitions. [2019-09-07 09:27:59,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 09:27:59,485 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 100 [2019-09-07 09:27:59,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:27:59,486 INFO L225 Difference]: With dead ends: 260 [2019-09-07 09:27:59,486 INFO L226 Difference]: Without dead ends: 169 [2019-09-07 09:27:59,488 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1350, Invalid=3906, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 09:27:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-07 09:27:59,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 158. [2019-09-07 09:27:59,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-07 09:27:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 190 transitions. [2019-09-07 09:27:59,495 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 190 transitions. Word has length 100 [2019-09-07 09:27:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:27:59,495 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 190 transitions. [2019-09-07 09:27:59,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 09:27:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 190 transitions. [2019-09-07 09:27:59,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-07 09:27:59,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:27:59,496 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:27:59,497 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:27:59,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:27:59,497 INFO L82 PathProgramCache]: Analyzing trace with hash -475229078, now seen corresponding path program 22 times [2019-09-07 09:27:59,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:27:59,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:27:59,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:59,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:27:59,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:27:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:27:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 2 proven. 729 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-07 09:27:59,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:27:59,885 INFO L223 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-09-07 09:27:59,895 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:27:59,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:27:59,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:27:59,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 09:27:59,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:27:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 825 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-09-07 09:27:59,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:27:59,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-09-07 09:27:59,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 09:27:59,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 09:27:59,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:27:59,980 INFO L87 Difference]: Start difference. First operand 158 states and 190 transitions. Second operand 31 states. [2019-09-07 09:28:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:00,093 INFO L93 Difference]: Finished difference Result 258 states and 322 transitions. [2019-09-07 09:28:00,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 09:28:00,093 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 105 [2019-09-07 09:28:00,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:00,094 INFO L225 Difference]: With dead ends: 258 [2019-09-07 09:28:00,095 INFO L226 Difference]: Without dead ends: 161 [2019-09-07 09:28:00,095 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:28:00,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-09-07 09:28:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-09-07 09:28:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-07 09:28:00,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 192 transitions. [2019-09-07 09:28:00,102 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 192 transitions. Word has length 105 [2019-09-07 09:28:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:00,102 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 192 transitions. [2019-09-07 09:28:00,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 09:28:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 192 transitions. [2019-09-07 09:28:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-07 09:28:00,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:00,103 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:00,104 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:00,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:00,104 INFO L82 PathProgramCache]: Analyzing trace with hash -762476344, now seen corresponding path program 23 times [2019-09-07 09:28:00,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:00,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:00,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:00,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:00,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 2 proven. 784 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-07 09:28:00,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:00,501 INFO L223 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-09-07 09:28:00,513 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:28:01,152 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2019-09-07 09:28:01,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:01,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 09:28:01,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 880 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-09-07 09:28:01,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:01,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-09-07 09:28:01,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-07 09:28:01,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-07 09:28:01,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 09:28:01,181 INFO L87 Difference]: Start difference. First operand 160 states and 192 transitions. Second operand 32 states. [2019-09-07 09:28:01,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:01,271 INFO L93 Difference]: Finished difference Result 260 states and 324 transitions. [2019-09-07 09:28:01,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 09:28:01,272 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 107 [2019-09-07 09:28:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:01,273 INFO L225 Difference]: With dead ends: 260 [2019-09-07 09:28:01,273 INFO L226 Difference]: Without dead ends: 163 [2019-09-07 09:28:01,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-09-07 09:28:01,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-07 09:28:01,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-09-07 09:28:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-07 09:28:01,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 194 transitions. [2019-09-07 09:28:01,280 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 194 transitions. Word has length 107 [2019-09-07 09:28:01,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:01,280 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 194 transitions. [2019-09-07 09:28:01,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-07 09:28:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 194 transitions. [2019-09-07 09:28:01,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-07 09:28:01,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:01,282 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:01,282 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:01,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:01,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1929192026, now seen corresponding path program 24 times [2019-09-07 09:28:01,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:01,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:01,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:01,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:01,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 2 proven. 841 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-07 09:28:01,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:01,689 INFO L223 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-09-07 09:28:01,699 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:28:02,116 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-09-07 09:28:02,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:02,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 09:28:02,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 57 proven. 92 refuted. 0 times theorem prover too weak. 788 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Stream closed [2019-09-07 09:28:02,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:02,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 14] total 44 [2019-09-07 09:28:02,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 09:28:02,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 09:28:02,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=617, Invalid=1275, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 09:28:02,350 INFO L87 Difference]: Start difference. First operand 162 states and 194 transitions. Second operand 44 states. [2019-09-07 09:28:03,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:03,642 INFO L93 Difference]: Finished difference Result 279 states and 353 transitions. [2019-09-07 09:28:03,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 09:28:03,643 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 109 [2019-09-07 09:28:03,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:03,645 INFO L225 Difference]: With dead ends: 279 [2019-09-07 09:28:03,645 INFO L226 Difference]: Without dead ends: 182 [2019-09-07 09:28:03,648 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1863, Invalid=5277, Unknown=0, NotChecked=0, Total=7140 [2019-09-07 09:28:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-09-07 09:28:03,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 172. [2019-09-07 09:28:03,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-09-07 09:28:03,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 206 transitions. [2019-09-07 09:28:03,654 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 206 transitions. Word has length 109 [2019-09-07 09:28:03,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:03,654 INFO L475 AbstractCegarLoop]: Abstraction has 172 states and 206 transitions. [2019-09-07 09:28:03,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 09:28:03,654 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 206 transitions. [2019-09-07 09:28:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-07 09:28:03,655 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:03,655 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:03,656 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:03,656 INFO L82 PathProgramCache]: Analyzing trace with hash 866002601, now seen corresponding path program 25 times [2019-09-07 09:28:03,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:03,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:03,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:03,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:03,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 2 proven. 961 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-07 09:28:04,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:04,105 INFO L223 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-09-07 09:28:04,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:28:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:04,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 09:28:04,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 09:28:04,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:04,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-09-07 09:28:04,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 09:28:04,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 09:28:04,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:28:04,216 INFO L87 Difference]: Start difference. First operand 172 states and 206 transitions. Second operand 35 states. [2019-09-07 09:28:04,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:04,320 INFO L93 Difference]: Finished difference Result 278 states and 346 transitions. [2019-09-07 09:28:04,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 09:28:04,320 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 116 [2019-09-07 09:28:04,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:04,322 INFO L225 Difference]: With dead ends: 278 [2019-09-07 09:28:04,322 INFO L226 Difference]: Without dead ends: 175 [2019-09-07 09:28:04,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:28:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-09-07 09:28:04,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2019-09-07 09:28:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-07 09:28:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 208 transitions. [2019-09-07 09:28:04,329 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 208 transitions. Word has length 116 [2019-09-07 09:28:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:04,330 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 208 transitions. [2019-09-07 09:28:04,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 09:28:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 208 transitions. [2019-09-07 09:28:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-07 09:28:04,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:04,332 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:04,332 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:04,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:04,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1570204555, now seen corresponding path program 26 times [2019-09-07 09:28:04,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:04,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:04,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:04,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:28:04,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:04,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 2 proven. 1024 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-07 09:28:04,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:04,814 INFO L223 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-09-07 09:28:04,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:28:04,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:28:04,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:04,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 09:28:04,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:04,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 09:28:04,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:04,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 09:28:04,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 09:28:04,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 09:28:04,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:28:04,936 INFO L87 Difference]: Start difference. First operand 174 states and 208 transitions. Second operand 36 states. [2019-09-07 09:28:05,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:05,043 INFO L93 Difference]: Finished difference Result 280 states and 348 transitions. [2019-09-07 09:28:05,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 09:28:05,043 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 118 [2019-09-07 09:28:05,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:05,044 INFO L225 Difference]: With dead ends: 280 [2019-09-07 09:28:05,044 INFO L226 Difference]: Without dead ends: 177 [2019-09-07 09:28:05,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:28:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-07 09:28:05,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-09-07 09:28:05,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-09-07 09:28:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 210 transitions. [2019-09-07 09:28:05,051 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 210 transitions. Word has length 118 [2019-09-07 09:28:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:05,051 INFO L475 AbstractCegarLoop]: Abstraction has 176 states and 210 transitions. [2019-09-07 09:28:05,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 09:28:05,052 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 210 transitions. [2019-09-07 09:28:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-07 09:28:05,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:05,053 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:05,053 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:05,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:05,054 INFO L82 PathProgramCache]: Analyzing trace with hash -296550419, now seen corresponding path program 27 times [2019-09-07 09:28:05,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:05,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:05,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:05,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:05,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:05,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 2 proven. 1089 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-09-07 09:28:05,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:05,794 INFO L223 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) [2019-09-07 09:28:05,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:28:05,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-07 09:28:05,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:05,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 09:28:05,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:06,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 1093 trivial. 0 not checked. [2019-09-07 09:28:06,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:06,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 13] total 47 [2019-09-07 09:28:06,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 09:28:06,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 09:28:06,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=1465, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:28:06,180 INFO L87 Difference]: Start difference. First operand 176 states and 210 transitions. Second operand 47 states. [2019-09-07 09:28:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:07,514 INFO L93 Difference]: Finished difference Result 298 states and 375 transitions. [2019-09-07 09:28:07,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 09:28:07,516 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 120 [2019-09-07 09:28:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:07,517 INFO L225 Difference]: With dead ends: 298 [2019-09-07 09:28:07,517 INFO L226 Difference]: Without dead ends: 195 [2019-09-07 09:28:07,521 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1309 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2085, Invalid=6105, Unknown=0, NotChecked=0, Total=8190 [2019-09-07 09:28:07,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-07 09:28:07,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 184. [2019-09-07 09:28:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-09-07 09:28:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 220 transitions. [2019-09-07 09:28:07,527 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 220 transitions. Word has length 120 [2019-09-07 09:28:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:07,528 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 220 transitions. [2019-09-07 09:28:07,528 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 09:28:07,528 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2019-09-07 09:28:07,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-07 09:28:07,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:07,529 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:07,529 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:07,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:07,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1476212580, now seen corresponding path program 28 times [2019-09-07 09:28:07,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:07,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:07,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:07,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:07,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 2 proven. 1156 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-07 09:28:08,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:08,029 INFO L223 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-09-07 09:28:08,042 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:28:08,102 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:28:08,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:08,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 09:28:08,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1305 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-07 09:28:08,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:08,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-07 09:28:08,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 09:28:08,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 09:28:08,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:28:08,133 INFO L87 Difference]: Start difference. First operand 184 states and 220 transitions. Second operand 38 states. [2019-09-07 09:28:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:08,249 INFO L93 Difference]: Finished difference Result 296 states and 368 transitions. [2019-09-07 09:28:08,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 09:28:08,249 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 125 [2019-09-07 09:28:08,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:08,251 INFO L225 Difference]: With dead ends: 296 [2019-09-07 09:28:08,251 INFO L226 Difference]: Without dead ends: 187 [2019-09-07 09:28:08,251 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:28:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-07 09:28:08,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-09-07 09:28:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-09-07 09:28:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 222 transitions. [2019-09-07 09:28:08,260 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 222 transitions. Word has length 125 [2019-09-07 09:28:08,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:08,260 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 222 transitions. [2019-09-07 09:28:08,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 09:28:08,261 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 222 transitions. [2019-09-07 09:28:08,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-07 09:28:08,261 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:08,262 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:08,262 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:08,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:08,262 INFO L82 PathProgramCache]: Analyzing trace with hash -787750406, now seen corresponding path program 29 times [2019-09-07 09:28:08,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:08,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:08,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:08,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:08,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:08,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 2 proven. 1225 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-07 09:28:08,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:08,980 INFO L223 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-09-07 09:28:09,001 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:28:11,032 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-07 09:28:11,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:11,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 09:28:11,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:11,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-09-07 09:28:11,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:11,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-09-07 09:28:11,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 09:28:11,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 09:28:11,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:28:11,090 INFO L87 Difference]: Start difference. First operand 186 states and 222 transitions. Second operand 39 states. [2019-09-07 09:28:11,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:11,202 INFO L93 Difference]: Finished difference Result 298 states and 370 transitions. [2019-09-07 09:28:11,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 09:28:11,203 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 127 [2019-09-07 09:28:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:11,204 INFO L225 Difference]: With dead ends: 298 [2019-09-07 09:28:11,204 INFO L226 Difference]: Without dead ends: 189 [2019-09-07 09:28:11,205 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:28:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-09-07 09:28:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2019-09-07 09:28:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-07 09:28:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 224 transitions. [2019-09-07 09:28:11,211 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 224 transitions. Word has length 127 [2019-09-07 09:28:11,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:11,212 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 224 transitions. [2019-09-07 09:28:11,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 09:28:11,212 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 224 transitions. [2019-09-07 09:28:11,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-07 09:28:11,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:11,213 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:11,213 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:11,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:11,213 INFO L82 PathProgramCache]: Analyzing trace with hash -600564776, now seen corresponding path program 30 times [2019-09-07 09:28:11,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:11,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:11,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:11,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:11,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 2 proven. 1296 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-09-07 09:28:12,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:12,060 INFO L223 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) [2019-09-07 09:28:12,073 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:28:14,022 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-09-07 09:28:14,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:14,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 09:28:14,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:14,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 71 proven. 145 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2019-09-07 09:28:14,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:14,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 16] total 53 [2019-09-07 09:28:14,332 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 09:28:14,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 09:28:14,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=1857, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:28:14,333 INFO L87 Difference]: Start difference. First operand 188 states and 224 transitions. Second operand 53 states. [2019-09-07 09:28:15,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:15,856 INFO L93 Difference]: Finished difference Result 317 states and 399 transitions. [2019-09-07 09:28:15,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 09:28:15,857 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 129 [2019-09-07 09:28:15,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:15,858 INFO L225 Difference]: With dead ends: 317 [2019-09-07 09:28:15,858 INFO L226 Difference]: Without dead ends: 208 [2019-09-07 09:28:15,859 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1670 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2713, Invalid=7793, Unknown=0, NotChecked=0, Total=10506 [2019-09-07 09:28:15,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-07 09:28:15,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 198. [2019-09-07 09:28:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-07 09:28:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 236 transitions. [2019-09-07 09:28:15,864 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 236 transitions. Word has length 129 [2019-09-07 09:28:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:15,865 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 236 transitions. [2019-09-07 09:28:15,865 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 09:28:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 236 transitions. [2019-09-07 09:28:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-07 09:28:15,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:15,865 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:15,866 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:15,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:15,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1268291895, now seen corresponding path program 31 times [2019-09-07 09:28:15,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:15,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:15,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:15,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:15,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:16,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 2 proven. 1444 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-09-07 09:28:16,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:16,736 INFO L223 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-09-07 09:28:16,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:28:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:16,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 09:28:16,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:16,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-07 09:28:16,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:16,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-09-07 09:28:16,847 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-07 09:28:16,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-07 09:28:16,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 09:28:16,848 INFO L87 Difference]: Start difference. First operand 198 states and 236 transitions. Second operand 42 states. [2019-09-07 09:28:16,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:16,940 INFO L93 Difference]: Finished difference Result 316 states and 392 transitions. [2019-09-07 09:28:16,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-07 09:28:16,944 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 136 [2019-09-07 09:28:16,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:16,945 INFO L225 Difference]: With dead ends: 316 [2019-09-07 09:28:16,945 INFO L226 Difference]: Without dead ends: 201 [2019-09-07 09:28:16,946 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 09:28:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-07 09:28:16,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2019-09-07 09:28:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-09-07 09:28:16,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 238 transitions. [2019-09-07 09:28:16,952 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 238 transitions. Word has length 136 [2019-09-07 09:28:16,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:16,953 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 238 transitions. [2019-09-07 09:28:16,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-07 09:28:16,953 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 238 transitions. [2019-09-07 09:28:16,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-07 09:28:16,954 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:16,954 INFO L399 BasicCegarLoop]: trace histogram [39, 39, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:16,954 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:16,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:16,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2135988505, now seen corresponding path program 32 times [2019-09-07 09:28:16,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:16,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:16,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:16,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:28:16,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:16,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 2 proven. 1521 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-09-07 09:28:18,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:18,063 INFO L223 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-09-07 09:28:18,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:28:18,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:28:18,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:18,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 09:28:18,149 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:18,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-07 09:28:18,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:18,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2019-09-07 09:28:18,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 09:28:18,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 09:28:18,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:28:18,183 INFO L87 Difference]: Start difference. First operand 200 states and 238 transitions. Second operand 43 states. [2019-09-07 09:28:18,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:18,315 INFO L93 Difference]: Finished difference Result 318 states and 394 transitions. [2019-09-07 09:28:18,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 09:28:18,315 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 138 [2019-09-07 09:28:18,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:18,316 INFO L225 Difference]: With dead ends: 318 [2019-09-07 09:28:18,317 INFO L226 Difference]: Without dead ends: 203 [2019-09-07 09:28:18,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:28:18,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-09-07 09:28:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-09-07 09:28:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-09-07 09:28:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 240 transitions. [2019-09-07 09:28:18,325 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 240 transitions. Word has length 138 [2019-09-07 09:28:18,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:18,325 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 240 transitions. [2019-09-07 09:28:18,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 09:28:18,325 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 240 transitions. [2019-09-07 09:28:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 09:28:18,326 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:18,326 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:18,326 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:18,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:18,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1526192005, now seen corresponding path program 33 times [2019-09-07 09:28:18,327 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:18,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:18,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:18,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:18,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1780 backedges. 2 proven. 1600 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2019-09-07 09:28:19,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:19,103 INFO L223 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-09-07 09:28:19,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:28:19,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 09:28:19,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:19,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 09:28:19,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1780 backedges. 79 proven. 176 refuted. 0 times theorem prover too weak. 1525 trivial. 0 not checked. [2019-09-07 09:28:19,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:19,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 17] total 58 [2019-09-07 09:28:19,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 09:28:19,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 09:28:19,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1082, Invalid=2224, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 09:28:19,579 INFO L87 Difference]: Start difference. First operand 202 states and 240 transitions. Second operand 58 states. [2019-09-07 09:28:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:21,588 INFO L93 Difference]: Finished difference Result 337 states and 423 transitions. [2019-09-07 09:28:21,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 09:28:21,588 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 140 [2019-09-07 09:28:21,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:21,590 INFO L225 Difference]: With dead ends: 337 [2019-09-07 09:28:21,590 INFO L226 Difference]: Without dead ends: 222 [2019-09-07 09:28:21,591 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3264, Invalid=9392, Unknown=0, NotChecked=0, Total=12656 [2019-09-07 09:28:21,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-07 09:28:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 212. [2019-09-07 09:28:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-07 09:28:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 252 transitions. [2019-09-07 09:28:21,599 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 252 transitions. Word has length 140 [2019-09-07 09:28:21,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:21,599 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 252 transitions. [2019-09-07 09:28:21,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 09:28:21,599 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 252 transitions. [2019-09-07 09:28:21,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 09:28:21,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:21,600 INFO L399 BasicCegarLoop]: trace histogram [42, 42, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:21,600 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:21,601 INFO L82 PathProgramCache]: Analyzing trace with hash 110284972, now seen corresponding path program 34 times [2019-09-07 09:28:21,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:21,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:21,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:21,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:21,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1978 backedges. 2 proven. 1764 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-09-07 09:28:22,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:22,391 INFO L223 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-09-07 09:28:22,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:28:22,466 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:28:22,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:22,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 44 conjunts are in the unsatisfiable core [2019-09-07 09:28:22,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1978 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-09-07 09:28:22,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:22,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2019-09-07 09:28:22,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-09-07 09:28:22,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-09-07 09:28:22,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 09:28:22,527 INFO L87 Difference]: Start difference. First operand 212 states and 252 transitions. Second operand 46 states. [2019-09-07 09:28:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:22,654 INFO L93 Difference]: Finished difference Result 336 states and 416 transitions. [2019-09-07 09:28:22,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 09:28:22,655 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 147 [2019-09-07 09:28:22,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:22,656 INFO L225 Difference]: With dead ends: 336 [2019-09-07 09:28:22,656 INFO L226 Difference]: Without dead ends: 215 [2019-09-07 09:28:22,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 09:28:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-09-07 09:28:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-09-07 09:28:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-09-07 09:28:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2019-09-07 09:28:22,664 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 147 [2019-09-07 09:28:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:22,664 INFO L475 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2019-09-07 09:28:22,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-09-07 09:28:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2019-09-07 09:28:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-07 09:28:22,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:22,665 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:22,666 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash -385257590, now seen corresponding path program 35 times [2019-09-07 09:28:22,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:22,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:22,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2063 backedges. 2 proven. 1849 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-09-07 09:28:23,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:23,535 INFO L223 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-09-07 09:28:23,545 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:28:28,406 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2019-09-07 09:28:28,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:28,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 09:28:28,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2063 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2019-09-07 09:28:28,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:28,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2019-09-07 09:28:28,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 09:28:28,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 09:28:28,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:28:28,465 INFO L87 Difference]: Start difference. First operand 214 states and 254 transitions. Second operand 47 states. [2019-09-07 09:28:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:28,585 INFO L93 Difference]: Finished difference Result 338 states and 418 transitions. [2019-09-07 09:28:28,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-07 09:28:28,586 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 149 [2019-09-07 09:28:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:28,587 INFO L225 Difference]: With dead ends: 338 [2019-09-07 09:28:28,587 INFO L226 Difference]: Without dead ends: 217 [2019-09-07 09:28:28,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 149 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-09-07 09:28:28,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-09-07 09:28:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 216. [2019-09-07 09:28:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-09-07 09:28:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 256 transitions. [2019-09-07 09:28:28,595 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 256 transitions. Word has length 149 [2019-09-07 09:28:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:28,595 INFO L475 AbstractCegarLoop]: Abstraction has 216 states and 256 transitions. [2019-09-07 09:28:28,595 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 09:28:28,595 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 256 transitions. [2019-09-07 09:28:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-07 09:28:28,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:28,596 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:28,597 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:28,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash 139710184, now seen corresponding path program 36 times [2019-09-07 09:28:28,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:28,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:28,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 2 proven. 1936 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2019-09-07 09:28:29,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:29,407 INFO L223 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-09-07 09:28:29,419 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:28:31,313 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2019-09-07 09:28:31,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:31,317 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 09:28:31,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:31,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2150 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 1940 trivial. 0 not checked. [2019-09-07 09:28:31,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:31,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 16] total 61 [2019-09-07 09:28:31,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 09:28:31,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 09:28:31,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1187, Invalid=2473, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:28:31,642 INFO L87 Difference]: Start difference. First operand 216 states and 256 transitions. Second operand 61 states. [2019-09-07 09:28:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:33,633 INFO L93 Difference]: Finished difference Result 356 states and 445 transitions. [2019-09-07 09:28:33,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 09:28:33,636 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 151 [2019-09-07 09:28:33,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:33,637 INFO L225 Difference]: With dead ends: 356 [2019-09-07 09:28:33,637 INFO L226 Difference]: Without dead ends: 235 [2019-09-07 09:28:33,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2269 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3555, Invalid=10487, Unknown=0, NotChecked=0, Total=14042 [2019-09-07 09:28:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-09-07 09:28:33,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 224. [2019-09-07 09:28:33,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-07 09:28:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 266 transitions. [2019-09-07 09:28:33,646 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 266 transitions. Word has length 151 [2019-09-07 09:28:33,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:33,647 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 266 transitions. [2019-09-07 09:28:33,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 09:28:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 266 transitions. [2019-09-07 09:28:33,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-07 09:28:33,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:33,648 INFO L399 BasicCegarLoop]: trace histogram [45, 45, 13, 13, 13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:33,648 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:33,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1732118085, now seen corresponding path program 37 times [2019-09-07 09:28:33,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:33,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:33,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:33,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:33,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:34,481 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 2 proven. 2025 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-09-07 09:28:34,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:34,482 INFO L223 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-09-07 09:28:34,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:28:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:34,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 09:28:34,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:34,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (42)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:28:34,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:34,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 49 [2019-09-07 09:28:34,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 09:28:34,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 09:28:34,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:28:34,602 INFO L87 Difference]: Start difference. First operand 224 states and 266 transitions. Second operand 49 states. [2019-09-07 09:28:34,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:34,743 INFO L93 Difference]: Finished difference Result 354 states and 438 transitions. [2019-09-07 09:28:34,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 09:28:34,744 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 156 [2019-09-07 09:28:34,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:34,745 INFO L225 Difference]: With dead ends: 354 [2019-09-07 09:28:34,745 INFO L226 Difference]: Without dead ends: 227 [2019-09-07 09:28:34,745 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:28:34,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-07 09:28:34,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-09-07 09:28:34,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-09-07 09:28:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 268 transitions. [2019-09-07 09:28:34,752 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 268 transitions. Word has length 156 [2019-09-07 09:28:34,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:34,752 INFO L475 AbstractCegarLoop]: Abstraction has 226 states and 268 transitions. [2019-09-07 09:28:34,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 09:28:34,752 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 268 transitions. [2019-09-07 09:28:34,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-07 09:28:34,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:34,753 INFO L399 BasicCegarLoop]: trace histogram [46, 46, 13, 13, 13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:34,753 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:34,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:34,754 INFO L82 PathProgramCache]: Analyzing trace with hash 352928039, now seen corresponding path program 38 times [2019-09-07 09:28:34,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:34,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:34,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:28:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2367 backedges. 2 proven. 2116 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-09-07 09:28:35,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:35,624 INFO L223 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-09-07 09:28:35,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:28:35,713 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:28:35,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:35,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 09:28:35,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2367 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (43)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:28:35,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:35,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 50 [2019-09-07 09:28:35,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 09:28:35,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 09:28:35,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 09:28:35,773 INFO L87 Difference]: Start difference. First operand 226 states and 268 transitions. Second operand 50 states. [2019-09-07 09:28:35,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:35,913 INFO L93 Difference]: Finished difference Result 356 states and 440 transitions. [2019-09-07 09:28:35,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 09:28:35,913 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 158 [2019-09-07 09:28:35,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:35,915 INFO L225 Difference]: With dead ends: 356 [2019-09-07 09:28:35,915 INFO L226 Difference]: Without dead ends: 229 [2019-09-07 09:28:35,917 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 09:28:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-09-07 09:28:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 228. [2019-09-07 09:28:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2019-09-07 09:28:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 270 transitions. [2019-09-07 09:28:35,934 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 270 transitions. Word has length 158 [2019-09-07 09:28:35,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:35,936 INFO L475 AbstractCegarLoop]: Abstraction has 228 states and 270 transitions. [2019-09-07 09:28:35,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 09:28:35,936 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 270 transitions. [2019-09-07 09:28:35,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-07 09:28:35,937 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:35,937 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 13, 13, 13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:35,938 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:35,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:35,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2096188297, now seen corresponding path program 39 times [2019-09-07 09:28:35,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:35,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:35,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:35,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:35,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:35,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:36,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 2 proven. 2209 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-09-07 09:28:36,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:36,822 INFO L223 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-09-07 09:28:36,835 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:28:37,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-09-07 09:28:37,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:37,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 09:28:37,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2460 backedges. 93 proven. 247 refuted. 0 times theorem prover too weak. 2120 trivial. 0 not checked. [2019-09-07 09:28:37,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:37,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 19] total 67 [2019-09-07 09:28:37,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 09:28:37,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 09:28:37,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1447, Invalid=2975, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 09:28:37,538 INFO L87 Difference]: Start difference. First operand 228 states and 270 transitions. Second operand 67 states. [2019-09-07 09:28:39,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:39,898 INFO L93 Difference]: Finished difference Result 375 states and 469 transitions. [2019-09-07 09:28:39,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 09:28:39,898 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 160 [2019-09-07 09:28:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:39,900 INFO L225 Difference]: With dead ends: 375 [2019-09-07 09:28:39,900 INFO L226 Difference]: Without dead ends: 248 [2019-09-07 09:28:39,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2737 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4363, Invalid=12667, Unknown=0, NotChecked=0, Total=17030 [2019-09-07 09:28:39,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-09-07 09:28:39,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 238. [2019-09-07 09:28:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-09-07 09:28:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 282 transitions. [2019-09-07 09:28:39,909 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 282 transitions. Word has length 160 [2019-09-07 09:28:39,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:39,909 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 282 transitions. [2019-09-07 09:28:39,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 09:28:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 282 transitions. [2019-09-07 09:28:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-07 09:28:39,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:39,911 INFO L399 BasicCegarLoop]: trace histogram [49, 49, 14, 14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:39,911 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:39,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:39,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1648145630, now seen corresponding path program 40 times [2019-09-07 09:28:39,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:39,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:39,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:39,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2692 backedges. 2 proven. 2401 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 09:28:40,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:40,888 INFO L223 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-09-07 09:28:40,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:28:40,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:28:40,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:28:40,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-07 09:28:40,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:28:41,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2692 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-07 09:28:41,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:28:41,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 53 [2019-09-07 09:28:41,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 09:28:41,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 09:28:41,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:28:41,024 INFO L87 Difference]: Start difference. First operand 238 states and 282 transitions. Second operand 53 states. [2019-09-07 09:28:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:28:41,183 INFO L93 Difference]: Finished difference Result 374 states and 462 transitions. [2019-09-07 09:28:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 09:28:41,184 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 167 [2019-09-07 09:28:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:28:41,185 INFO L225 Difference]: With dead ends: 374 [2019-09-07 09:28:41,185 INFO L226 Difference]: Without dead ends: 241 [2019-09-07 09:28:41,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:28:41,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-09-07 09:28:41,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2019-09-07 09:28:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-07 09:28:41,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 284 transitions. [2019-09-07 09:28:41,194 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 284 transitions. Word has length 167 [2019-09-07 09:28:41,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:28:41,194 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 284 transitions. [2019-09-07 09:28:41,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 09:28:41,195 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 284 transitions. [2019-09-07 09:28:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-07 09:28:41,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:28:41,196 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 14, 14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:28:41,196 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:28:41,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:28:41,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1042466628, now seen corresponding path program 41 times [2019-09-07 09:28:41,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:28:41,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:28:41,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:41,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:28:41,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:28:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:28:42,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2791 backedges. 2 proven. 2500 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 09:28:42,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:28:42,200 INFO L223 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-09-07 09:28:42,211 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:29:21,052 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) [2019-09-07 09:29:21,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:21,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 09:29:21,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2791 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-07 09:29:21,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:21,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 54 [2019-09-07 09:29:21,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-07 09:29:21,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-07 09:29:21,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 09:29:21,152 INFO L87 Difference]: Start difference. First operand 240 states and 284 transitions. Second operand 54 states. [2019-09-07 09:29:21,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:21,316 INFO L93 Difference]: Finished difference Result 376 states and 464 transitions. [2019-09-07 09:29:21,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 09:29:21,317 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 169 [2019-09-07 09:29:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:21,318 INFO L225 Difference]: With dead ends: 376 [2019-09-07 09:29:21,318 INFO L226 Difference]: Without dead ends: 243 [2019-09-07 09:29:21,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 09:29:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-07 09:29:21,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2019-09-07 09:29:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-07 09:29:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 286 transitions. [2019-09-07 09:29:21,331 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 286 transitions. Word has length 169 [2019-09-07 09:29:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:21,332 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 286 transitions. [2019-09-07 09:29:21,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-07 09:29:21,333 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 286 transitions. [2019-09-07 09:29:21,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-07 09:29:21,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:21,336 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 14, 14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:21,336 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:21,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:21,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1150534374, now seen corresponding path program 42 times [2019-09-07 09:29:21,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:21,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:21,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:21,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:21,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:22,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2892 backedges. 2 proven. 2601 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 09:29:22,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:22,479 INFO L223 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-09-07 09:29:22,491 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:29:25,289 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 29 check-sat command(s) [2019-09-07 09:29:25,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:25,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 09:29:25,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:25,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2892 backedges. 101 proven. 287 refuted. 0 times theorem prover too weak. 2504 trivial. 0 not checked. [2019-09-07 09:29:25,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:25,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 20] total 72 [2019-09-07 09:29:25,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-09-07 09:29:25,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-09-07 09:29:25,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1677, Invalid=3435, Unknown=0, NotChecked=0, Total=5112 [2019-09-07 09:29:25,892 INFO L87 Difference]: Start difference. First operand 242 states and 286 transitions. Second operand 72 states. [2019-09-07 09:29:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:28,755 INFO L93 Difference]: Finished difference Result 395 states and 493 transitions. [2019-09-07 09:29:28,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-07 09:29:28,755 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2019-09-07 09:29:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:28,757 INFO L225 Difference]: With dead ends: 395 [2019-09-07 09:29:28,757 INFO L226 Difference]: Without dead ends: 262 [2019-09-07 09:29:28,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3179 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5055, Invalid=14685, Unknown=0, NotChecked=0, Total=19740 [2019-09-07 09:29:28,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-07 09:29:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 252. [2019-09-07 09:29:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-09-07 09:29:28,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 298 transitions. [2019-09-07 09:29:28,767 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 298 transitions. Word has length 171 [2019-09-07 09:29:28,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:28,767 INFO L475 AbstractCegarLoop]: Abstraction has 252 states and 298 transitions. [2019-09-07 09:29:28,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-09-07 09:29:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 298 transitions. [2019-09-07 09:29:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-07 09:29:28,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:28,769 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:28,769 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:28,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:28,769 INFO L82 PathProgramCache]: Analyzing trace with hash 269157301, now seen corresponding path program 43 times [2019-09-07 09:29:28,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:28,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:28,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:28,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:28,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:28,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3143 backedges. 2 proven. 2809 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2019-09-07 09:29:29,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:29,878 INFO L223 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-09-07 09:29:29,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:29,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 09:29:29,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3143 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-09-07 09:29:30,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:30,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 57 [2019-09-07 09:29:30,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-07 09:29:30,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-07 09:29:30,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 09:29:30,018 INFO L87 Difference]: Start difference. First operand 252 states and 298 transitions. Second operand 57 states. [2019-09-07 09:29:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:30,188 INFO L93 Difference]: Finished difference Result 394 states and 486 transitions. [2019-09-07 09:29:30,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 09:29:30,189 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 178 [2019-09-07 09:29:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:30,191 INFO L225 Difference]: With dead ends: 394 [2019-09-07 09:29:30,191 INFO L226 Difference]: Without dead ends: 255 [2019-09-07 09:29:30,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-09-07 09:29:30,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-09-07 09:29:30,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-09-07 09:29:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-09-07 09:29:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 300 transitions. [2019-09-07 09:29:30,203 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 300 transitions. Word has length 178 [2019-09-07 09:29:30,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:30,203 INFO L475 AbstractCegarLoop]: Abstraction has 254 states and 300 transitions. [2019-09-07 09:29:30,204 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-09-07 09:29:30,204 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 300 transitions. [2019-09-07 09:29:30,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-07 09:29:30,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:30,206 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:30,206 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:30,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:30,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1075317015, now seen corresponding path program 44 times [2019-09-07 09:29:30,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:30,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:30,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:30,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:30,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3250 backedges. 2 proven. 2916 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2019-09-07 09:29:31,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:31,818 INFO L223 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-09-07 09:29:31,829 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:29:31,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:29:31,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:31,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 09:29:31,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:31,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3250 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2019-09-07 09:29:31,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:31,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 58 [2019-09-07 09:29:31,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 09:29:31,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 09:29:31,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 09:29:31,960 INFO L87 Difference]: Start difference. First operand 254 states and 300 transitions. Second operand 58 states. [2019-09-07 09:29:32,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:32,230 INFO L93 Difference]: Finished difference Result 396 states and 488 transitions. [2019-09-07 09:29:32,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-07 09:29:32,230 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 180 [2019-09-07 09:29:32,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:32,232 INFO L225 Difference]: With dead ends: 396 [2019-09-07 09:29:32,232 INFO L226 Difference]: Without dead ends: 257 [2019-09-07 09:29:32,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 09:29:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-09-07 09:29:32,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2019-09-07 09:29:32,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-07 09:29:32,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 302 transitions. [2019-09-07 09:29:32,247 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 302 transitions. Word has length 180 [2019-09-07 09:29:32,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:32,248 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 302 transitions. [2019-09-07 09:29:32,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 09:29:32,248 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 302 transitions. [2019-09-07 09:29:32,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-07 09:29:32,250 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:32,250 INFO L399 BasicCegarLoop]: trace histogram [55, 55, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:32,250 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:32,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:32,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1594278407, now seen corresponding path program 45 times [2019-09-07 09:29:32,251 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:32,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:32,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:32,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:32,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 2 proven. 3025 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2019-09-07 09:29:33,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:33,591 INFO L223 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-09-07 09:29:33,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:29:33,867 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-07 09:29:33,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:33,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 09:29:33,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3359 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 3029 trivial. 0 not checked. [2019-09-07 09:29:34,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:34,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 19] total 75 [2019-09-07 09:29:34,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-09-07 09:29:34,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-09-07 09:29:34,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1807, Invalid=3743, Unknown=0, NotChecked=0, Total=5550 [2019-09-07 09:29:34,363 INFO L87 Difference]: Start difference. First operand 256 states and 302 transitions. Second operand 75 states. [2019-09-07 09:29:37,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:37,278 INFO L93 Difference]: Finished difference Result 414 states and 515 transitions. [2019-09-07 09:29:37,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 09:29:37,278 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 182 [2019-09-07 09:29:37,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:37,279 INFO L225 Difference]: With dead ends: 414 [2019-09-07 09:29:37,279 INFO L226 Difference]: Without dead ends: 275 [2019-09-07 09:29:37,280 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3491 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5415, Invalid=16047, Unknown=0, NotChecked=0, Total=21462 [2019-09-07 09:29:37,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-09-07 09:29:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 264. [2019-09-07 09:29:37,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-09-07 09:29:37,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 312 transitions. [2019-09-07 09:29:37,287 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 312 transitions. Word has length 182 [2019-09-07 09:29:37,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:37,287 INFO L475 AbstractCegarLoop]: Abstraction has 264 states and 312 transitions. [2019-09-07 09:29:37,288 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-09-07 09:29:37,288 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 312 transitions. [2019-09-07 09:29:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-07 09:29:37,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:37,289 INFO L399 BasicCegarLoop]: trace histogram [56, 56, 16, 16, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:37,289 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:37,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1466175856, now seen corresponding path program 46 times [2019-09-07 09:29:37,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:37,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:37,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:37,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:38,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3516 backedges. 2 proven. 3136 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-07 09:29:38,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:38,510 INFO L223 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-09-07 09:29:38,519 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:29:38,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:29:38,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:38,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-07 09:29:38,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3516 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:29:38,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:38,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 60 [2019-09-07 09:29:38,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-09-07 09:29:38,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-09-07 09:29:38,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-09-07 09:29:38,657 INFO L87 Difference]: Start difference. First operand 264 states and 312 transitions. Second operand 60 states. [2019-09-07 09:29:38,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:38,833 INFO L93 Difference]: Finished difference Result 412 states and 508 transitions. [2019-09-07 09:29:38,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 09:29:38,834 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 187 [2019-09-07 09:29:38,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:38,835 INFO L225 Difference]: With dead ends: 412 [2019-09-07 09:29:38,836 INFO L226 Difference]: Without dead ends: 267 [2019-09-07 09:29:38,836 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 187 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-09-07 09:29:38,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-09-07 09:29:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2019-09-07 09:29:38,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-07 09:29:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 314 transitions. [2019-09-07 09:29:38,844 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 314 transitions. Word has length 187 [2019-09-07 09:29:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:38,844 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 314 transitions. [2019-09-07 09:29:38,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-09-07 09:29:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 314 transitions. [2019-09-07 09:29:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-07 09:29:38,845 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:38,846 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 16, 16, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:38,846 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:38,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:38,846 INFO L82 PathProgramCache]: Analyzing trace with hash 713152366, now seen corresponding path program 47 times [2019-09-07 09:29:38,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:38,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:38,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:38,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:38,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:40,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 2 proven. 3249 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-07 09:29:40,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:40,133 INFO L223 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-09-07 09:29:40,146 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:30:09,017 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 58 check-sat command(s) [2019-09-07 09:30:09,018 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:09,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 09:30:09,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-09-07 09:30:09,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:09,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60] total 61 [2019-09-07 09:30:09,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 09:30:09,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 09:30:09,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:30:09,090 INFO L87 Difference]: Start difference. First operand 266 states and 314 transitions. Second operand 61 states. [2019-09-07 09:30:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:09,329 INFO L93 Difference]: Finished difference Result 414 states and 510 transitions. [2019-09-07 09:30:09,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-07 09:30:09,330 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 189 [2019-09-07 09:30:09,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:09,331 INFO L225 Difference]: With dead ends: 414 [2019-09-07 09:30:09,331 INFO L226 Difference]: Without dead ends: 269 [2019-09-07 09:30:09,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:30:09,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-09-07 09:30:09,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2019-09-07 09:30:09,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-09-07 09:30:09,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 316 transitions. [2019-09-07 09:30:09,340 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 316 transitions. Word has length 189 [2019-09-07 09:30:09,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:09,340 INFO L475 AbstractCegarLoop]: Abstraction has 268 states and 316 transitions. [2019-09-07 09:30:09,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 09:30:09,341 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 316 transitions. [2019-09-07 09:30:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-07 09:30:09,342 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:09,342 INFO L399 BasicCegarLoop]: trace histogram [58, 58, 16, 16, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:09,342 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:09,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:09,342 INFO L82 PathProgramCache]: Analyzing trace with hash -896466740, now seen corresponding path program 48 times [2019-09-07 09:30:09,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:09,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:09,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:09,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 2 proven. 3364 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-09-07 09:30:10,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:10,670 INFO L223 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-09-07 09:30:10,680 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:30:21,571 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-09-07 09:30:21,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:21,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 09:30:21,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:22,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 3368 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (53)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:30:22,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:22,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 20] total 79 [2019-09-07 09:30:22,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-09-07 09:30:22,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-09-07 09:30:22,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2002, Invalid=4160, Unknown=0, NotChecked=0, Total=6162 [2019-09-07 09:30:22,264 INFO L87 Difference]: Start difference. First operand 268 states and 316 transitions. Second operand 79 states. [2019-09-07 09:30:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:25,407 INFO L93 Difference]: Finished difference Result 432 states and 537 transitions. [2019-09-07 09:30:25,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-07 09:30:25,412 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 191 [2019-09-07 09:30:25,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:25,414 INFO L225 Difference]: With dead ends: 432 [2019-09-07 09:30:25,414 INFO L226 Difference]: Without dead ends: 287 [2019-09-07 09:30:25,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3894 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6000, Invalid=17870, Unknown=0, NotChecked=0, Total=23870 [2019-09-07 09:30:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-09-07 09:30:25,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 276. [2019-09-07 09:30:25,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-07 09:30:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 326 transitions. [2019-09-07 09:30:25,424 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 326 transitions. Word has length 191 [2019-09-07 09:30:25,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:25,424 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 326 transitions. [2019-09-07 09:30:25,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-09-07 09:30:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 326 transitions. [2019-09-07 09:30:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-07 09:30:25,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:25,426 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 17, 17, 17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:25,426 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:25,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:25,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1127763937, now seen corresponding path program 49 times [2019-09-07 09:30:25,426 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:25,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:25,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:25,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:25,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3910 backedges. 2 proven. 3481 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2019-09-07 09:30:26,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:26,915 INFO L223 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-09-07 09:30:26,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:27,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-07 09:30:27,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3910 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2019-09-07 09:30:27,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:27,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 63 [2019-09-07 09:30:27,060 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 09:30:27,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 09:30:27,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 09:30:27,061 INFO L87 Difference]: Start difference. First operand 276 states and 326 transitions. Second operand 63 states. [2019-09-07 09:30:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:27,304 INFO L93 Difference]: Finished difference Result 430 states and 530 transitions. [2019-09-07 09:30:27,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 09:30:27,304 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 196 [2019-09-07 09:30:27,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:27,305 INFO L225 Difference]: With dead ends: 430 [2019-09-07 09:30:27,305 INFO L226 Difference]: Without dead ends: 279 [2019-09-07 09:30:27,306 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 09:30:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-07 09:30:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 278. [2019-09-07 09:30:27,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-07 09:30:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 328 transitions. [2019-09-07 09:30:27,314 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 328 transitions. Word has length 196 [2019-09-07 09:30:27,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:27,314 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 328 transitions. [2019-09-07 09:30:27,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 09:30:27,314 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 328 transitions. [2019-09-07 09:30:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-07 09:30:27,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:27,316 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 17, 17, 17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:27,316 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:27,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:27,316 INFO L82 PathProgramCache]: Analyzing trace with hash 2032632003, now seen corresponding path program 50 times [2019-09-07 09:30:27,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:27,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:27,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:27,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:27,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4029 backedges. 2 proven. 3600 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2019-09-07 09:30:28,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:28,690 INFO L223 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-09-07 09:30:28,700 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:30:28,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:30:28,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:28,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-07 09:30:28,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4029 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 429 trivial. 0 not checked. [2019-09-07 09:30:28,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:28,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 64 [2019-09-07 09:30:28,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-09-07 09:30:28,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-09-07 09:30:28,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 09:30:28,838 INFO L87 Difference]: Start difference. First operand 278 states and 328 transitions. Second operand 64 states. [2019-09-07 09:30:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:29,077 INFO L93 Difference]: Finished difference Result 432 states and 532 transitions. [2019-09-07 09:30:29,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 09:30:29,077 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 198 [2019-09-07 09:30:29,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:29,078 INFO L225 Difference]: With dead ends: 432 [2019-09-07 09:30:29,079 INFO L226 Difference]: Without dead ends: 281 [2019-09-07 09:30:29,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-09-07 09:30:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-09-07 09:30:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2019-09-07 09:30:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-09-07 09:30:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 330 transitions. [2019-09-07 09:30:29,087 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 330 transitions. Word has length 198 [2019-09-07 09:30:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:29,088 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 330 transitions. [2019-09-07 09:30:29,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-09-07 09:30:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 330 transitions. [2019-09-07 09:30:29,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-07 09:30:29,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:29,089 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 17, 17, 17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:29,090 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:29,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:29,090 INFO L82 PathProgramCache]: Analyzing trace with hash -267517659, now seen corresponding path program 51 times [2019-09-07 09:30:29,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:29,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:29,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:29,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:29,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:30,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4150 backedges. 2 proven. 3721 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2019-09-07 09:30:30,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:30,531 INFO L223 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-09-07 09:30:30,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:30:30,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-09-07 09:30:30,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:30,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 09:30:30,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:31,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4150 backedges. 121 proven. 425 refuted. 0 times theorem prover too weak. 3604 trivial. 0 not checked. [2019-09-07 09:30:31,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:31,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 23] total 85 [2019-09-07 09:30:31,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-09-07 09:30:31,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-09-07 09:30:31,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2336, Invalid=4804, Unknown=0, NotChecked=0, Total=7140 [2019-09-07 09:30:31,784 INFO L87 Difference]: Start difference. First operand 280 states and 330 transitions. Second operand 85 states. [2019-09-07 09:30:35,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:35,624 INFO L93 Difference]: Finished difference Result 451 states and 561 transitions. [2019-09-07 09:30:35,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-09-07 09:30:35,625 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 200 [2019-09-07 09:30:35,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:35,626 INFO L225 Difference]: With dead ends: 451 [2019-09-07 09:30:35,626 INFO L226 Difference]: Without dead ends: 300 [2019-09-07 09:30:35,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4500 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7038, Invalid=20684, Unknown=0, NotChecked=0, Total=27722 [2019-09-07 09:30:35,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-09-07 09:30:35,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 290. [2019-09-07 09:30:35,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-09-07 09:30:35,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 342 transitions. [2019-09-07 09:30:35,642 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 342 transitions. Word has length 200 [2019-09-07 09:30:35,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:35,642 INFO L475 AbstractCegarLoop]: Abstraction has 290 states and 342 transitions. [2019-09-07 09:30:35,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-09-07 09:30:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 342 transitions. [2019-09-07 09:30:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-07 09:30:35,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:35,644 INFO L399 BasicCegarLoop]: trace histogram [63, 63, 18, 18, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:35,644 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:35,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:35,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1715806782, now seen corresponding path program 52 times [2019-09-07 09:30:35,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:35,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:35,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:35,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:35,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4450 backedges. 2 proven. 3969 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2019-09-07 09:30:37,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:37,246 INFO L223 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-09-07 09:30:37,257 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:30:37,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:30:37,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:37,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-07 09:30:37,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:37,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4450 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2019-09-07 09:30:37,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:37,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66] total 67 [2019-09-07 09:30:37,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-09-07 09:30:37,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-09-07 09:30:37,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-09-07 09:30:37,390 INFO L87 Difference]: Start difference. First operand 290 states and 342 transitions. Second operand 67 states. [2019-09-07 09:30:37,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:37,665 INFO L93 Difference]: Finished difference Result 450 states and 554 transitions. [2019-09-07 09:30:37,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-07 09:30:37,666 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 207 [2019-09-07 09:30:37,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:37,667 INFO L225 Difference]: With dead ends: 450 [2019-09-07 09:30:37,667 INFO L226 Difference]: Without dead ends: 293 [2019-09-07 09:30:37,667 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 207 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-09-07 09:30:37,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-09-07 09:30:37,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2019-09-07 09:30:37,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-07 09:30:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 344 transitions. [2019-09-07 09:30:37,676 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 344 transitions. Word has length 207 [2019-09-07 09:30:37,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:37,676 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 344 transitions. [2019-09-07 09:30:37,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-09-07 09:30:37,676 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 344 transitions. [2019-09-07 09:30:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-07 09:30:37,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:37,699 INFO L399 BasicCegarLoop]: trace histogram [64, 64, 18, 18, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:37,700 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:37,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:37,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1035883616, now seen corresponding path program 53 times [2019-09-07 09:30:37,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:37,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:37,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:37,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:37,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 4577 backedges. 2 proven. 4096 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2019-09-07 09:30:39,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:39,296 INFO L223 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-09-07 09:30:39,309 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:31:18,127 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 65 check-sat command(s) [2019-09-07 09:31:18,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:31:18,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 66 conjunts are in the unsatisfiable core [2019-09-07 09:31:18,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:31:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4577 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2019-09-07 09:31:18,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:31:18,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 68 [2019-09-07 09:31:18,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-09-07 09:31:18,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-09-07 09:31:18,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 09:31:18,251 INFO L87 Difference]: Start difference. First operand 292 states and 344 transitions. Second operand 68 states. [2019-09-07 09:31:18,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:31:18,451 INFO L93 Difference]: Finished difference Result 452 states and 556 transitions. [2019-09-07 09:31:18,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-07 09:31:18,451 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 209 [2019-09-07 09:31:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:31:18,452 INFO L225 Difference]: With dead ends: 452 [2019-09-07 09:31:18,452 INFO L226 Difference]: Without dead ends: 295 [2019-09-07 09:31:18,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-09-07 09:31:18,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-09-07 09:31:18,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 294. [2019-09-07 09:31:18,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2019-09-07 09:31:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 346 transitions. [2019-09-07 09:31:18,460 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 346 transitions. Word has length 209 [2019-09-07 09:31:18,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:31:18,460 INFO L475 AbstractCegarLoop]: Abstraction has 294 states and 346 transitions. [2019-09-07 09:31:18,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-09-07 09:31:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 346 transitions. [2019-09-07 09:31:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-07 09:31:18,462 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:31:18,462 INFO L399 BasicCegarLoop]: trace histogram [65, 65, 18, 18, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:31:18,462 INFO L418 AbstractCegarLoop]: === Iteration 64 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:31:18,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:31:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash -464750082, now seen corresponding path program 54 times [2019-09-07 09:31:18,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:31:18,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:31:18,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:18,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:31:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4706 backedges. 2 proven. 4225 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2019-09-07 09:31:20,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:31:20,148 INFO L223 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-09-07 09:31:20,158 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:31:39,938 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-07 09:31:39,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:31:39,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 09:31:39,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:31:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4706 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 4229 trivial. 0 not checked. [2019-09-07 09:31:40,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:31:40,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 22] total 88 [2019-09-07 09:31:40,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-07 09:31:40,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-07 09:31:40,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2489, Invalid=5167, Unknown=0, NotChecked=0, Total=7656 [2019-09-07 09:31:40,597 INFO L87 Difference]: Start difference. First operand 294 states and 346 transitions. Second operand 88 states. [2019-09-07 09:31:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:31:44,443 INFO L93 Difference]: Finished difference Result 470 states and 583 transitions. [2019-09-07 09:31:44,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-09-07 09:31:44,443 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2019-09-07 09:31:44,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:31:44,444 INFO L225 Difference]: With dead ends: 470 [2019-09-07 09:31:44,445 INFO L226 Difference]: Without dead ends: 313 [2019-09-07 09:31:44,446 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4870 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7461, Invalid=22295, Unknown=0, NotChecked=0, Total=29756 [2019-09-07 09:31:44,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-09-07 09:31:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 302. [2019-09-07 09:31:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-07 09:31:44,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 356 transitions. [2019-09-07 09:31:44,457 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 356 transitions. Word has length 211 [2019-09-07 09:31:44,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:31:44,457 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 356 transitions. [2019-09-07 09:31:44,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-07 09:31:44,457 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 356 transitions. [2019-09-07 09:31:44,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-07 09:31:44,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:31:44,459 INFO L399 BasicCegarLoop]: trace histogram [66, 66, 19, 19, 19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:31:44,459 INFO L418 AbstractCegarLoop]: === Iteration 65 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:31:44,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:31:44,459 INFO L82 PathProgramCache]: Analyzing trace with hash -717722513, now seen corresponding path program 55 times [2019-09-07 09:31:44,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:31:44,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:31:44,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:44,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:31:44,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:46,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4892 backedges. 2 proven. 4356 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 09:31:46,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:31:46,085 INFO L223 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-09-07 09:31:46,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:31:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:46,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 68 conjunts are in the unsatisfiable core [2019-09-07 09:31:46,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:31:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4892 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-09-07 09:31:46,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:31:46,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 70 [2019-09-07 09:31:46,251 INFO L454 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-09-07 09:31:46,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-09-07 09:31:46,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 09:31:46,252 INFO L87 Difference]: Start difference. First operand 302 states and 356 transitions. Second operand 70 states. [2019-09-07 09:31:46,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:31:46,469 INFO L93 Difference]: Finished difference Result 468 states and 576 transitions. [2019-09-07 09:31:46,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 09:31:46,470 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 216 [2019-09-07 09:31:46,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:31:46,471 INFO L225 Difference]: With dead ends: 468 [2019-09-07 09:31:46,471 INFO L226 Difference]: Without dead ends: 305 [2019-09-07 09:31:46,472 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-09-07 09:31:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-09-07 09:31:46,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2019-09-07 09:31:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-09-07 09:31:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 358 transitions. [2019-09-07 09:31:46,482 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 358 transitions. Word has length 216 [2019-09-07 09:31:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:31:46,483 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 358 transitions. [2019-09-07 09:31:46,483 INFO L476 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-09-07 09:31:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 358 transitions. [2019-09-07 09:31:46,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-07 09:31:46,484 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:31:46,484 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 19, 19, 19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:31:46,485 INFO L418 AbstractCegarLoop]: === Iteration 66 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:31:46,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:31:46,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1967630255, now seen corresponding path program 56 times [2019-09-07 09:31:46,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:31:46,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:31:46,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:46,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:31:46,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:48,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5025 backedges. 2 proven. 4489 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 09:31:48,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:31:48,324 INFO L223 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-09-07 09:31:48,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:31:48,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:31:48,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:31:48,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-07 09:31:48,437 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:31:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5025 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2019-09-07 09:31:48,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:31:48,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70] total 71 [2019-09-07 09:31:48,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-09-07 09:31:48,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-09-07 09:31:48,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 09:31:48,488 INFO L87 Difference]: Start difference. First operand 304 states and 358 transitions. Second operand 71 states. [2019-09-07 09:31:48,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:31:48,730 INFO L93 Difference]: Finished difference Result 470 states and 578 transitions. [2019-09-07 09:31:48,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-09-07 09:31:48,731 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 218 [2019-09-07 09:31:48,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:31:48,732 INFO L225 Difference]: With dead ends: 470 [2019-09-07 09:31:48,732 INFO L226 Difference]: Without dead ends: 307 [2019-09-07 09:31:48,733 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-09-07 09:31:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-09-07 09:31:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 306. [2019-09-07 09:31:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-09-07 09:31:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 360 transitions. [2019-09-07 09:31:48,740 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 360 transitions. Word has length 218 [2019-09-07 09:31:48,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:31:48,740 INFO L475 AbstractCegarLoop]: Abstraction has 306 states and 360 transitions. [2019-09-07 09:31:48,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-09-07 09:31:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 360 transitions. [2019-09-07 09:31:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-09-07 09:31:48,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:31:48,742 INFO L399 BasicCegarLoop]: trace histogram [68, 68, 19, 19, 19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:31:48,742 INFO L418 AbstractCegarLoop]: === Iteration 67 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:31:48,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:31:48,743 INFO L82 PathProgramCache]: Analyzing trace with hash -538127437, now seen corresponding path program 57 times [2019-09-07 09:31:48,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:31:48,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:31:48,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:48,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:31:48,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:50,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5160 backedges. 2 proven. 4624 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2019-09-07 09:31:50,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:31:50,448 INFO L223 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-09-07 09:31:50,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:31:51,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-09-07 09:31:51,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:31:51,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 09:31:51,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:31:51,814 INFO L134 CoverageAnalysis]: Checked inductivity of 5160 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 4628 trivial. 0 not checked. [2019-09-07 09:31:51,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:31:51,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 23] total 92 [2019-09-07 09:31:51,819 INFO L454 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-09-07 09:31:51,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-09-07 09:31:51,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2717, Invalid=5655, Unknown=0, NotChecked=0, Total=8372 [2019-09-07 09:31:51,821 INFO L87 Difference]: Start difference. First operand 306 states and 360 transitions. Second operand 92 states. [2019-09-07 09:31:55,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:31:55,617 INFO L93 Difference]: Finished difference Result 488 states and 605 transitions. [2019-09-07 09:31:55,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-09-07 09:31:55,617 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-09-07 09:31:55,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:31:55,619 INFO L225 Difference]: With dead ends: 488 [2019-09-07 09:31:55,619 INFO L226 Difference]: Without dead ends: 325 [2019-09-07 09:31:55,621 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5344 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8145, Invalid=24435, Unknown=0, NotChecked=0, Total=32580 [2019-09-07 09:31:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-09-07 09:31:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 314. [2019-09-07 09:31:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-09-07 09:31:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 370 transitions. [2019-09-07 09:31:55,629 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 370 transitions. Word has length 220 [2019-09-07 09:31:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:31:55,629 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 370 transitions. [2019-09-07 09:31:55,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-09-07 09:31:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 370 transitions. [2019-09-07 09:31:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-07 09:31:55,630 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:31:55,630 INFO L399 BasicCegarLoop]: trace histogram [69, 69, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:31:55,631 INFO L418 AbstractCegarLoop]: === Iteration 68 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:31:55,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:31:55,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2047709206, now seen corresponding path program 58 times [2019-09-07 09:31:55,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:31:55,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:31:55,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:55,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:31:55,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:55,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5355 backedges. 2 proven. 4761 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2019-09-07 09:31:57,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:31:57,391 INFO L223 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-09-07 09:31:57,402 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:31:57,511 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:31:57,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:31:57,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 71 conjunts are in the unsatisfiable core [2019-09-07 09:31:57,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:31:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5355 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-09-07 09:31:57,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:31:57,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72] total 73 [2019-09-07 09:31:57,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-07 09:31:57,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-07 09:31:57,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 09:31:57,557 INFO L87 Difference]: Start difference. First operand 314 states and 370 transitions. Second operand 73 states. [2019-09-07 09:31:57,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:31:57,823 INFO L93 Difference]: Finished difference Result 486 states and 598 transitions. [2019-09-07 09:31:57,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-09-07 09:31:57,823 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 225 [2019-09-07 09:31:57,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:31:57,824 INFO L225 Difference]: With dead ends: 486 [2019-09-07 09:31:57,824 INFO L226 Difference]: Without dead ends: 317 [2019-09-07 09:31:57,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 09:31:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-09-07 09:31:57,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 316. [2019-09-07 09:31:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-09-07 09:31:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 372 transitions. [2019-09-07 09:31:57,831 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 372 transitions. Word has length 225 [2019-09-07 09:31:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:31:57,831 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 372 transitions. [2019-09-07 09:31:57,831 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-07 09:31:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 372 transitions. [2019-09-07 09:31:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-07 09:31:57,832 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:31:57,832 INFO L399 BasicCegarLoop]: trace histogram [70, 70, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:31:57,833 INFO L418 AbstractCegarLoop]: === Iteration 69 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:31:57,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:31:57,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1759780236, now seen corresponding path program 59 times [2019-09-07 09:31:57,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:31:57,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:31:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:57,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:31:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:59,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5494 backedges. 2 proven. 4900 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2019-09-07 09:31:59,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:31:59,667 INFO L223 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-09-07 09:31:59,681 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:34:13,547 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 71 check-sat command(s) [2019-09-07 09:34:13,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:34:13,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 72 conjunts are in the unsatisfiable core [2019-09-07 09:34:13,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:34:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5494 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2019-09-07 09:34:13,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:34:13,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73] total 74 [2019-09-07 09:34:13,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-07 09:34:13,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-07 09:34:13,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 09:34:13,662 INFO L87 Difference]: Start difference. First operand 316 states and 372 transitions. Second operand 74 states. [2019-09-07 09:34:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:34:13,909 INFO L93 Difference]: Finished difference Result 488 states and 600 transitions. [2019-09-07 09:34:13,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-07 09:34:13,910 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 227 [2019-09-07 09:34:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:34:13,911 INFO L225 Difference]: With dead ends: 488 [2019-09-07 09:34:13,911 INFO L226 Difference]: Without dead ends: 319 [2019-09-07 09:34:13,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-09-07 09:34:13,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-09-07 09:34:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 318. [2019-09-07 09:34:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-09-07 09:34:13,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 374 transitions. [2019-09-07 09:34:13,917 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 374 transitions. Word has length 227 [2019-09-07 09:34:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:34:13,917 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 374 transitions. [2019-09-07 09:34:13,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-07 09:34:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 374 transitions. [2019-09-07 09:34:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-07 09:34:13,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:34:13,919 INFO L399 BasicCegarLoop]: trace histogram [71, 71, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:34:13,919 INFO L418 AbstractCegarLoop]: === Iteration 70 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:34:13,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:34:13,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1444997806, now seen corresponding path program 60 times [2019-09-07 09:34:13,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:34:13,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:34:13,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:34:13,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:34:13,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:34:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:34:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5635 backedges. 2 proven. 5041 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2019-09-07 09:34:15,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:34:15,788 INFO L223 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-09-07 09:34:15,798 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:34:30,399 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 41 check-sat command(s) [2019-09-07 09:34:30,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:34:30,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 09:34:30,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:34:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5635 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 5045 trivial. 0 not checked. [2019-09-07 09:34:31,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:34:31,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 24] total 96 [2019-09-07 09:34:31,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-09-07 09:34:31,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-09-07 09:34:31,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2955, Invalid=6165, Unknown=0, NotChecked=0, Total=9120 [2019-09-07 09:34:31,195 INFO L87 Difference]: Start difference. First operand 318 states and 374 transitions. Second operand 96 states. [2019-09-07 09:34:35,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:34:35,485 INFO L93 Difference]: Finished difference Result 506 states and 627 transitions. [2019-09-07 09:34:35,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-09-07 09:34:35,486 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 229 [2019-09-07 09:34:35,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:34:35,487 INFO L225 Difference]: With dead ends: 506 [2019-09-07 09:34:35,487 INFO L226 Difference]: Without dead ends: 337 [2019-09-07 09:34:35,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5840 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8859, Invalid=26673, Unknown=0, NotChecked=0, Total=35532 [2019-09-07 09:34:35,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-09-07 09:34:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 326. [2019-09-07 09:34:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-07 09:34:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 384 transitions. [2019-09-07 09:34:35,497 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 384 transitions. Word has length 229 [2019-09-07 09:34:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:34:35,497 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 384 transitions. [2019-09-07 09:34:35,497 INFO L476 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-09-07 09:34:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 384 transitions. [2019-09-07 09:34:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-07 09:34:35,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:34:35,499 INFO L399 BasicCegarLoop]: trace histogram [72, 72, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:34:35,499 INFO L418 AbstractCegarLoop]: === Iteration 71 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:34:35,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:34:35,499 INFO L82 PathProgramCache]: Analyzing trace with hash -699102181, now seen corresponding path program 61 times [2019-09-07 09:34:35,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:34:35,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:34:35,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:34:35,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:34:35,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:34:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:34:37,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5839 backedges. 2 proven. 5184 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2019-09-07 09:34:37,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:34:37,410 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:34:37,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:34:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:34:37,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-07 09:34:37,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:34:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5839 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-09-07 09:34:37,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:34:37,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75] total 76 [2019-09-07 09:34:37,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-09-07 09:34:37,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-09-07 09:34:37,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-07 09:34:37,588 INFO L87 Difference]: Start difference. First operand 326 states and 384 transitions. Second operand 76 states. [2019-09-07 09:34:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:34:37,899 INFO L93 Difference]: Finished difference Result 504 states and 620 transitions. [2019-09-07 09:34:37,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-09-07 09:34:37,899 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 234 [2019-09-07 09:34:37,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:34:37,901 INFO L225 Difference]: With dead ends: 504 [2019-09-07 09:34:37,901 INFO L226 Difference]: Without dead ends: 329 [2019-09-07 09:34:37,901 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-09-07 09:34:37,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-09-07 09:34:37,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 328. [2019-09-07 09:34:37,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-09-07 09:34:37,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 386 transitions. [2019-09-07 09:34:37,907 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 386 transitions. Word has length 234 [2019-09-07 09:34:37,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:34:37,907 INFO L475 AbstractCegarLoop]: Abstraction has 328 states and 386 transitions. [2019-09-07 09:34:37,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-09-07 09:34:37,907 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 386 transitions. [2019-09-07 09:34:37,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-07 09:34:37,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:34:37,909 INFO L399 BasicCegarLoop]: trace histogram [73, 73, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:34:37,909 INFO L418 AbstractCegarLoop]: === Iteration 72 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:34:37,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:34:37,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1036385411, now seen corresponding path program 62 times [2019-09-07 09:34:37,909 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:34:37,909 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:34:37,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:34:37,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:34:37,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:34:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:34:39,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 2 proven. 5329 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2019-09-07 09:34:39,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:34:39,818 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:34:39,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:34:39,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:34:39,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:34:39,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 75 conjunts are in the unsatisfiable core [2019-09-07 09:34:39,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:34:39,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5984 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2019-09-07 09:34:39,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:34:39,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76] total 77 [2019-09-07 09:34:39,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-07 09:34:39,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-07 09:34:39,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 09:34:39,993 INFO L87 Difference]: Start difference. First operand 328 states and 386 transitions. Second operand 77 states. [2019-09-07 09:34:40,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:34:40,300 INFO L93 Difference]: Finished difference Result 506 states and 622 transitions. [2019-09-07 09:34:40,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-09-07 09:34:40,301 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 236 [2019-09-07 09:34:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:34:40,302 INFO L225 Difference]: With dead ends: 506 [2019-09-07 09:34:40,302 INFO L226 Difference]: Without dead ends: 331 [2019-09-07 09:34:40,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 09:34:40,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-09-07 09:34:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 330. [2019-09-07 09:34:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-09-07 09:34:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 388 transitions. [2019-09-07 09:34:40,311 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 388 transitions. Word has length 236 [2019-09-07 09:34:40,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:34:40,311 INFO L475 AbstractCegarLoop]: Abstraction has 330 states and 388 transitions. [2019-09-07 09:34:40,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-07 09:34:40,311 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 388 transitions. [2019-09-07 09:34:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-07 09:34:40,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:34:40,313 INFO L399 BasicCegarLoop]: trace histogram [74, 74, 21, 21, 21, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:34:40,313 INFO L418 AbstractCegarLoop]: === Iteration 73 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:34:40,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:34:40,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1251945055, now seen corresponding path program 63 times [2019-09-07 09:34:40,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:34:40,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:34:40,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:34:40,314 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:34:40,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:34:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:34:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6131 backedges. 2 proven. 5476 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2019-09-07 09:34:42,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:34:42,300 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:34:42,310 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:34:43,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-07 09:34:43,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:34:43,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 09:34:43,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:34:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 6131 backedges. 147 proven. 651 refuted. 0 times theorem prover too weak. 5333 trivial. 0 not checked. [2019-09-07 09:34:44,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:34:44,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 27] total 102 [2019-09-07 09:34:44,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-09-07 09:34:44,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-09-07 09:34:44,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3358, Invalid=6944, Unknown=0, NotChecked=0, Total=10302 [2019-09-07 09:34:44,274 INFO L87 Difference]: Start difference. First operand 330 states and 388 transitions. Second operand 102 states. [2019-09-07 09:34:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:34:49,060 INFO L93 Difference]: Finished difference Result 525 states and 651 transitions. [2019-09-07 09:34:49,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-09-07 09:34:49,061 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 238 [2019-09-07 09:34:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:34:49,063 INFO L225 Difference]: With dead ends: 525 [2019-09-07 09:34:49,063 INFO L226 Difference]: Without dead ends: 350 [2019-09-07 09:34:49,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6577 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10112, Invalid=30088, Unknown=0, NotChecked=0, Total=40200 [2019-09-07 09:34:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-09-07 09:34:49,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 340. [2019-09-07 09:34:49,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-09-07 09:34:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 400 transitions. [2019-09-07 09:34:49,087 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 400 transitions. Word has length 238 [2019-09-07 09:34:49,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:34:49,088 INFO L475 AbstractCegarLoop]: Abstraction has 340 states and 400 transitions. [2019-09-07 09:34:49,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-09-07 09:34:49,088 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 400 transitions. [2019-09-07 09:34:49,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-07 09:34:49,089 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:34:49,090 INFO L399 BasicCegarLoop]: trace histogram [76, 76, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:34:49,090 INFO L418 AbstractCegarLoop]: === Iteration 74 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:34:49,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:34:49,090 INFO L82 PathProgramCache]: Analyzing trace with hash 551413064, now seen corresponding path program 64 times [2019-09-07 09:34:49,090 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:34:49,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:34:49,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:34:49,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:34:49,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:34:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:34:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6495 backedges. 2 proven. 5776 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2019-09-07 09:34:51,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:34:51,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:34:51,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:34:51,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:34:51,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:34:51,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-07 09:34:51,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:34:51,469 INFO L134 CoverageAnalysis]: Checked inductivity of 6495 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2019-09-07 09:34:51,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:34:51,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79] total 80 [2019-09-07 09:34:51,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-09-07 09:34:51,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-09-07 09:34:51,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 09:34:51,475 INFO L87 Difference]: Start difference. First operand 340 states and 400 transitions. Second operand 80 states. [2019-09-07 09:34:51,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:34:51,790 INFO L93 Difference]: Finished difference Result 524 states and 644 transitions. [2019-09-07 09:34:51,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-09-07 09:34:51,791 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 245 [2019-09-07 09:34:51,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:34:51,792 INFO L225 Difference]: With dead ends: 524 [2019-09-07 09:34:51,792 INFO L226 Difference]: Without dead ends: 343 [2019-09-07 09:34:51,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-09-07 09:34:51,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-09-07 09:34:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 342. [2019-09-07 09:34:51,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-09-07 09:34:51,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 402 transitions. [2019-09-07 09:34:51,799 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 402 transitions. Word has length 245 [2019-09-07 09:34:51,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:34:51,799 INFO L475 AbstractCegarLoop]: Abstraction has 342 states and 402 transitions. [2019-09-07 09:34:51,799 INFO L476 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-09-07 09:34:51,799 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 402 transitions. [2019-09-07 09:34:51,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-07 09:34:51,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:34:51,801 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:34:51,801 INFO L418 AbstractCegarLoop]: === Iteration 75 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:34:51,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:34:51,801 INFO L82 PathProgramCache]: Analyzing trace with hash -910599002, now seen corresponding path program 65 times [2019-09-07 09:34:51,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:34:51,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:34:51,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:34:51,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:34:51,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:34:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:34:53,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6648 backedges. 2 proven. 5929 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2019-09-07 09:34:53,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:34:53,973 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:34:53,983 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:36:06,076 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2019-09-07 09:36:06,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:36:06,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 79 conjunts are in the unsatisfiable core [2019-09-07 09:36:06,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:36:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6648 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2019-09-07 09:36:06,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:36:06,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80] total 81 [2019-09-07 09:36:06,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-09-07 09:36:06,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-09-07 09:36:06,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-07 09:36:06,179 INFO L87 Difference]: Start difference. First operand 342 states and 402 transitions. Second operand 81 states. [2019-09-07 09:36:06,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:36:06,411 INFO L93 Difference]: Finished difference Result 526 states and 646 transitions. [2019-09-07 09:36:06,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-09-07 09:36:06,411 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 247 [2019-09-07 09:36:06,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:36:06,413 INFO L225 Difference]: With dead ends: 526 [2019-09-07 09:36:06,413 INFO L226 Difference]: Without dead ends: 345 [2019-09-07 09:36:06,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-09-07 09:36:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-09-07 09:36:06,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 344. [2019-09-07 09:36:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-07 09:36:06,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 404 transitions. [2019-09-07 09:36:06,419 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 404 transitions. Word has length 247 [2019-09-07 09:36:06,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:36:06,420 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 404 transitions. [2019-09-07 09:36:06,420 INFO L476 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-09-07 09:36:06,420 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 404 transitions. [2019-09-07 09:36:06,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-09-07 09:36:06,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:36:06,421 INFO L399 BasicCegarLoop]: trace histogram [78, 78, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:36:06,421 INFO L418 AbstractCegarLoop]: === Iteration 76 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:36:06,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:36:06,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1449888636, now seen corresponding path program 66 times [2019-09-07 09:36:06,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:36:06,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:36:06,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:36:06,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:36:06,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:36:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:36:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 6803 backedges. 2 proven. 6084 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2019-09-07 09:36:08,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:36:08,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:36:08,683 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:37:20,418 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 45 check-sat command(s) [2019-09-07 09:37:20,418 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:37:20,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 09:37:20,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:37:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 6803 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 6088 trivial. 0 not checked. [2019-09-07 09:37:21,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:37:21,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 26] total 105 [2019-09-07 09:37:21,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-09-07 09:37:21,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-09-07 09:37:21,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3541, Invalid=7379, Unknown=0, NotChecked=0, Total=10920 [2019-09-07 09:37:21,351 INFO L87 Difference]: Start difference. First operand 344 states and 404 transitions. Second operand 105 states. [2019-09-07 09:37:26,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:37:26,592 INFO L93 Difference]: Finished difference Result 544 states and 673 transitions. [2019-09-07 09:37:26,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-09-07 09:37:26,592 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 249 [2019-09-07 09:37:26,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:37:26,593 INFO L225 Difference]: With dead ends: 544 [2019-09-07 09:37:26,594 INFO L226 Difference]: Without dead ends: 363 [2019-09-07 09:37:26,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7023 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10617, Invalid=32025, Unknown=0, NotChecked=0, Total=42642 [2019-09-07 09:37:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-09-07 09:37:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 352. [2019-09-07 09:37:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-07 09:37:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 414 transitions. [2019-09-07 09:37:26,604 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 414 transitions. Word has length 249 [2019-09-07 09:37:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:37:26,604 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 414 transitions. [2019-09-07 09:37:26,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-09-07 09:37:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 414 transitions. [2019-09-07 09:37:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-07 09:37:26,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:37:26,606 INFO L399 BasicCegarLoop]: trace histogram [79, 79, 23, 23, 23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:37:26,606 INFO L418 AbstractCegarLoop]: === Iteration 77 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:37:26,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:37:26,606 INFO L82 PathProgramCache]: Analyzing trace with hash 2027209385, now seen corresponding path program 67 times [2019-09-07 09:37:26,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:37:26,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:37:26,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:37:26,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:37:26,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:37:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:37:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 7027 backedges. 2 proven. 6241 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-07 09:37:28,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:37:28,964 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:37:28,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:37:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:37:29,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 81 conjunts are in the unsatisfiable core [2019-09-07 09:37:29,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:37:29,166 INFO L134 CoverageAnalysis]: Checked inductivity of 7027 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [2019-09-07 09:37:29,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:37:29,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82] total 83 [2019-09-07 09:37:29,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-09-07 09:37:29,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-09-07 09:37:29,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-07 09:37:29,172 INFO L87 Difference]: Start difference. First operand 352 states and 414 transitions. Second operand 83 states. [2019-09-07 09:37:29,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:37:29,473 INFO L93 Difference]: Finished difference Result 542 states and 666 transitions. [2019-09-07 09:37:29,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-09-07 09:37:29,473 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 254 [2019-09-07 09:37:29,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:37:29,475 INFO L225 Difference]: With dead ends: 542 [2019-09-07 09:37:29,475 INFO L226 Difference]: Without dead ends: 355 [2019-09-07 09:37:29,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-09-07 09:37:29,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-09-07 09:37:29,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 354. [2019-09-07 09:37:29,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-09-07 09:37:29,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 416 transitions. [2019-09-07 09:37:29,482 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 416 transitions. Word has length 254 [2019-09-07 09:37:29,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:37:29,482 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 416 transitions. [2019-09-07 09:37:29,482 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-09-07 09:37:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 416 transitions. [2019-09-07 09:37:29,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-07 09:37:29,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:37:29,483 INFO L399 BasicCegarLoop]: trace histogram [80, 80, 23, 23, 23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:37:29,483 INFO L418 AbstractCegarLoop]: === Iteration 78 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:37:29,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:37:29,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1827058955, now seen corresponding path program 68 times [2019-09-07 09:37:29,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:37:29,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:37:29,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:37:29,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:37:29,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:37:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:37:31,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7186 backedges. 2 proven. 6400 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-07 09:37:31,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:37:31,781 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:37:31,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:37:31,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:37:31,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:37:31,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 82 conjunts are in the unsatisfiable core [2019-09-07 09:37:31,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:37:31,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7186 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 786 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (73)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:37:31,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:37:31,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83] total 84 [2019-09-07 09:37:31,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-09-07 09:37:31,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-09-07 09:37:31,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-07 09:37:31,983 INFO L87 Difference]: Start difference. First operand 354 states and 416 transitions. Second operand 84 states. [2019-09-07 09:37:32,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:37:32,324 INFO L93 Difference]: Finished difference Result 544 states and 668 transitions. [2019-09-07 09:37:32,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-09-07 09:37:32,324 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 256 [2019-09-07 09:37:32,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:37:32,325 INFO L225 Difference]: With dead ends: 544 [2019-09-07 09:37:32,326 INFO L226 Difference]: Without dead ends: 357 [2019-09-07 09:37:32,326 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-09-07 09:37:32,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-09-07 09:37:32,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 356. [2019-09-07 09:37:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-09-07 09:37:32,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 418 transitions. [2019-09-07 09:37:32,335 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 418 transitions. Word has length 256 [2019-09-07 09:37:32,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:37:32,335 INFO L475 AbstractCegarLoop]: Abstraction has 356 states and 418 transitions. [2019-09-07 09:37:32,335 INFO L476 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-09-07 09:37:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 418 transitions. [2019-09-07 09:37:32,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-07 09:37:32,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:37:32,337 INFO L399 BasicCegarLoop]: trace histogram [81, 81, 23, 23, 23, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:37:32,337 INFO L418 AbstractCegarLoop]: === Iteration 79 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:37:32,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:37:32,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1538943251, now seen corresponding path program 69 times [2019-09-07 09:37:32,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:37:32,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:37:32,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:37:32,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:37:32,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:37:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:37:34,672 INFO L134 CoverageAnalysis]: Checked inductivity of 7347 backedges. 2 proven. 6561 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-07 09:37:34,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:37:34,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:37:34,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:37:36,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-09-07 09:37:36,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:37:36,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 09:37:36,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:37:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7347 backedges. 161 proven. 782 refuted. 0 times theorem prover too weak. 6404 trivial. 0 not checked. [2019-09-07 09:37:37,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:37:37,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 29] total 111 [2019-09-07 09:37:37,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-09-07 09:37:37,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-09-07 09:37:37,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3981, Invalid=8229, Unknown=0, NotChecked=0, Total=12210 [2019-09-07 09:37:37,655 INFO L87 Difference]: Start difference. First operand 356 states and 418 transitions. Second operand 111 states. [2019-09-07 09:37:43,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:37:43,251 INFO L93 Difference]: Finished difference Result 563 states and 697 transitions. [2019-09-07 09:37:43,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-09-07 09:37:43,251 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 258 [2019-09-07 09:37:43,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:37:43,253 INFO L225 Difference]: With dead ends: 563 [2019-09-07 09:37:43,253 INFO L226 Difference]: Without dead ends: 376 [2019-09-07 09:37:43,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7829 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11985, Invalid=35757, Unknown=0, NotChecked=0, Total=47742 [2019-09-07 09:37:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2019-09-07 09:37:43,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 366. [2019-09-07 09:37:43,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-07 09:37:43,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 430 transitions. [2019-09-07 09:37:43,263 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 430 transitions. Word has length 258 [2019-09-07 09:37:43,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:37:43,263 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 430 transitions. [2019-09-07 09:37:43,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-09-07 09:37:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 430 transitions. [2019-09-07 09:37:43,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-09-07 09:37:43,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:37:43,265 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 24, 24, 24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:37:43,265 INFO L418 AbstractCegarLoop]: === Iteration 80 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:37:43,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:37:43,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1617006586, now seen corresponding path program 70 times [2019-09-07 09:37:43,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:37:43,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:37:43,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:37:43,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:37:43,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:37:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:37:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 7745 backedges. 2 proven. 6889 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2019-09-07 09:37:45,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:37:45,813 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:37:45,823 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:37:45,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:37:45,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:37:45,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-07 09:37:45,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:37:46,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7745 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 856 trivial. 0 not checked. [2019-09-07 09:37:46,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:37:46,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86] total 87 [2019-09-07 09:37:46,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-09-07 09:37:46,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-09-07 09:37:46,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-07 09:37:46,006 INFO L87 Difference]: Start difference. First operand 366 states and 430 transitions. Second operand 87 states. [2019-09-07 09:37:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:37:46,296 INFO L93 Difference]: Finished difference Result 562 states and 690 transitions. [2019-09-07 09:37:46,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-09-07 09:37:46,296 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 265 [2019-09-07 09:37:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:37:46,298 INFO L225 Difference]: With dead ends: 562 [2019-09-07 09:37:46,298 INFO L226 Difference]: Without dead ends: 369 [2019-09-07 09:37:46,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-09-07 09:37:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-07 09:37:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 368. [2019-09-07 09:37:46,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2019-09-07 09:37:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 432 transitions. [2019-09-07 09:37:46,305 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 432 transitions. Word has length 265 [2019-09-07 09:37:46,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:37:46,305 INFO L475 AbstractCegarLoop]: Abstraction has 368 states and 432 transitions. [2019-09-07 09:37:46,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-09-07 09:37:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 432 transitions. [2019-09-07 09:37:46,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-07 09:37:46,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:37:46,307 INFO L399 BasicCegarLoop]: trace histogram [84, 84, 24, 24, 24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:37:46,307 INFO L418 AbstractCegarLoop]: === Iteration 81 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:37:46,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:37:46,307 INFO L82 PathProgramCache]: Analyzing trace with hash -939152296, now seen corresponding path program 71 times [2019-09-07 09:37:46,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:37:46,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:37:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:37:46,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:37:46,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:37:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:37:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7912 backedges. 2 proven. 7056 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2019-09-07 09:37:48,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:37:48,799 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:37:48,810 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:40:38,238 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 85 check-sat command(s) [2019-09-07 09:40:38,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:40:38,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 86 conjunts are in the unsatisfiable core [2019-09-07 09:40:38,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:40:38,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7912 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 856 trivial. 0 not checked. [2019-09-07 09:40:38,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:40:38,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87] total 88 [2019-09-07 09:40:38,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-07 09:40:38,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-07 09:40:38,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-07 09:40:38,366 INFO L87 Difference]: Start difference. First operand 368 states and 432 transitions. Second operand 88 states. [2019-09-07 09:40:38,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:40:38,638 INFO L93 Difference]: Finished difference Result 564 states and 692 transitions. [2019-09-07 09:40:38,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-09-07 09:40:38,638 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 267 [2019-09-07 09:40:38,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:40:38,640 INFO L225 Difference]: With dead ends: 564 [2019-09-07 09:40:38,640 INFO L226 Difference]: Without dead ends: 371 [2019-09-07 09:40:38,641 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-09-07 09:40:38,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-07 09:40:38,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 370. [2019-09-07 09:40:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2019-09-07 09:40:38,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 434 transitions. [2019-09-07 09:40:38,647 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 434 transitions. Word has length 267 [2019-09-07 09:40:38,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:40:38,647 INFO L475 AbstractCegarLoop]: Abstraction has 370 states and 434 transitions. [2019-09-07 09:40:38,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-09-07 09:40:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 434 transitions. [2019-09-07 09:40:38,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-07 09:40:38,648 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:40:38,648 INFO L399 BasicCegarLoop]: trace histogram [85, 85, 24, 24, 24, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:40:38,648 INFO L418 AbstractCegarLoop]: === Iteration 82 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:40:38,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:40:38,649 INFO L82 PathProgramCache]: Analyzing trace with hash -686544586, now seen corresponding path program 72 times [2019-09-07 09:40:38,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:40:38,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:40:38,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:40:38,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:40:38,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:40:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:40:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8081 backedges. 2 proven. 7225 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2019-09-07 09:40:41,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:40:41,232 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:40:41,242 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE