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/reducercommutativity/sep10-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 14:41:38,876 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 14:41:38,879 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 14:41:38,891 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 14:41:38,892 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 14:41:38,893 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 14:41:38,894 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 14:41:38,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 14:41:38,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 14:41:38,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 14:41:38,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 14:41:38,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 14:41:38,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 14:41:38,902 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 14:41:38,903 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 14:41:38,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 14:41:38,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 14:41:38,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 14:41:38,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 14:41:38,920 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 14:41:38,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 14:41:38,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 14:41:38,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 14:41:38,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 14:41:38,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 14:41:38,927 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 14:41:38,927 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 14:41:38,928 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 14:41:38,928 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 14:41:38,929 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 14:41:38,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 14:41:38,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 14:41:38,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 14:41:38,931 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 14:41:38,932 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 14:41:38,933 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 14:41:38,933 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 14:41:38,933 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 14:41:38,934 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 14:41:38,934 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 14:41:38,935 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 14:41:38,936 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-02 14:41:38,955 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 14:41:38,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 14:41:38,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 14:41:38,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 14:41:38,957 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 14:41:38,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 14:41:38,958 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 14:41:38,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 14:41:38,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 14:41:38,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 14:41:38,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 14:41:38,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 14:41:38,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 14:41:38,959 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 14:41:38,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 14:41:38,960 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 14:41:38,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 14:41:38,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 14:41:38,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 14:41:38,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 14:41:38,961 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 14:41:38,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:41:38,962 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 14:41:38,963 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 14:41:38,963 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 14:41:38,963 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 14:41:38,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 14:41:38,963 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 14:41:38,964 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 14:41:39,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 14:41:39,012 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 14:41:39,015 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 14:41:39,017 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 14:41:39,017 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 14:41:39,018 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sep10-2.i [2019-10-02 14:41:39,078 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f9d5933c/804e766e6cfd4819a04c937e400c8b21/FLAGf1ed48dab [2019-10-02 14:41:39,503 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 14:41:39,504 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sep10-2.i [2019-10-02 14:41:39,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f9d5933c/804e766e6cfd4819a04c937e400c8b21/FLAGf1ed48dab [2019-10-02 14:41:39,886 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f9d5933c/804e766e6cfd4819a04c937e400c8b21 [2019-10-02 14:41:39,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 14:41:39,897 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 14:41:39,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 14:41:39,898 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 14:41:39,902 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 14:41:39,903 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:41:39" (1/1) ... [2019-10-02 14:41:39,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5883d8f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:39, skipping insertion in model container [2019-10-02 14:41:39,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:41:39" (1/1) ... [2019-10-02 14:41:39,914 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 14:41:39,933 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 14:41:40,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:41:40,130 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 14:41:40,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 14:41:40,269 INFO L192 MainTranslator]: Completed translation [2019-10-02 14:41:40,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:40 WrapperNode [2019-10-02 14:41:40,270 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 14:41:40,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 14:41:40,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 14:41:40,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 14:41:40,284 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:40" (1/1) ... [2019-10-02 14:41:40,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:40" (1/1) ... [2019-10-02 14:41:40,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:40" (1/1) ... [2019-10-02 14:41:40,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:40" (1/1) ... [2019-10-02 14:41:40,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:40" (1/1) ... [2019-10-02 14:41:40,322 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:40" (1/1) ... [2019-10-02 14:41:40,323 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:40" (1/1) ... [2019-10-02 14:41:40,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 14:41:40,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 14:41:40,326 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 14:41:40,326 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 14:41:40,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 14:41:40,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 14:41:40,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 14:41:40,381 INFO L138 BoogieDeclarations]: Found implementation of procedure sep [2019-10-02 14:41:40,381 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 14:41:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 14:41:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 14:41:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure sep [2019-10-02 14:41:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 14:41:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 14:41:40,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 14:41:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 14:41:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 14:41:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 14:41:40,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 14:41:40,689 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 14:41:40,690 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-02 14:41:40,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:41:40 BoogieIcfgContainer [2019-10-02 14:41:40,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 14:41:40,693 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 14:41:40,693 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 14:41:40,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 14:41:40,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:41:39" (1/3) ... [2019-10-02 14:41:40,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c19154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:41:40, skipping insertion in model container [2019-10-02 14:41:40,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:41:40" (2/3) ... [2019-10-02 14:41:40,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59c19154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:41:40, skipping insertion in model container [2019-10-02 14:41:40,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:41:40" (3/3) ... [2019-10-02 14:41:40,699 INFO L109 eAbstractionObserver]: Analyzing ICFG sep10-2.i [2019-10-02 14:41:40,711 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 14:41:40,724 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 14:41:40,747 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 14:41:40,774 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 14:41:40,775 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 14:41:40,775 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 14:41:40,775 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 14:41:40,775 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 14:41:40,775 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 14:41:40,775 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 14:41:40,776 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 14:41:40,776 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 14:41:40,791 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-02 14:41:40,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:41:40,796 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:40,797 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:40,799 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:40,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:40,803 INFO L82 PathProgramCache]: Analyzing trace with hash 794343521, now seen corresponding path program 1 times [2019-10-02 14:41:40,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:40,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:40,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:40,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:40,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 14:41:40,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:41:40,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 14:41:40,966 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 14:41:40,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 14:41:40,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 14:41:40,983 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-10-02 14:41:41,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:41,008 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2019-10-02 14:41:41,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 14:41:41,010 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-10-02 14:41:41,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:41,019 INFO L225 Difference]: With dead ends: 56 [2019-10-02 14:41:41,019 INFO L226 Difference]: Without dead ends: 27 [2019-10-02 14:41:41,023 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-02 14:41:41,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-02 14:41:41,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-02 14:41:41,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 14:41:41,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2019-10-02 14:41:41,062 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 32 [2019-10-02 14:41:41,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:41,062 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2019-10-02 14:41:41,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 14:41:41,063 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2019-10-02 14:41:41,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 14:41:41,065 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:41,065 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:41,065 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:41,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:41,066 INFO L82 PathProgramCache]: Analyzing trace with hash 2140793590, now seen corresponding path program 1 times [2019-10-02 14:41:41,066 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:41,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:41,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:41,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:41,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 14:41:41,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:41:41,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:41:41,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:41:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:41:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:41:41,133 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 3 states. [2019-10-02 14:41:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:41,153 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2019-10-02 14:41:41,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:41:41,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 14:41:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:41,155 INFO L225 Difference]: With dead ends: 48 [2019-10-02 14:41:41,155 INFO L226 Difference]: Without dead ends: 29 [2019-10-02 14:41:41,157 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-02 14:41:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-02 14:41:41,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-10-02 14:41:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-02 14:41:41,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2019-10-02 14:41:41,166 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 32 [2019-10-02 14:41:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:41,167 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2019-10-02 14:41:41,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:41:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2019-10-02 14:41:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 14:41:41,169 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:41,169 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:41,169 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:41,170 INFO L82 PathProgramCache]: Analyzing trace with hash 2099349144, now seen corresponding path program 1 times [2019-10-02 14:41:41,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:41,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:41,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:41,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:41,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:41,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 14:41:41,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:41,252 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) [2019-10-02 14:41:41,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:41,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:41,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 14:41:41,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:41:41,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 14:41:41,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-10-02 14:41:41,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 14:41:41,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 14:41:41,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:41:41,419 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2019-10-02 14:41:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:41,459 INFO L93 Difference]: Finished difference Result 49 states and 62 transitions. [2019-10-02 14:41:41,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:41:41,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-10-02 14:41:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:41,461 INFO L225 Difference]: With dead ends: 49 [2019-10-02 14:41:41,461 INFO L226 Difference]: Without dead ends: 31 [2019-10-02 14:41:41,462 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 14:41:41,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-02 14:41:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-10-02 14:41:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 14:41:41,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2019-10-02 14:41:41,468 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 34 [2019-10-02 14:41:41,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:41,469 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2019-10-02 14:41:41,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 14:41:41,469 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2019-10-02 14:41:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-02 14:41:41,471 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:41,471 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:41,471 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:41,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:41,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1279819331, now seen corresponding path program 1 times [2019-10-02 14:41:41,472 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:41,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:41,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:41,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:41,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:41,575 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:41,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 14:41:41,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 14:41:41,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 14:41:41,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 14:41:41,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 14:41:41,577 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2019-10-02 14:41:41,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:41,592 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2019-10-02 14:41:41,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 14:41:41,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-02 14:41:41,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:41,594 INFO L225 Difference]: With dead ends: 45 [2019-10-02 14:41:41,594 INFO L226 Difference]: Without dead ends: 31 [2019-10-02 14:41:41,595 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-02 14:41:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-02 14:41:41,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-10-02 14:41:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-02 14:41:41,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-02 14:41:41,601 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 43 [2019-10-02 14:41:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:41,603 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-02 14:41:41,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 14:41:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-02 14:41:41,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-02 14:41:41,605 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:41,605 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 14:41:41,606 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:41,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:41,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1550635457, now seen corresponding path program 1 times [2019-10-02 14:41:41,606 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:41,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:41,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:41,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:41,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:41,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:41,720 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:41,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:41,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:41:41,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:41,863 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:41,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:41,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 14:41:41,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 14:41:41,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 14:41:41,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 14:41:41,869 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2019-10-02 14:41:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:41,894 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2019-10-02 14:41:41,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 14:41:41,895 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-02 14:41:41,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:41,896 INFO L225 Difference]: With dead ends: 54 [2019-10-02 14:41:41,896 INFO L226 Difference]: Without dead ends: 33 [2019-10-02 14:41:41,896 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-02 14:41:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-02 14:41:41,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-02 14:41:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-02 14:41:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-10-02 14:41:41,902 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 45 [2019-10-02 14:41:41,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:41,903 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-10-02 14:41:41,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 14:41:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-10-02 14:41:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 14:41:41,904 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:41,904 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:41,905 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:41,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:41,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1356401117, now seen corresponding path program 2 times [2019-10-02 14:41:41,905 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:41,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:41,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:41,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:41,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:42,000 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:42,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:42,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:41:42,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:42,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:41:42,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:42,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:41:42,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:41:42,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:42,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 14:41:42,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:41:42,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:41:42,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:41:42,116 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2019-10-02 14:41:42,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:42,158 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2019-10-02 14:41:42,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:41:42,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-02 14:41:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:42,160 INFO L225 Difference]: With dead ends: 56 [2019-10-02 14:41:42,160 INFO L226 Difference]: Without dead ends: 35 [2019-10-02 14:41:42,161 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:41:42,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-02 14:41:42,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-10-02 14:41:42,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-02 14:41:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2019-10-02 14:41:42,179 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 47 [2019-10-02 14:41:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:42,179 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2019-10-02 14:41:42,179 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:41:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2019-10-02 14:41:42,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 14:41:42,181 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:42,184 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 14:41:42,184 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:42,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:42,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1005160965, now seen corresponding path program 3 times [2019-10-02 14:41:42,185 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:42,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:42,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:42,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:42,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 14:41:42,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:42,302 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-02 14:41:42,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:41:42,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 14:41:42,360 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:42,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:41:42,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:42,391 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 14:41:42,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:42,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-02 14:41:42,395 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 14:41:42,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 14:41:42,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:41:42,396 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 8 states. [2019-10-02 14:41:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:42,449 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2019-10-02 14:41:42,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:41:42,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2019-10-02 14:41:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:42,450 INFO L225 Difference]: With dead ends: 63 [2019-10-02 14:41:42,450 INFO L226 Difference]: Without dead ends: 42 [2019-10-02 14:41:42,451 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-02 14:41:42,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-02 14:41:42,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-10-02 14:41:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-02 14:41:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2019-10-02 14:41:42,457 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 49 [2019-10-02 14:41:42,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:42,458 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2019-10-02 14:41:42,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 14:41:42,458 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2019-10-02 14:41:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 14:41:42,459 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:42,460 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:42,460 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:42,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:42,460 INFO L82 PathProgramCache]: Analyzing trace with hash 742022364, now seen corresponding path program 4 times [2019-10-02 14:41:42,460 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:42,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:42,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:42,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:42,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 20 proven. 25 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-10-02 14:41:42,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:42,560 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-02 14:41:42,582 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:42,623 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:41:42,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:42,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:41:42,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:42,661 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:41:42,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:42,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-02 14:41:42,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 14:41:42,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 14:41:42,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:41:42,671 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 6 states. [2019-10-02 14:41:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:42,712 INFO L93 Difference]: Finished difference Result 67 states and 83 transitions. [2019-10-02 14:41:42,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 14:41:42,713 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-10-02 14:41:42,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:42,714 INFO L225 Difference]: With dead ends: 67 [2019-10-02 14:41:42,714 INFO L226 Difference]: Without dead ends: 44 [2019-10-02 14:41:42,715 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-02 14:41:42,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-02 14:41:42,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-10-02 14:41:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-02 14:41:42,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2019-10-02 14:41:42,721 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 60 [2019-10-02 14:41:42,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:42,722 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2019-10-02 14:41:42,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 14:41:42,722 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2019-10-02 14:41:42,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-10-02 14:41:42,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:42,724 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:42,724 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:42,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1977898503, now seen corresponding path program 5 times [2019-10-02 14:41:42,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:42,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:42,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:42,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:42,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:42,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:42,860 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-10-02 14:41:42,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:42,861 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-02 14:41:42,894 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:41:42,952 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-02 14:41:42,952 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:42,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:41:42,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:42,999 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 70 proven. 12 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-10-02 14:41:43,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:43,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2019-10-02 14:41:43,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:41:43,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:41:43,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:41:43,005 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 11 states. [2019-10-02 14:41:43,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:43,077 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-10-02 14:41:43,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:41:43,079 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2019-10-02 14:41:43,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:43,080 INFO L225 Difference]: With dead ends: 77 [2019-10-02 14:41:43,081 INFO L226 Difference]: Without dead ends: 50 [2019-10-02 14:41:43,081 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 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-02 14:41:43,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-02 14:41:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-10-02 14:41:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-02 14:41:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-10-02 14:41:43,093 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 69 [2019-10-02 14:41:43,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:43,094 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-10-02 14:41:43,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:41:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-10-02 14:41:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-10-02 14:41:43,096 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:43,096 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:43,096 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:43,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:43,097 INFO L82 PathProgramCache]: Analyzing trace with hash -174901602, now seen corresponding path program 6 times [2019-10-02 14:41:43,097 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:43,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:43,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:43,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:43,209 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-10-02 14:41:43,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:43,209 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) [2019-10-02 14:41:43,239 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:43,288 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-10-02 14:41:43,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:43,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 14:41:43,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:43,324 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 122 proven. 1 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-10-02 14:41:43,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:43,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2019-10-02 14:41:43,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:41:43,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:41:43,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:41:43,331 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 10 states. [2019-10-02 14:41:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:43,385 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2019-10-02 14:41:43,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:41:43,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 80 [2019-10-02 14:41:43,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:43,386 INFO L225 Difference]: With dead ends: 83 [2019-10-02 14:41:43,386 INFO L226 Difference]: Without dead ends: 53 [2019-10-02 14:41:43,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:41:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-02 14:41:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-10-02 14:41:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-02 14:41:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-10-02 14:41:43,393 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 80 [2019-10-02 14:41:43,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:43,394 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-10-02 14:41:43,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:41:43,394 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-10-02 14:41:43,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 14:41:43,395 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:43,396 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:43,396 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:43,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:43,396 INFO L82 PathProgramCache]: Analyzing trace with hash 16242046, now seen corresponding path program 7 times [2019-10-02 14:41:43,396 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:43,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:43,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:43,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 14:41:43,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:43,520 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:43,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:43,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:41:43,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 14:41:43,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:43,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-02 14:41:43,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:41:43,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:41:43,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:41:43,655 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 10 states. [2019-10-02 14:41:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:43,701 INFO L93 Difference]: Finished difference Result 86 states and 102 transitions. [2019-10-02 14:41:43,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:41:43,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-10-02 14:41:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:43,703 INFO L225 Difference]: With dead ends: 86 [2019-10-02 14:41:43,703 INFO L226 Difference]: Without dead ends: 54 [2019-10-02 14:41:43,705 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:41:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-02 14:41:43,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-10-02 14:41:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-02 14:41:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2019-10-02 14:41:43,720 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 84 [2019-10-02 14:41:43,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:43,721 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2019-10-02 14:41:43,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:41:43,721 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2019-10-02 14:41:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 14:41:43,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:43,723 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 7, 7, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:43,724 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash 27018272, now seen corresponding path program 8 times [2019-10-02 14:41:43,725 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:43,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:43,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:43,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:43,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:43,882 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 14:41:43,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:43,882 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-02 14:41:43,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:41:43,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:41:43,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:43,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:41:43,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:44,004 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 14:41:44,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:44,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-02 14:41:44,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:41:44,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:41:44,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:41:44,019 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 11 states. [2019-10-02 14:41:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:44,056 INFO L93 Difference]: Finished difference Result 88 states and 104 transitions. [2019-10-02 14:41:44,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:41:44,058 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-10-02 14:41:44,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:44,059 INFO L225 Difference]: With dead ends: 88 [2019-10-02 14:41:44,059 INFO L226 Difference]: Without dead ends: 56 [2019-10-02 14:41:44,061 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 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-02 14:41:44,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-02 14:41:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-10-02 14:41:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-02 14:41:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2019-10-02 14:41:44,072 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 86 [2019-10-02 14:41:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:44,073 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2019-10-02 14:41:44,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:41:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2019-10-02 14:41:44,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 14:41:44,076 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:44,076 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 8, 8, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:44,076 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:44,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:44,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1793036866, now seen corresponding path program 9 times [2019-10-02 14:41:44,077 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:44,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:44,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:44,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:44,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:44,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-10-02 14:41:44,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:44,203 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-02 14:41:44,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:44,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-02 14:41:44,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:44,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 14:41:44,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 122 proven. 4 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-10-02 14:41:44,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:44,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-10-02 14:41:44,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 14:41:44,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 14:41:44,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:41:44,343 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 14 states. [2019-10-02 14:41:44,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:44,432 INFO L93 Difference]: Finished difference Result 93 states and 110 transitions. [2019-10-02 14:41:44,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 14:41:44,433 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2019-10-02 14:41:44,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:44,434 INFO L225 Difference]: With dead ends: 93 [2019-10-02 14:41:44,434 INFO L226 Difference]: Without dead ends: 61 [2019-10-02 14:41:44,434 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-10-02 14:41:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-02 14:41:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-10-02 14:41:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-02 14:41:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-10-02 14:41:44,444 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 88 [2019-10-02 14:41:44,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:44,449 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-10-02 14:41:44,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 14:41:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-10-02 14:41:44,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 14:41:44,450 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:44,450 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 9, 9, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:44,450 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:44,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:44,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1251186210, now seen corresponding path program 10 times [2019-10-02 14:41:44,451 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:44,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:44,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:44,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:44,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-10-02 14:41:44,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:44,601 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-02 14:41:44,632 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:41:44,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:41:44,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:44,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:41:44,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 339 backedges. 116 proven. 22 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2019-10-02 14:41:44,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:44,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2019-10-02 14:41:44,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 14:41:44,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 14:41:44,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:41:44,773 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 17 states. [2019-10-02 14:41:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:44,845 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2019-10-02 14:41:44,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:41:44,845 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 92 [2019-10-02 14:41:44,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:44,846 INFO L225 Difference]: With dead ends: 100 [2019-10-02 14:41:44,847 INFO L226 Difference]: Without dead ends: 66 [2019-10-02 14:41:44,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:41:44,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-02 14:41:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2019-10-02 14:41:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-02 14:41:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2019-10-02 14:41:44,852 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 92 [2019-10-02 14:41:44,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:44,853 INFO L475 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2019-10-02 14:41:44,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 14:41:44,853 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2019-10-02 14:41:44,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 14:41:44,854 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:44,854 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 10, 10, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:44,855 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:44,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:44,855 INFO L82 PathProgramCache]: Analyzing trace with hash -2058184687, now seen corresponding path program 11 times [2019-10-02 14:41:44,855 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:44,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:44,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:44,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:44,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 213 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2019-10-02 14:41:44,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:44,989 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-02 14:41:45,025 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:41:45,352 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-10-02 14:41:45,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:45,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:41:45,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:45,377 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 174 proven. 35 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-10-02 14:41:45,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:45,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-02 14:41:45,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:41:45,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:41:45,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:41:45,389 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 9 states. [2019-10-02 14:41:45,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:45,426 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2019-10-02 14:41:45,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:41:45,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-10-02 14:41:45,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:45,428 INFO L225 Difference]: With dead ends: 105 [2019-10-02 14:41:45,428 INFO L226 Difference]: Without dead ends: 69 [2019-10-02 14:41:45,429 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:41:45,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-02 14:41:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2019-10-02 14:41:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-10-02 14:41:45,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2019-10-02 14:41:45,437 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 103 [2019-10-02 14:41:45,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:45,437 INFO L475 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2019-10-02 14:41:45,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:41:45,437 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2019-10-02 14:41:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-02 14:41:45,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:45,439 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 10, 10, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:45,439 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:45,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:45,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1611383708, now seen corresponding path program 12 times [2019-10-02 14:41:45,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:45,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:45,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:45,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 124 proven. 175 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2019-10-02 14:41:45,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:45,670 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-02 14:41:45,715 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:41:45,828 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-10-02 14:41:45,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:45,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 14:41:45,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 250 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Stream Closed [2019-10-02 14:41:45,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:45,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 13 [2019-10-02 14:41:45,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 14:41:45,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 14:41:45,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:41:45,894 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand 13 states. [2019-10-02 14:41:45,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:45,950 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2019-10-02 14:41:45,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 14:41:45,950 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 112 [2019-10-02 14:41:45,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:45,951 INFO L225 Difference]: With dead ends: 114 [2019-10-02 14:41:45,951 INFO L226 Difference]: Without dead ends: 75 [2019-10-02 14:41:45,952 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-02 14:41:45,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-10-02 14:41:45,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-10-02 14:41:45,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-02 14:41:45,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2019-10-02 14:41:45,956 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 112 [2019-10-02 14:41:45,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:45,956 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-10-02 14:41:45,956 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 14:41:45,956 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2019-10-02 14:41:45,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 14:41:45,958 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:45,958 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:45,958 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:45,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:45,958 INFO L82 PathProgramCache]: Analyzing trace with hash 2115527283, now seen corresponding path program 13 times [2019-10-02 14:41:45,959 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:45,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:45,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:45,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:45,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:46,107 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 165 proven. 235 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2019-10-02 14:41:46,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:46,108 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-02 14:41:46,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:46,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:41:46,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:46,222 INFO L134 CoverageAnalysis]: Checked inductivity of 824 backedges. 326 proven. 70 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2019-10-02 14:41:46,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:46,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-02 14:41:46,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:41:46,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:41:46,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:41:46,235 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 11 states. [2019-10-02 14:41:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:46,270 INFO L93 Difference]: Finished difference Result 121 states and 147 transitions. [2019-10-02 14:41:46,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:41:46,271 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 123 [2019-10-02 14:41:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:46,272 INFO L225 Difference]: With dead ends: 121 [2019-10-02 14:41:46,272 INFO L226 Difference]: Without dead ends: 77 [2019-10-02 14:41:46,272 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 123 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-02 14:41:46,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-02 14:41:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2019-10-02 14:41:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-02 14:41:46,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 87 transitions. [2019-10-02 14:41:46,277 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 87 transitions. Word has length 123 [2019-10-02 14:41:46,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:46,277 INFO L475 AbstractCegarLoop]: Abstraction has 75 states and 87 transitions. [2019-10-02 14:41:46,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:41:46,277 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 87 transitions. [2019-10-02 14:41:46,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 14:41:46,279 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:46,279 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:46,279 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:46,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:46,280 INFO L82 PathProgramCache]: Analyzing trace with hash -638066878, now seen corresponding path program 14 times [2019-10-02 14:41:46,280 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:46,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:46,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:46,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:46,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 0 proven. 516 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-10-02 14:41:46,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:46,441 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-02 14:41:46,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:41:46,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:41:46,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:46,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:41:46,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1031 backedges. 420 proven. 92 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2019-10-02 14:41:46,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:46,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-02 14:41:46,609 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:41:46,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:41:46,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:41:46,610 INFO L87 Difference]: Start difference. First operand 75 states and 87 transitions. Second operand 12 states. [2019-10-02 14:41:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:46,659 INFO L93 Difference]: Finished difference Result 127 states and 155 transitions. [2019-10-02 14:41:46,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:41:46,659 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 132 [2019-10-02 14:41:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:46,660 INFO L225 Difference]: With dead ends: 127 [2019-10-02 14:41:46,660 INFO L226 Difference]: Without dead ends: 80 [2019-10-02 14:41:46,661 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 132 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-02 14:41:46,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-02 14:41:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-10-02 14:41:46,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-02 14:41:46,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2019-10-02 14:41:46,665 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 132 [2019-10-02 14:41:46,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:46,666 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2019-10-02 14:41:46,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:41:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2019-10-02 14:41:46,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 14:41:46,668 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:46,668 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 10, 10, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:46,668 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:46,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:46,668 INFO L82 PathProgramCache]: Analyzing trace with hash -720039853, now seen corresponding path program 15 times [2019-10-02 14:41:46,669 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:46,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:46,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:46,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:46,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 265 proven. 382 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2019-10-02 14:41:46,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:46,876 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-02 14:41:46,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 14:41:46,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-02 14:41:46,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:46,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 14:41:46,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:47,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 532 proven. 16 refuted. 0 times theorem prover too weak. 717 trivial. 0 not checked. [2019-10-02 14:41:47,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:47,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 17 [2019-10-02 14:41:47,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 14:41:47,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 14:41:47,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:41:47,064 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 17 states. [2019-10-02 14:41:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:47,140 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2019-10-02 14:41:47,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 14:41:47,140 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 141 [2019-10-02 14:41:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:47,141 INFO L225 Difference]: With dead ends: 134 [2019-10-02 14:41:47,141 INFO L226 Difference]: Without dead ends: 84 [2019-10-02 14:41:47,142 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-10-02 14:41:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-02 14:41:47,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2019-10-02 14:41:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-02 14:41:47,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2019-10-02 14:41:47,148 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 141 [2019-10-02 14:41:47,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:47,149 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2019-10-02 14:41:47,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 14:41:47,149 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2019-10-02 14:41:47,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 14:41:47,150 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:47,151 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:47,151 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:47,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:47,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1444910496, now seen corresponding path program 16 times [2019-10-02 14:41:47,152 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:47,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:47,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:47,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1535 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2019-10-02 14:41:47,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:47,430 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-02 14:41:47,464 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 14:41:47,577 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 14:41:47,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:47,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 471 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 14:41:47,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:47,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1535 backedges. 650 proven. 25 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-10-02 14:41:47,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:47,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-02 14:41:47,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 14:41:47,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 14:41:47,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:41:47,612 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand 9 states. [2019-10-02 14:41:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:47,646 INFO L93 Difference]: Finished difference Result 127 states and 152 transitions. [2019-10-02 14:41:47,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 14:41:47,646 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 152 [2019-10-02 14:41:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:47,647 INFO L225 Difference]: With dead ends: 127 [2019-10-02 14:41:47,647 INFO L226 Difference]: Without dead ends: 86 [2019-10-02 14:41:47,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-02 14:41:47,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-02 14:41:47,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-10-02 14:41:47,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-10-02 14:41:47,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 99 transitions. [2019-10-02 14:41:47,652 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 99 transitions. Word has length 152 [2019-10-02 14:41:47,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:47,652 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 99 transitions. [2019-10-02 14:41:47,652 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 14:41:47,653 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 99 transitions. [2019-10-02 14:41:47,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 14:41:47,654 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:47,654 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 6, 6, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:47,655 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:47,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:47,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1810174302, now seen corresponding path program 17 times [2019-10-02 14:41:47,655 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:47,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:47,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:47,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1546 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2019-10-02 14:41:47,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:47,836 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-02 14:41:47,867 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-02 14:41:48,666 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-10-02 14:41:48,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:48,670 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 14:41:48,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1546 backedges. 650 proven. 36 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:41:48,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:48,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-10-02 14:41:48,704 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 14:41:48,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 14:41:48,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:41:48,704 INFO L87 Difference]: Start difference. First operand 85 states and 99 transitions. Second operand 10 states. [2019-10-02 14:41:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:48,737 INFO L93 Difference]: Finished difference Result 129 states and 154 transitions. [2019-10-02 14:41:48,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 14:41:48,737 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-10-02 14:41:48,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:48,738 INFO L225 Difference]: With dead ends: 129 [2019-10-02 14:41:48,739 INFO L226 Difference]: Without dead ends: 88 [2019-10-02 14:41:48,739 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-10-02 14:41:48,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-10-02 14:41:48,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2019-10-02 14:41:48,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-10-02 14:41:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2019-10-02 14:41:48,745 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 154 [2019-10-02 14:41:48,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:48,745 INFO L475 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2019-10-02 14:41:48,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 14:41:48,745 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2019-10-02 14:41:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 14:41:48,747 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:48,747 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 7, 7, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:48,747 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:48,748 INFO L82 PathProgramCache]: Analyzing trace with hash 641373596, now seen corresponding path program 18 times [2019-10-02 14:41:48,748 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:48,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:48,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:48,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:48,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:48,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2019-10-02 14:41:48,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:48,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 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-02 14:41:49,002 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-02 14:41:49,362 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-10-02 14:41:49,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:49,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 14:41:49,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:49,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1559 backedges. 650 proven. 49 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [2019-10-02 14:41:49,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:49,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-02 14:41:49,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 14:41:49,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 14:41:49,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-02 14:41:49,403 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand 11 states. [2019-10-02 14:41:49,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:49,433 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2019-10-02 14:41:49,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 14:41:49,434 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 156 [2019-10-02 14:41:49,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:49,435 INFO L225 Difference]: With dead ends: 131 [2019-10-02 14:41:49,435 INFO L226 Difference]: Without dead ends: 90 [2019-10-02 14:41:49,436 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 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-02 14:41:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-02 14:41:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2019-10-02 14:41:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-02 14:41:49,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2019-10-02 14:41:49,440 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 156 [2019-10-02 14:41:49,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:49,440 INFO L475 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2019-10-02 14:41:49,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 14:41:49,441 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2019-10-02 14:41:49,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 14:41:49,442 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:49,442 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 8, 8, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:49,443 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:49,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:49,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1589640614, now seen corresponding path program 19 times [2019-10-02 14:41:49,443 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:49,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:49,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:49,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:49,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 1510 trivial. 0 not checked. [2019-10-02 14:41:49,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:49,654 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-02 14:41:49,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:49,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-02 14:41:49,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:49,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 650 proven. 64 refuted. 0 times theorem prover too weak. 860 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 14:41:49,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:49,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-02 14:41:49,822 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 14:41:49,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 14:41:49,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-02 14:41:49,824 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand 12 states. [2019-10-02 14:41:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:49,874 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2019-10-02 14:41:49,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 14:41:49,874 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 158 [2019-10-02 14:41:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:49,875 INFO L225 Difference]: With dead ends: 132 [2019-10-02 14:41:49,875 INFO L226 Difference]: Without dead ends: 91 [2019-10-02 14:41:49,876 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 158 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-02 14:41:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-02 14:41:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-10-02 14:41:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-02 14:41:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2019-10-02 14:41:49,883 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 158 [2019-10-02 14:41:49,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:49,883 INFO L475 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2019-10-02 14:41:49,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 14:41:49,884 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2019-10-02 14:41:49,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 14:41:49,886 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:49,886 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:49,886 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:49,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:49,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1889351576, now seen corresponding path program 20 times [2019-10-02 14:41:49,887 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:49,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:49,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:49,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:49,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:51,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 0 proven. 1309 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2019-10-02 14:41:51,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:51,119 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) [2019-10-02 14:41:51,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:41:51,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:41:51,268 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:41:51,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 107 conjunts are in the unsatisfiable core [2019-10-02 14:41:51,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:51,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:41:51,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:41:52,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 14:41:52,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 60 proven. 1305 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-10-02 14:41:52,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:52,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 40] total 43 [2019-10-02 14:41:52,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-02 14:41:52,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-02 14:41:52,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1694, Unknown=0, NotChecked=0, Total=1806 [2019-10-02 14:41:52,277 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 43 states. [2019-10-02 14:41:53,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:41:53,858 INFO L93 Difference]: Finished difference Result 299 states and 417 transitions. [2019-10-02 14:41:53,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-02 14:41:53,859 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 160 [2019-10-02 14:41:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:41:53,864 INFO L225 Difference]: With dead ends: 299 [2019-10-02 14:41:53,864 INFO L226 Difference]: Without dead ends: 295 [2019-10-02 14:41:53,866 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 153 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=1775, Unknown=0, NotChecked=0, Total=1892 [2019-10-02 14:41:53,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-10-02 14:41:53,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 233. [2019-10-02 14:41:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-10-02 14:41:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 299 transitions. [2019-10-02 14:41:53,915 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 299 transitions. Word has length 160 [2019-10-02 14:41:53,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:41:53,915 INFO L475 AbstractCegarLoop]: Abstraction has 233 states and 299 transitions. [2019-10-02 14:41:53,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-02 14:41:53,916 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 299 transitions. [2019-10-02 14:41:53,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 14:41:53,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:41:53,919 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 29, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:41:53,919 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:41:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:41:53,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1725557350, now seen corresponding path program 1 times [2019-10-02 14:41:53,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:41:53,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:41:53,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:53,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 14:41:53,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:41:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 62 proven. 1275 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2019-10-02 14:41:56,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:41:56,264 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-02 14:41:56,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:41:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:41:56,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-02 14:41:56,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:41:56,443 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 14:41:56,447 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2019-10-02 14:41:56,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:41:56,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:41:56,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:41:56,454 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2019-10-02 14:41:56,614 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-02 14:41:56,614 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:41:56,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:41:56,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:41:56,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:11 [2019-10-02 14:41:56,627 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-02 14:41:56,627 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:41:56,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:41:56,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:41:56,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:23 [2019-10-02 14:41:57,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 651 proven. 487 refuted. 0 times theorem prover too weak. 453 trivial. 0 not checked. [2019-10-02 14:41:57,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 14:41:57,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 22] total 51 [2019-10-02 14:41:57,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-10-02 14:41:57,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-10-02 14:41:57,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2386, Unknown=0, NotChecked=0, Total=2550 [2019-10-02 14:41:57,649 INFO L87 Difference]: Start difference. First operand 233 states and 299 transitions. Second operand 51 states. [2019-10-02 14:42:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 14:42:05,543 INFO L93 Difference]: Finished difference Result 1254 states and 1742 transitions. [2019-10-02 14:42:05,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-10-02 14:42:05,546 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 160 [2019-10-02 14:42:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 14:42:05,554 INFO L225 Difference]: With dead ends: 1254 [2019-10-02 14:42:05,555 INFO L226 Difference]: Without dead ends: 966 [2019-10-02 14:42:05,563 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 204 SyntacticMatches, 2 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8843 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=1264, Invalid=22916, Unknown=0, NotChecked=0, Total=24180 [2019-10-02 14:42:05,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2019-10-02 14:42:05,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 610. [2019-10-02 14:42:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-02 14:42:05,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 820 transitions. [2019-10-02 14:42:05,616 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 820 transitions. Word has length 160 [2019-10-02 14:42:05,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 14:42:05,617 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 820 transitions. [2019-10-02 14:42:05,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-10-02 14:42:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 820 transitions. [2019-10-02 14:42:05,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 14:42:05,622 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 14:42:05,623 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 29, 10, 10, 9, 9, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 14:42:05,623 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 14:42:05,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 14:42:05,623 INFO L82 PathProgramCache]: Analyzing trace with hash -2147450282, now seen corresponding path program 2 times [2019-10-02 14:42:05,623 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 14:42:05,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 14:42:05,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:05,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 14:42:05,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 14:42:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 14:42:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1591 backedges. 73 proven. 1490 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 14:42:09,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 14:42:09,968 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-02 14:42:09,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 14:42:10,107 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 14:42:10,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 14:42:10,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 115 conjunts are in the unsatisfiable core [2019-10-02 14:42:10,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 14:42:10,138 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-10-02 14:42:10,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 14:42:10,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 14:42:10,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 14:42:10,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:3 [2019-10-02 14:42:10,959 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 14:42:10,960 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:465) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-02 14:42:10,965 INFO L168 Benchmark]: Toolchain (without parser) took 31068.16 ms. Allocated memory was 136.8 MB in the beginning and 560.5 MB in the end (delta: 423.6 MB). Free memory was 87.5 MB in the beginning and 279.6 MB in the end (delta: -192.1 MB). Peak memory consumption was 231.5 MB. Max. memory is 7.1 GB. [2019-10-02 14:42:10,966 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-02 14:42:10,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.77 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 87.3 MB in the beginning and 179.9 MB in the end (delta: -92.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-10-02 14:42:10,968 INFO L168 Benchmark]: Boogie Preprocessor took 55.30 ms. Allocated memory is still 201.3 MB. Free memory was 179.9 MB in the beginning and 177.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-02 14:42:10,970 INFO L168 Benchmark]: RCFGBuilder took 365.42 ms. Allocated memory is still 201.3 MB. Free memory was 177.6 MB in the beginning and 160.8 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2019-10-02 14:42:10,970 INFO L168 Benchmark]: TraceAbstraction took 30270.93 ms. Allocated memory was 201.3 MB in the beginning and 560.5 MB in the end (delta: 359.1 MB). Free memory was 160.2 MB in the beginning and 279.6 MB in the end (delta: -119.4 MB). Peak memory consumption was 239.8 MB. Max. memory is 7.1 GB. [2019-10-02 14:42:10,977 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 136.8 MB. Free memory was 105.4 MB in the beginning and 105.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 371.77 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 87.3 MB in the beginning and 179.9 MB in the end (delta: -92.6 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 55.30 ms. Allocated memory is still 201.3 MB. Free memory was 179.9 MB in the beginning and 177.6 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 365.42 ms. Allocated memory is still 201.3 MB. Free memory was 177.6 MB in the beginning and 160.8 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 30270.93 ms. Allocated memory was 201.3 MB in the beginning and 560.5 MB in the end (delta: 359.1 MB). Free memory was 160.2 MB in the beginning and 279.6 MB in the end (delta: -119.4 MB). Peak memory consumption was 239.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...