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/standard_copy8_ground-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 22:44:33,781 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 22:44:33,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 22:44:33,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 22:44:33,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 22:44:33,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 22:44:33,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 22:44:33,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 22:44:33,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 22:44:33,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 22:44:33,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 22:44:33,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 22:44:33,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 22:44:33,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 22:44:33,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 22:44:33,806 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 22:44:33,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 22:44:33,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 22:44:33,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 22:44:33,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 22:44:33,813 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 22:44:33,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 22:44:33,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 22:44:33,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 22:44:33,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 22:44:33,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 22:44:33,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 22:44:33,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 22:44:33,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 22:44:33,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 22:44:33,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 22:44:33,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 22:44:33,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 22:44:33,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 22:44:33,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 22:44:33,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 22:44:33,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 22:44:33,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 22:44:33,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 22:44:33,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 22:44:33,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 22:44:33,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 22:44:33,860 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 22:44:33,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 22:44:33,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 22:44:33,862 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 22:44:33,862 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 22:44:33,862 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 22:44:33,862 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 22:44:33,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 22:44:33,863 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 22:44:33,863 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 22:44:33,863 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 22:44:33,863 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 22:44:33,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 22:44:33,864 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 22:44:33,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 22:44:33,864 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 22:44:33,864 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 22:44:33,864 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 22:44:33,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 22:44:33,865 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 22:44:33,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 22:44:33,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:44:33,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 22:44:33,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 22:44:33,867 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 22:44:33,867 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 22:44:33,867 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 22:44:33,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 22:44:33,868 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 22:44:33,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 22:44:33,927 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 22:44:33,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 22:44:33,931 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 22:44:33,932 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 22:44:33,932 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy8_ground-1.i [2019-10-01 22:44:33,990 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda39adf2/2eb946971f6d4a4aab36369d6e83ecab/FLAG154efa1ea [2019-10-01 22:44:34,416 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 22:44:34,416 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy8_ground-1.i [2019-10-01 22:44:34,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda39adf2/2eb946971f6d4a4aab36369d6e83ecab/FLAG154efa1ea [2019-10-01 22:44:34,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eda39adf2/2eb946971f6d4a4aab36369d6e83ecab [2019-10-01 22:44:34,817 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 22:44:34,821 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 22:44:34,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 22:44:34,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 22:44:34,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 22:44:34,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:44:34" (1/1) ... [2019-10-01 22:44:34,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b0106d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:44:34, skipping insertion in model container [2019-10-01 22:44:34,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 10:44:34" (1/1) ... [2019-10-01 22:44:34,836 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 22:44:34,852 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 22:44:35,059 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:44:35,065 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 22:44:35,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 22:44:35,194 INFO L192 MainTranslator]: Completed translation [2019-10-01 22:44:35,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:44:35 WrapperNode [2019-10-01 22:44:35,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 22:44:35,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 22:44:35,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 22:44:35,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 22:44:35,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:44:35" (1/1) ... [2019-10-01 22:44:35,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:44:35" (1/1) ... [2019-10-01 22:44:35,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:44:35" (1/1) ... [2019-10-01 22:44:35,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:44:35" (1/1) ... [2019-10-01 22:44:35,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:44:35" (1/1) ... [2019-10-01 22:44:35,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:44:35" (1/1) ... [2019-10-01 22:44:35,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:44:35" (1/1) ... [2019-10-01 22:44:35,242 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 22:44:35,243 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 22:44:35,243 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 22:44:35,243 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 22:44:35,244 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:44:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 22:44:35,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 22:44:35,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 22:44:35,296 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 22:44:35,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 22:44:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 22:44:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 22:44:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 22:44:35,297 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 22:44:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 22:44:35,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 22:44:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 22:44:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 22:44:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 22:44:35,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 22:44:35,748 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 22:44:35,748 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-01 22:44:35,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:44:35 BoogieIcfgContainer [2019-10-01 22:44:35,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 22:44:35,751 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 22:44:35,751 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 22:44:35,753 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 22:44:35,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 10:44:34" (1/3) ... [2019-10-01 22:44:35,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fd0396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:44:35, skipping insertion in model container [2019-10-01 22:44:35,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 10:44:35" (2/3) ... [2019-10-01 22:44:35,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22fd0396 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 10:44:35, skipping insertion in model container [2019-10-01 22:44:35,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 10:44:35" (3/3) ... [2019-10-01 22:44:35,756 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_copy8_ground-1.i [2019-10-01 22:44:35,765 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 22:44:35,775 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 22:44:35,789 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 22:44:35,813 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 22:44:35,814 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 22:44:35,814 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 22:44:35,814 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 22:44:35,814 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 22:44:35,814 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 22:44:35,814 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 22:44:35,814 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 22:44:35,815 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 22:44:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2019-10-01 22:44:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-01 22:44:35,835 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:35,836 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:35,838 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:35,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:35,844 INFO L82 PathProgramCache]: Analyzing trace with hash 661673386, now seen corresponding path program 1 times [2019-10-01 22:44:35,846 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:35,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:35,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:35,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:44:35,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:44:36,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:44:36,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 22:44:36,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 22:44:36,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 22:44:36,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:44:36,043 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 2 states. [2019-10-01 22:44:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:36,077 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2019-10-01 22:44:36,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 22:44:36,078 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2019-10-01 22:44:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:36,089 INFO L225 Difference]: With dead ends: 88 [2019-10-01 22:44:36,089 INFO L226 Difference]: Without dead ends: 43 [2019-10-01 22:44:36,095 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 22:44:36,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-01 22:44:36,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-01 22:44:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-01 22:44:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2019-10-01 22:44:36,149 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 29 [2019-10-01 22:44:36,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:36,150 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-10-01 22:44:36,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 22:44:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2019-10-01 22:44:36,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-01 22:44:36,154 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:36,154 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:36,155 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:36,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:36,156 INFO L82 PathProgramCache]: Analyzing trace with hash 904564754, now seen corresponding path program 1 times [2019-10-01 22:44:36,157 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:36,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:36,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:36,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:44:36,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 22:44:36,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:44:36,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:44:36,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:44:36,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:44:36,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:44:36,267 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand 3 states. [2019-10-01 22:44:36,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:36,304 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2019-10-01 22:44:36,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:44:36,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-10-01 22:44:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:36,308 INFO L225 Difference]: With dead ends: 80 [2019-10-01 22:44:36,308 INFO L226 Difference]: Without dead ends: 45 [2019-10-01 22:44:36,310 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:44:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-01 22:44:36,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-10-01 22:44:36,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-01 22:44:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2019-10-01 22:44:36,329 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 29 [2019-10-01 22:44:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:36,329 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2019-10-01 22:44:36,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:44:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2019-10-01 22:44:36,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-01 22:44:36,332 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:36,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:36,333 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:36,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:36,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1833019696, now seen corresponding path program 1 times [2019-10-01 22:44:36,334 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:36,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:36,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:36,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:44:36,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:36,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 22:44:36,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 22:44:36,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 22:44:36,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 22:44:36,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 22:44:36,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:44:36,449 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 3 states. [2019-10-01 22:44:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:36,557 INFO L93 Difference]: Finished difference Result 92 states and 116 transitions. [2019-10-01 22:44:36,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 22:44:36,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-01 22:44:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:36,559 INFO L225 Difference]: With dead ends: 92 [2019-10-01 22:44:36,559 INFO L226 Difference]: Without dead ends: 60 [2019-10-01 22:44:36,560 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 22:44:36,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-01 22:44:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 52. [2019-10-01 22:44:36,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-01 22:44:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2019-10-01 22:44:36,568 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 31 [2019-10-01 22:44:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:36,569 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2019-10-01 22:44:36,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 22:44:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2019-10-01 22:44:36,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 22:44:36,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:36,572 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:36,572 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:36,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:36,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1518385952, now seen corresponding path program 1 times [2019-10-01 22:44:36,573 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:36,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:36,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:36,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:44:36,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 22:44:36,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:36,715 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:44:36,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:44:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:36,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:44:36,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 22:44:36,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:36,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 22:44:36,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 22:44:36,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 22:44:36,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:44:36,883 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 5 states. [2019-10-01 22:44:36,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:36,916 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2019-10-01 22:44:36,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 22:44:36,917 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-01 22:44:36,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:36,918 INFO L225 Difference]: With dead ends: 98 [2019-10-01 22:44:36,918 INFO L226 Difference]: Without dead ends: 55 [2019-10-01 22:44:36,919 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 22:44:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-01 22:44:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-10-01 22:44:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-01 22:44:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2019-10-01 22:44:36,929 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 47 [2019-10-01 22:44:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:36,933 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2019-10-01 22:44:36,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 22:44:36,934 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2019-10-01 22:44:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-01 22:44:36,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:36,935 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:36,936 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:36,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:36,936 INFO L82 PathProgramCache]: Analyzing trace with hash -946140994, now seen corresponding path program 2 times [2019-10-01 22:44:36,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:36,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:36,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:36,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:44:36,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:37,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-01 22:44:37,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:37,048 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:44:37,075 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-10-01 22:44:37,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:44:37,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:37,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 22:44:37,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-01 22:44:37,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:37,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-10-01 22:44:37,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-01 22:44:37,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-01 22:44:37,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:44:37,164 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 7 states. [2019-10-01 22:44:37,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:37,336 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2019-10-01 22:44:37,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 22:44:37,337 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-10-01 22:44:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:37,338 INFO L225 Difference]: With dead ends: 124 [2019-10-01 22:44:37,339 INFO L226 Difference]: Without dead ends: 81 [2019-10-01 22:44:37,340 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-01 22:44:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-10-01 22:44:37,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2019-10-01 22:44:37,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-01 22:44:37,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-10-01 22:44:37,357 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 49 [2019-10-01 22:44:37,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:37,358 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-10-01 22:44:37,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-01 22:44:37,359 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-10-01 22:44:37,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 22:44:37,361 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:37,361 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:37,361 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:37,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:37,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1302503220, now seen corresponding path program 3 times [2019-10-01 22:44:37,362 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:37,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:37,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:37,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:37,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:37,467 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-01 22:44:37,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:37,467 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:44:37,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:44:37,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 22:44:37,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:37,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 22:44:37,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:37,600 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-01 22:44:37,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:37,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2019-10-01 22:44:37,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 22:44:37,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 22:44:37,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:44:37,609 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 9 states. [2019-10-01 22:44:37,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:37,853 INFO L93 Difference]: Finished difference Result 158 states and 184 transitions. [2019-10-01 22:44:37,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-01 22:44:37,854 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-10-01 22:44:37,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:37,855 INFO L225 Difference]: With dead ends: 158 [2019-10-01 22:44:37,855 INFO L226 Difference]: Without dead ends: 99 [2019-10-01 22:44:37,856 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-01 22:44:37,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-01 22:44:37,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2019-10-01 22:44:37,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-10-01 22:44:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2019-10-01 22:44:37,876 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 67 [2019-10-01 22:44:37,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:37,876 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2019-10-01 22:44:37,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 22:44:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2019-10-01 22:44:37,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-01 22:44:37,882 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:37,882 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:37,883 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:37,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:37,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2145096026, now seen corresponding path program 4 times [2019-10-01 22:44:37,884 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:37,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:37,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:37,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-01 22:44:38,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:38,073 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:44:38,098 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:44:38,161 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:44:38,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:38,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-01 22:44:38,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:38,238 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-10-01 22:44:38,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:38,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-01 22:44:38,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:44:38,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:44:38,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:44:38,246 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 11 states. [2019-10-01 22:44:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:38,454 INFO L93 Difference]: Finished difference Result 192 states and 218 transitions. [2019-10-01 22:44:38,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:44:38,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2019-10-01 22:44:38,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:38,456 INFO L225 Difference]: With dead ends: 192 [2019-10-01 22:44:38,456 INFO L226 Difference]: Without dead ends: 117 [2019-10-01 22:44:38,457 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:44:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-01 22:44:38,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 108. [2019-10-01 22:44:38,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-01 22:44:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2019-10-01 22:44:38,471 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 85 [2019-10-01 22:44:38,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:38,471 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2019-10-01 22:44:38,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:44:38,471 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2019-10-01 22:44:38,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-01 22:44:38,476 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:38,476 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:38,477 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:38,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:38,477 INFO L82 PathProgramCache]: Analyzing trace with hash -613385624, now seen corresponding path program 5 times [2019-10-01 22:44:38,477 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:38,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:38,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:38,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:38,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-10-01 22:44:38,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:38,622 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:44:38,653 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:44:54,421 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2019-10-01 22:44:54,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:54,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 22:44:54,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:54,521 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-01 22:44:54,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:54,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-10-01 22:44:54,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 22:44:54,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 22:44:54,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:44:54,534 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 13 states. [2019-10-01 22:44:54,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:54,797 INFO L93 Difference]: Finished difference Result 226 states and 252 transitions. [2019-10-01 22:44:54,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 22:44:54,797 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2019-10-01 22:44:54,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:54,799 INFO L225 Difference]: With dead ends: 226 [2019-10-01 22:44:54,799 INFO L226 Difference]: Without dead ends: 135 [2019-10-01 22:44:54,800 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-10-01 22:44:54,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-01 22:44:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 126. [2019-10-01 22:44:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-01 22:44:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2019-10-01 22:44:54,817 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 103 [2019-10-01 22:44:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:54,817 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2019-10-01 22:44:54,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 22:44:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2019-10-01 22:44:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-01 22:44:54,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:54,820 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1] [2019-10-01 22:44:54,820 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:54,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:54,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1753285642, now seen corresponding path program 6 times [2019-10-01 22:44:54,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:54,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:54,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:54,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:54,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-10-01 22:44:54,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:54,974 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:44:54,994 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:44:57,024 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-01 22:44:57,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:57,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:44:57,033 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 9 proven. 25 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2019-10-01 22:44:57,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:57,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2019-10-01 22:44:57,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:44:57,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:44:57,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:44:57,149 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 17 states. [2019-10-01 22:44:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:57,560 INFO L93 Difference]: Finished difference Result 268 states and 302 transitions. [2019-10-01 22:44:57,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:44:57,561 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 121 [2019-10-01 22:44:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:57,562 INFO L225 Difference]: With dead ends: 268 [2019-10-01 22:44:57,563 INFO L226 Difference]: Without dead ends: 161 [2019-10-01 22:44:57,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:44:57,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-10-01 22:44:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-10-01 22:44:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-10-01 22:44:57,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2019-10-01 22:44:57,577 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 121 [2019-10-01 22:44:57,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:57,577 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2019-10-01 22:44:57,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:44:57,577 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2019-10-01 22:44:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-01 22:44:57,579 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:57,579 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:57,580 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:57,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:57,580 INFO L82 PathProgramCache]: Analyzing trace with hash 545087476, now seen corresponding path program 7 times [2019-10-01 22:44:57,580 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:57,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:57,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:57,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:57,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:44:57,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:57,718 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:44:57,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:44:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:57,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 22:44:57,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 22:44:57,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:57,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 22:44:57,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 22:44:57,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 22:44:57,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:44:57,868 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand 11 states. [2019-10-01 22:44:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:57,915 INFO L93 Difference]: Finished difference Result 302 states and 320 transitions. [2019-10-01 22:44:57,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 22:44:57,916 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 155 [2019-10-01 22:44:57,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:57,917 INFO L225 Difference]: With dead ends: 302 [2019-10-01 22:44:57,917 INFO L226 Difference]: Without dead ends: 163 [2019-10-01 22:44:57,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 22:44:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-01 22:44:57,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2019-10-01 22:44:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-10-01 22:44:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 171 transitions. [2019-10-01 22:44:57,929 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 171 transitions. Word has length 155 [2019-10-01 22:44:57,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:57,930 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 171 transitions. [2019-10-01 22:44:57,930 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 22:44:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 171 transitions. [2019-10-01 22:44:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-01 22:44:57,932 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:57,932 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:57,933 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:57,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:57,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1849931630, now seen corresponding path program 8 times [2019-10-01 22:44:57,933 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:57,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:57,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:57,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:44:57,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:44:58,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:58,104 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 22:44:58,139 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:44:58,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:44:58,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:44:58,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:44:58,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:44:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:44:58,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:44:58,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 22:44:58,277 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 22:44:58,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 22:44:58,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:44:58,277 INFO L87 Difference]: Start difference. First operand 162 states and 171 transitions. Second operand 12 states. [2019-10-01 22:44:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:44:58,319 INFO L93 Difference]: Finished difference Result 304 states and 322 transitions. [2019-10-01 22:44:58,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 22:44:58,320 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2019-10-01 22:44:58,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:44:58,324 INFO L225 Difference]: With dead ends: 304 [2019-10-01 22:44:58,324 INFO L226 Difference]: Without dead ends: 165 [2019-10-01 22:44:58,325 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 22:44:58,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-10-01 22:44:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2019-10-01 22:44:58,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-10-01 22:44:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 173 transitions. [2019-10-01 22:44:58,337 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 173 transitions. Word has length 157 [2019-10-01 22:44:58,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:44:58,337 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 173 transitions. [2019-10-01 22:44:58,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 22:44:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 173 transitions. [2019-10-01 22:44:58,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-01 22:44:58,339 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:44:58,340 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:44:58,340 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:44:58,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:44:58,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1360821840, now seen corresponding path program 9 times [2019-10-01 22:44:58,340 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:44:58,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:44:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:58,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:44:58,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:44:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:44:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2019-10-01 22:44:58,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:44:58,516 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:44:58,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:45:15,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-10-01 22:45:15,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:45:15,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:45:15,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:45:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2019-10-01 22:45:15,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:45:15,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2019-10-01 22:45:15,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 22:45:15,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 22:45:15,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:45:15,938 INFO L87 Difference]: Start difference. First operand 164 states and 173 transitions. Second operand 20 states. [2019-10-01 22:45:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:45:16,304 INFO L93 Difference]: Finished difference Result 330 states and 356 transitions. [2019-10-01 22:45:16,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:45:16,305 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 159 [2019-10-01 22:45:16,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:45:16,310 INFO L225 Difference]: With dead ends: 330 [2019-10-01 22:45:16,310 INFO L226 Difference]: Without dead ends: 191 [2019-10-01 22:45:16,311 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2019-10-01 22:45:16,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-10-01 22:45:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 182. [2019-10-01 22:45:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-01 22:45:16,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 191 transitions. [2019-10-01 22:45:16,320 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 191 transitions. Word has length 159 [2019-10-01 22:45:16,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:45:16,321 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 191 transitions. [2019-10-01 22:45:16,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 22:45:16,321 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 191 transitions. [2019-10-01 22:45:16,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-01 22:45:16,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:45:16,323 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:45:16,323 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:45:16,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:45:16,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1090208062, now seen corresponding path program 10 times [2019-10-01 22:45:16,324 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:45:16,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:45:16,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:16,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:45:16,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:45:16,509 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2019-10-01 22:45:16,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:45:16,510 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:45:16,549 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:45:16,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:45:16,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:45:16,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 22:45:16,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:45:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2019-10-01 22:45:16,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:45:16,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2019-10-01 22:45:16,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-01 22:45:16,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-01 22:45:16,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:45:16,923 INFO L87 Difference]: Start difference. First operand 182 states and 191 transitions. Second operand 22 states. [2019-10-01 22:45:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:45:17,362 INFO L93 Difference]: Finished difference Result 364 states and 390 transitions. [2019-10-01 22:45:17,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 22:45:17,362 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 177 [2019-10-01 22:45:17,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:45:17,364 INFO L225 Difference]: With dead ends: 364 [2019-10-01 22:45:17,364 INFO L226 Difference]: Without dead ends: 209 [2019-10-01 22:45:17,365 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2019-10-01 22:45:17,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-01 22:45:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 200. [2019-10-01 22:45:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-10-01 22:45:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 209 transitions. [2019-10-01 22:45:17,374 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 209 transitions. Word has length 177 [2019-10-01 22:45:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:45:17,374 INFO L475 AbstractCegarLoop]: Abstraction has 200 states and 209 transitions. [2019-10-01 22:45:17,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-01 22:45:17,375 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 209 transitions. [2019-10-01 22:45:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-01 22:45:17,377 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:45:17,377 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:45:17,377 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:45:17,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:45:17,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1548486324, now seen corresponding path program 11 times [2019-10-01 22:45:17,378 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:45:17,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:45:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:17,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:45:17,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:45:17,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:45:17,578 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2019-10-01 22:45:17,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:45:17,578 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:45:17,610 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:46:38,110 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2019-10-01 22:46:38,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:46:38,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-01 22:46:38,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:46:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 769 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2019-10-01 22:46:38,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:46:38,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-10-01 22:46:38,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:46:38,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:46:38,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:46:38,379 INFO L87 Difference]: Start difference. First operand 200 states and 209 transitions. Second operand 24 states. [2019-10-01 22:46:38,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:46:38,919 INFO L93 Difference]: Finished difference Result 398 states and 424 transitions. [2019-10-01 22:46:38,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:46:38,920 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 195 [2019-10-01 22:46:38,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:46:38,922 INFO L225 Difference]: With dead ends: 398 [2019-10-01 22:46:38,922 INFO L226 Difference]: Without dead ends: 227 [2019-10-01 22:46:38,923 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:46:38,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-10-01 22:46:38,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2019-10-01 22:46:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-10-01 22:46:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 227 transitions. [2019-10-01 22:46:38,932 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 227 transitions. Word has length 195 [2019-10-01 22:46:38,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:46:38,932 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 227 transitions. [2019-10-01 22:46:38,932 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:46:38,932 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 227 transitions. [2019-10-01 22:46:38,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-01 22:46:38,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:46:38,935 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:46:38,935 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:46:38,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:46:38,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1218410022, now seen corresponding path program 12 times [2019-10-01 22:46:38,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:46:38,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:46:38,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:46:38,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:46:38,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:46:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:46:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2019-10-01 22:46:39,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:46:39,133 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:46:39,157 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:47:41,763 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2019-10-01 22:47:41,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:47:41,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 45 conjunts are in the unsatisfiable core [2019-10-01 22:47:41,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:47:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2019-10-01 22:47:41,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:47:41,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 26 [2019-10-01 22:47:41,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 22:47:41,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 22:47:41,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:47:41,988 INFO L87 Difference]: Start difference. First operand 218 states and 227 transitions. Second operand 26 states. [2019-10-01 22:47:42,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:47:42,464 INFO L93 Difference]: Finished difference Result 432 states and 458 transitions. [2019-10-01 22:47:42,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 22:47:42,464 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 213 [2019-10-01 22:47:42,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:47:42,466 INFO L225 Difference]: With dead ends: 432 [2019-10-01 22:47:42,466 INFO L226 Difference]: Without dead ends: 245 [2019-10-01 22:47:42,468 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=468, Unknown=0, NotChecked=0, Total=650 [2019-10-01 22:47:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-01 22:47:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 236. [2019-10-01 22:47:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-01 22:47:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 245 transitions. [2019-10-01 22:47:42,478 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 245 transitions. Word has length 213 [2019-10-01 22:47:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:47:42,479 INFO L475 AbstractCegarLoop]: Abstraction has 236 states and 245 transitions. [2019-10-01 22:47:42,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 22:47:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 245 transitions. [2019-10-01 22:47:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-10-01 22:47:42,481 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:47:42,482 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:47:42,482 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:47:42,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:47:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash 895210216, now seen corresponding path program 13 times [2019-10-01 22:47:42,482 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:47:42,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:47:42,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:47:42,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:47:42,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:47:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:47:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 22:47:42,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:47:42,750 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:47:42,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:47:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:47:42,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 22:47:42,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:47:42,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1137 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 22:47:42,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:47:42,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 22:47:42,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 22:47:42,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 22:47:42,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:47:42,970 INFO L87 Difference]: Start difference. First operand 236 states and 245 transitions. Second operand 17 states. [2019-10-01 22:47:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:47:43,021 INFO L93 Difference]: Finished difference Result 442 states and 460 transitions. [2019-10-01 22:47:43,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 22:47:43,022 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 231 [2019-10-01 22:47:43,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:47:43,023 INFO L225 Difference]: With dead ends: 442 [2019-10-01 22:47:43,024 INFO L226 Difference]: Without dead ends: 239 [2019-10-01 22:47:43,025 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 22:47:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-10-01 22:47:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2019-10-01 22:47:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-10-01 22:47:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 247 transitions. [2019-10-01 22:47:43,033 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 247 transitions. Word has length 231 [2019-10-01 22:47:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:47:43,034 INFO L475 AbstractCegarLoop]: Abstraction has 238 states and 247 transitions. [2019-10-01 22:47:43,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 22:47:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 247 transitions. [2019-10-01 22:47:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-01 22:47:43,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:47:43,037 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:47:43,037 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:47:43,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:47:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1806749318, now seen corresponding path program 14 times [2019-10-01 22:47:43,037 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:47:43,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:47:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:47:43,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:47:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:47:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:47:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 22:47:43,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:47:43,349 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:47:43,406 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:47:43,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:47:43,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:47:43,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 22:47:43,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:47:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1164 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 22:47:43,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:47:43,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 22:47:43,663 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 22:47:43,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 22:47:43,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:47:43,664 INFO L87 Difference]: Start difference. First operand 238 states and 247 transitions. Second operand 18 states. [2019-10-01 22:47:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:47:43,725 INFO L93 Difference]: Finished difference Result 444 states and 462 transitions. [2019-10-01 22:47:43,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 22:47:43,727 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 233 [2019-10-01 22:47:43,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:47:43,728 INFO L225 Difference]: With dead ends: 444 [2019-10-01 22:47:43,728 INFO L226 Difference]: Without dead ends: 241 [2019-10-01 22:47:43,729 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 22:47:43,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-10-01 22:47:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2019-10-01 22:47:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-01 22:47:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 249 transitions. [2019-10-01 22:47:43,736 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 249 transitions. Word has length 233 [2019-10-01 22:47:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:47:43,738 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 249 transitions. [2019-10-01 22:47:43,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 22:47:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 249 transitions. [2019-10-01 22:47:43,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-01 22:47:43,741 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:47:43,741 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:47:43,741 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:47:43,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:47:43,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1622497956, now seen corresponding path program 15 times [2019-10-01 22:47:43,742 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:47:43,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:47:43,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:47:43,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:47:43,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:47:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:47:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2019-10-01 22:47:44,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:47:44,061 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:47:44,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:48:45,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 22:48:45,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:48:45,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 22:48:45,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:48:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 29 proven. 121 refuted. 0 times theorem prover too weak. 1043 trivial. 0 not checked. [2019-10-01 22:48:45,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:48:45,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16] total 32 [2019-10-01 22:48:45,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 22:48:45,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 22:48:45,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=712, Unknown=0, NotChecked=0, Total=992 [2019-10-01 22:48:45,543 INFO L87 Difference]: Start difference. First operand 240 states and 249 transitions. Second operand 32 states. [2019-10-01 22:48:46,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:48:46,303 INFO L93 Difference]: Finished difference Result 471 states and 498 transitions. [2019-10-01 22:48:46,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 22:48:46,304 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 235 [2019-10-01 22:48:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:48:46,307 INFO L225 Difference]: With dead ends: 471 [2019-10-01 22:48:46,307 INFO L226 Difference]: Without dead ends: 268 [2019-10-01 22:48:46,309 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=460, Invalid=1432, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 22:48:46,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-10-01 22:48:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 260. [2019-10-01 22:48:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-01 22:48:46,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 269 transitions. [2019-10-01 22:48:46,323 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 269 transitions. Word has length 235 [2019-10-01 22:48:46,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:48:46,324 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 269 transitions. [2019-10-01 22:48:46,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 22:48:46,324 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 269 transitions. [2019-10-01 22:48:46,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-01 22:48:46,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:48:46,331 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:48:46,331 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:48:46,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:48:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash 855742032, now seen corresponding path program 16 times [2019-10-01 22:48:46,332 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:48:46,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:48:46,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:46,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:48:46,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:48:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2019-10-01 22:48:46,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:48:46,730 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:48:46,761 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:48:46,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:48:46,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:48:46,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:48:46,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:48:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2019-10-01 22:48:46,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:48:46,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 22:48:46,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 22:48:46,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 22:48:46,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 22:48:46,938 INFO L87 Difference]: Start difference. First operand 260 states and 269 transitions. Second operand 21 states. [2019-10-01 22:48:47,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:48:47,008 INFO L93 Difference]: Finished difference Result 482 states and 500 transitions. [2019-10-01 22:48:47,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 22:48:47,009 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 255 [2019-10-01 22:48:47,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:48:47,010 INFO L225 Difference]: With dead ends: 482 [2019-10-01 22:48:47,010 INFO L226 Difference]: Without dead ends: 263 [2019-10-01 22:48:47,011 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 255 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-10-01 22:48:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-10-01 22:48:47,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-10-01 22:48:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-01 22:48:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 271 transitions. [2019-10-01 22:48:47,020 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 271 transitions. Word has length 255 [2019-10-01 22:48:47,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:48:47,021 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 271 transitions. [2019-10-01 22:48:47,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 22:48:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 271 transitions. [2019-10-01 22:48:47,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-01 22:48:47,023 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:48:47,023 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:48:47,023 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:48:47,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:48:47,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1633347602, now seen corresponding path program 17 times [2019-10-01 22:48:47,024 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:48:47,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:48:47,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:47,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:48:47,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:48:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:48:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 1152 trivial. 0 not checked. [2019-10-01 22:48:47,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:48:47,343 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:48:47,373 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:50:48,448 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-10-01 22:50:48,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:50:48,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-01 22:50:48,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:50:48,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 1332 trivial. 0 not checked. [2019-10-01 22:50:48,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:50:48,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 34 [2019-10-01 22:50:48,800 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 22:50:48,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 22:50:48,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=808, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:50:48,802 INFO L87 Difference]: Start difference. First operand 262 states and 271 transitions. Second operand 34 states. [2019-10-01 22:50:49,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:50:49,380 INFO L93 Difference]: Finished difference Result 508 states and 534 transitions. [2019-10-01 22:50:49,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 22:50:49,381 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 257 [2019-10-01 22:50:49,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:50:49,382 INFO L225 Difference]: With dead ends: 508 [2019-10-01 22:50:49,383 INFO L226 Difference]: Without dead ends: 289 [2019-10-01 22:50:49,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=314, Invalid=808, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 22:50:49,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-01 22:50:49,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 280. [2019-10-01 22:50:49,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-10-01 22:50:49,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 289 transitions. [2019-10-01 22:50:49,393 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 289 transitions. Word has length 257 [2019-10-01 22:50:49,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:50:49,394 INFO L475 AbstractCegarLoop]: Abstraction has 280 states and 289 transitions. [2019-10-01 22:50:49,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 22:50:49,394 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 289 transitions. [2019-10-01 22:50:49,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-10-01 22:50:49,396 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:50:49,396 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:50:49,396 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:50:49,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:50:49,396 INFO L82 PathProgramCache]: Analyzing trace with hash -468089860, now seen corresponding path program 18 times [2019-10-01 22:50:49,396 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:50:49,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:50:49,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:50:49,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:50:49,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:50:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:50:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 1352 trivial. 0 not checked. [2019-10-01 22:50:49,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:50:49,901 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:50:49,958 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 22:52:49,821 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-10-01 22:52:49,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:52:49,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 22:52:49,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:52:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1713 backedges. 50 proven. 169 refuted. 0 times theorem prover too weak. 1494 trivial. 0 not checked. [2019-10-01 22:52:50,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:52:50,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18] total 38 [2019-10-01 22:52:50,206 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 22:52:50,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 22:52:50,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=1023, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:52:50,207 INFO L87 Difference]: Start difference. First operand 280 states and 289 transitions. Second operand 38 states. [2019-10-01 22:52:50,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:52:50,872 INFO L93 Difference]: Finished difference Result 550 states and 584 transitions. [2019-10-01 22:52:50,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 22:52:50,873 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 275 [2019-10-01 22:52:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:52:50,876 INFO L225 Difference]: With dead ends: 550 [2019-10-01 22:52:50,876 INFO L226 Difference]: Without dead ends: 315 [2019-10-01 22:52:50,877 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=383, Invalid=1023, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 22:52:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-10-01 22:52:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-10-01 22:52:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-10-01 22:52:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 323 transitions. [2019-10-01 22:52:50,887 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 323 transitions. Word has length 275 [2019-10-01 22:52:50,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:52:50,887 INFO L475 AbstractCegarLoop]: Abstraction has 314 states and 323 transitions. [2019-10-01 22:52:50,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 22:52:50,888 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 323 transitions. [2019-10-01 22:52:50,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-10-01 22:52:50,889 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:52:50,890 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:52:50,890 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:52:50,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:52:50,890 INFO L82 PathProgramCache]: Analyzing trace with hash 658794106, now seen corresponding path program 19 times [2019-10-01 22:52:50,891 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:52:50,891 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:52:50,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:52:50,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:52:50,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:52:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:52:51,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2019-10-01 22:52:51,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:52:51,275 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:52:51,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:52:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:52:51,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 22:52:51,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:52:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2019-10-01 22:52:51,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:52:51,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 22:52:51,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 22:52:51,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 22:52:51,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:52:51,500 INFO L87 Difference]: Start difference. First operand 314 states and 323 transitions. Second operand 24 states. [2019-10-01 22:52:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:52:51,578 INFO L93 Difference]: Finished difference Result 584 states and 602 transitions. [2019-10-01 22:52:51,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 22:52:51,580 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 309 [2019-10-01 22:52:51,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:52:51,582 INFO L225 Difference]: With dead ends: 584 [2019-10-01 22:52:51,582 INFO L226 Difference]: Without dead ends: 317 [2019-10-01 22:52:51,583 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 22:52:51,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-10-01 22:52:51,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 316. [2019-10-01 22:52:51,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-10-01 22:52:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 325 transitions. [2019-10-01 22:52:51,593 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 325 transitions. Word has length 309 [2019-10-01 22:52:51,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:52:51,593 INFO L475 AbstractCegarLoop]: Abstraction has 316 states and 325 transitions. [2019-10-01 22:52:51,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 22:52:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 325 transitions. [2019-10-01 22:52:51,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-10-01 22:52:51,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:52:51,596 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:52:51,596 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:52:51,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:52:51,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1683372648, now seen corresponding path program 20 times [2019-10-01 22:52:51,596 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:52:51,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:52:51,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:52:51,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 22:52:51,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:52:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:52:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2019-10-01 22:52:52,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:52:52,135 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:52:52,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 22:52:52,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 22:52:52,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:52:52,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-01 22:52:52,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:52:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2019-10-01 22:52:52,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:52:52,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-10-01 22:52:52,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-01 22:52:52,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-01 22:52:52,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:52:52,394 INFO L87 Difference]: Start difference. First operand 316 states and 325 transitions. Second operand 25 states. [2019-10-01 22:52:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:52:52,470 INFO L93 Difference]: Finished difference Result 586 states and 604 transitions. [2019-10-01 22:52:52,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-01 22:52:52,473 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 311 [2019-10-01 22:52:52,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:52:52,475 INFO L225 Difference]: With dead ends: 586 [2019-10-01 22:52:52,476 INFO L226 Difference]: Without dead ends: 319 [2019-10-01 22:52:52,477 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-10-01 22:52:52,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-10-01 22:52:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 318. [2019-10-01 22:52:52,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-10-01 22:52:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 327 transitions. [2019-10-01 22:52:52,487 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 327 transitions. Word has length 311 [2019-10-01 22:52:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:52:52,487 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 327 transitions. [2019-10-01 22:52:52,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-01 22:52:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 327 transitions. [2019-10-01 22:52:52,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-10-01 22:52:52,490 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:52:52,490 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:52:52,490 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:52:52,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:52:52,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1942760138, now seen corresponding path program 21 times [2019-10-01 22:52:52,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:52:52,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:52:52,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:52:52,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:52:52,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:52:52,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:52:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2284 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 1800 trivial. 0 not checked. [2019-10-01 22:52:53,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:52:53,000 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:52:53,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 22:54:46,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-10-01 22:54:46,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:54:46,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-01 22:54:46,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:54:47,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2284 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 2059 trivial. 0 not checked. [2019-10-01 22:54:47,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:54:47,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18] total 41 [2019-10-01 22:54:47,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 22:54:47,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 22:54:47,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=1188, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:54:47,156 INFO L87 Difference]: Start difference. First operand 318 states and 327 transitions. Second operand 41 states. [2019-10-01 22:54:47,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:54:47,986 INFO L93 Difference]: Finished difference Result 612 states and 638 transitions. [2019-10-01 22:54:47,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 22:54:47,986 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 313 [2019-10-01 22:54:47,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:54:47,989 INFO L225 Difference]: With dead ends: 612 [2019-10-01 22:54:47,989 INFO L226 Difference]: Without dead ends: 345 [2019-10-01 22:54:47,991 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=452, Invalid=1188, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 22:54:47,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-10-01 22:54:48,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 336. [2019-10-01 22:54:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-01 22:54:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 345 transitions. [2019-10-01 22:54:48,004 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 345 transitions. Word has length 313 [2019-10-01 22:54:48,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:54:48,005 INFO L475 AbstractCegarLoop]: Abstraction has 336 states and 345 transitions. [2019-10-01 22:54:48,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 22:54:48,005 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 345 transitions. [2019-10-01 22:54:48,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-10-01 22:54:48,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:54:48,008 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:54:48,008 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:54:48,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:54:48,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1391460164, now seen corresponding path program 22 times [2019-10-01 22:54:48,009 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:54:48,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:54:48,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:54:48,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:54:48,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:54:48,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:54:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2019-10-01 22:54:48,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:54:48,591 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:54:48,640 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 22:54:48,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 22:54:48,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:54:48,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 22:54:48,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:54:49,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2577 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 2321 trivial. 0 not checked. [2019-10-01 22:54:49,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:54:49,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19] total 43 [2019-10-01 22:54:49,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 22:54:49,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 22:54:49,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=495, Invalid=1311, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:54:49,309 INFO L87 Difference]: Start difference. First operand 336 states and 345 transitions. Second operand 43 states. [2019-10-01 22:54:49,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:54:49,935 INFO L93 Difference]: Finished difference Result 646 states and 672 transitions. [2019-10-01 22:54:49,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-01 22:54:49,936 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 331 [2019-10-01 22:54:49,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:54:49,938 INFO L225 Difference]: With dead ends: 646 [2019-10-01 22:54:49,939 INFO L226 Difference]: Without dead ends: 363 [2019-10-01 22:54:49,940 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=495, Invalid=1311, Unknown=0, NotChecked=0, Total=1806 [2019-10-01 22:54:49,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-10-01 22:54:49,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 354. [2019-10-01 22:54:49,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2019-10-01 22:54:49,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 363 transitions. [2019-10-01 22:54:49,951 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 363 transitions. Word has length 331 [2019-10-01 22:54:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:54:49,952 INFO L475 AbstractCegarLoop]: Abstraction has 354 states and 363 transitions. [2019-10-01 22:54:49,952 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 22:54:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 363 transitions. [2019-10-01 22:54:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-10-01 22:54:49,954 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:54:49,954 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:54:49,955 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:54:49,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:54:49,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1099464238, now seen corresponding path program 23 times [2019-10-01 22:54:49,955 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:54:49,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:54:49,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:54:49,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:54:49,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:54:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:54:50,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 2312 trivial. 0 not checked. [2019-10-01 22:54:50,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:54:50,695 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:54:50,752 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 22:57:59,123 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2019-10-01 22:57:59,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 22:57:59,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 22:57:59,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 22:57:59,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 2599 trivial. 0 not checked. [2019-10-01 22:57:59,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 22:57:59,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20] total 45 [2019-10-01 22:57:59,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-10-01 22:57:59,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-10-01 22:57:59,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=1440, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:57:59,792 INFO L87 Difference]: Start difference. First operand 354 states and 363 transitions. Second operand 45 states. [2019-10-01 22:58:00,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 22:58:00,678 INFO L93 Difference]: Finished difference Result 680 states and 706 transitions. [2019-10-01 22:58:00,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-01 22:58:00,678 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 349 [2019-10-01 22:58:00,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 22:58:00,681 INFO L225 Difference]: With dead ends: 680 [2019-10-01 22:58:00,681 INFO L226 Difference]: Without dead ends: 381 [2019-10-01 22:58:00,683 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=540, Invalid=1440, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 22:58:00,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-10-01 22:58:00,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 372. [2019-10-01 22:58:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-10-01 22:58:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 381 transitions. [2019-10-01 22:58:00,693 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 381 transitions. Word has length 349 [2019-10-01 22:58:00,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 22:58:00,693 INFO L475 AbstractCegarLoop]: Abstraction has 372 states and 381 transitions. [2019-10-01 22:58:00,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-10-01 22:58:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 381 transitions. [2019-10-01 22:58:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2019-10-01 22:58:00,696 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 22:58:00,696 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 22:58:00,696 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 22:58:00,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 22:58:00,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1027947744, now seen corresponding path program 24 times [2019-10-01 22:58:00,697 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 22:58:00,697 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 22:58:00,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:00,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 22:58:00,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 22:58:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 22:58:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3217 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 2592 trivial. 0 not checked. [2019-10-01 22:58:01,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 22:58:01,185 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 22:58:01,222 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE