java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_password_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:26:47,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:26:47,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:26:47,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:26:47,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:26:47,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:26:47,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:26:47,798 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:26:47,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:26:47,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:26:47,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:26:47,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:26:47,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:26:47,804 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:26:47,805 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:26:47,807 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:26:47,807 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:26:47,808 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:26:47,810 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:26:47,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:26:47,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:26:47,815 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:26:47,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:26:47,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:26:47,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:26:47,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:26:47,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:26:47,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:26:47,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:26:47,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:26:47,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:26:47,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:26:47,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:26:47,825 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:26:47,826 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:26:47,826 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:26:47,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:26:47,827 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:26:47,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:26:47,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:26:47,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:26:47,830 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-01 23:26:47,845 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:26:47,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:26:47,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:26:47,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:26:47,848 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:26:47,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:26:47,848 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:26:47,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:26:47,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:26:47,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:26:47,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:26:47,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:26:47,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:26:47,849 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:26:47,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:26:47,850 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:26:47,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:26:47,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:26:47,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:26:47,851 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:26:47,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:26:47,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:26:47,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:26:47,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:26:47,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:26:47,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:26:47,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:26:47,852 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:26:47,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:26:47,883 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:26:47,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:26:47,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:26:47,902 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:26:47,902 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:26:47,903 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_password_ground.i [2019-10-01 23:26:47,968 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3253452/b226ac04678c4123b53f994c66cadbba/FLAG276e24a25 [2019-10-01 23:26:48,424 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:26:48,425 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_password_ground.i [2019-10-01 23:26:48,432 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3253452/b226ac04678c4123b53f994c66cadbba/FLAG276e24a25 [2019-10-01 23:26:48,833 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a3253452/b226ac04678c4123b53f994c66cadbba [2019-10-01 23:26:48,846 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:26:48,848 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:26:48,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:26:48,849 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:26:48,853 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:26:48,854 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:26:48" (1/1) ... [2019-10-01 23:26:48,858 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60c0ec67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:48, skipping insertion in model container [2019-10-01 23:26:48,859 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:26:48" (1/1) ... [2019-10-01 23:26:48,868 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:26:48,889 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:26:49,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:26:49,127 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:26:49,148 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:26:49,166 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:26:49,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:49 WrapperNode [2019-10-01 23:26:49,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:26:49,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:26:49,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:26:49,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:26:49,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:49" (1/1) ... [2019-10-01 23:26:49,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:49" (1/1) ... [2019-10-01 23:26:49,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:49" (1/1) ... [2019-10-01 23:26:49,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:49" (1/1) ... [2019-10-01 23:26:49,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:49" (1/1) ... [2019-10-01 23:26:49,295 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:49" (1/1) ... [2019-10-01 23:26:49,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:49" (1/1) ... [2019-10-01 23:26:49,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:26:49,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:26:49,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:26:49,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:26:49,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:26:49,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:26:49,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:26:49,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:26:49,366 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:26:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:26:49,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:26:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:26:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:26:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:26:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:26:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:26:49,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:26:49,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:26:49,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:26:49,654 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:26:49,654 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 23:26:49,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:26:49 BoogieIcfgContainer [2019-10-01 23:26:49,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:26:49,658 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:26:49,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:26:49,676 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:26:49,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:26:48" (1/3) ... [2019-10-01 23:26:49,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6995d91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:26:49, skipping insertion in model container [2019-10-01 23:26:49,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:49" (2/3) ... [2019-10-01 23:26:49,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6995d91d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:26:49, skipping insertion in model container [2019-10-01 23:26:49,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:26:49" (3/3) ... [2019-10-01 23:26:49,686 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_password_ground.i [2019-10-01 23:26:49,715 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:26:49,727 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:26:49,756 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:26:49,787 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:26:49,788 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:26:49,788 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:26:49,788 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:26:49,789 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:26:49,789 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:26:49,789 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:26:49,789 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:26:49,789 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:26:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-10-01 23:26:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:26:49,814 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:49,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:49,817 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:49,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:49,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1554617121, now seen corresponding path program 1 times [2019-10-01 23:26:49,824 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:49,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:49,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:49,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:49,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:49,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:26:49,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:26:49,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:26:49,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:26:49,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:26:49,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:26:49,984 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-10-01 23:26:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:50,006 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2019-10-01 23:26:50,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:26:50,007 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-01 23:26:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:50,016 INFO L225 Difference]: With dead ends: 48 [2019-10-01 23:26:50,017 INFO L226 Difference]: Without dead ends: 23 [2019-10-01 23:26:50,020 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:26:50,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-01 23:26:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-01 23:26:50,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-01 23:26:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-10-01 23:26:50,063 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2019-10-01 23:26:50,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:50,064 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-10-01 23:26:50,064 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:26:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-10-01 23:26:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:26:50,065 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:50,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:50,066 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:50,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:50,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1658163888, now seen corresponding path program 1 times [2019-10-01 23:26:50,067 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:50,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:50,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:50,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:50,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:50,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:26:50,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:26:50,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:26:50,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:26:50,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:26:50,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:26:50,127 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 3 states. [2019-10-01 23:26:50,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:50,165 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2019-10-01 23:26:50,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:26:50,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-01 23:26:50,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:50,167 INFO L225 Difference]: With dead ends: 43 [2019-10-01 23:26:50,167 INFO L226 Difference]: Without dead ends: 28 [2019-10-01 23:26:50,169 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:26:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-01 23:26:50,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2019-10-01 23:26:50,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-01 23:26:50,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-10-01 23:26:50,176 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 15 [2019-10-01 23:26:50,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:50,177 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-10-01 23:26:50,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:26:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-10-01 23:26:50,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-01 23:26:50,178 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:50,179 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:50,179 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:50,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:50,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1238952957, now seen corresponding path program 1 times [2019-10-01 23:26:50,180 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:50,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:50,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:50,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:50,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:26:50,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:50,317 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:50,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:50,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:26:50,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:26:50,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:50,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:26:50,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:26:50,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:26:50,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:26:50,499 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-10-01 23:26:50,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:50,572 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2019-10-01 23:26:50,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:26:50,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-01 23:26:50,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:50,573 INFO L225 Difference]: With dead ends: 49 [2019-10-01 23:26:50,574 INFO L226 Difference]: Without dead ends: 33 [2019-10-01 23:26:50,574 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:26:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-01 23:26:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-10-01 23:26:50,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-01 23:26:50,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2019-10-01 23:26:50,581 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 20 [2019-10-01 23:26:50,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:50,582 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2019-10-01 23:26:50,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:26:50,582 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2019-10-01 23:26:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-01 23:26:50,583 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:50,583 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:50,584 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:50,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1418090540, now seen corresponding path program 2 times [2019-10-01 23:26:50,584 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:50,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:50,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:50,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:50,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:50,695 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 23:26:50,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:50,696 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:26:50,733 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:50,776 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:26:50,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:50,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:26:50,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:50,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-10-01 23:26:50,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:50,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 23:26:50,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:26:50,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:26:50,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:26:50,802 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2019-10-01 23:26:50,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:50,872 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2019-10-01 23:26:50,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:26:50,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-10-01 23:26:50,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:50,874 INFO L225 Difference]: With dead ends: 57 [2019-10-01 23:26:50,874 INFO L226 Difference]: Without dead ends: 38 [2019-10-01 23:26:50,875 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:26:50,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-01 23:26:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-10-01 23:26:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-01 23:26:50,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-10-01 23:26:50,883 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 25 [2019-10-01 23:26:50,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:50,883 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-10-01 23:26:50,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:26:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-10-01 23:26:50,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-01 23:26:50,885 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:50,885 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:50,885 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:50,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:50,886 INFO L82 PathProgramCache]: Analyzing trace with hash 358687009, now seen corresponding path program 3 times [2019-10-01 23:26:50,886 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:50,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:50,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:50,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:50,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:51,044 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 23:26:51,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:51,045 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:26:51,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:51,126 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:26:51,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:51,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:26:51,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:51,299 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:51,300 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2019-10-01 23:26:51,301 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:51,304 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:51,304 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-01 23:26:51,304 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-01 23:26:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-01 23:26:51,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:51,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 14 [2019-10-01 23:26:51,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:26:51,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:26:51,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:26:51,359 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 14 states. [2019-10-01 23:26:51,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:51,840 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2019-10-01 23:26:51,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:26:51,841 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-10-01 23:26:51,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:51,849 INFO L225 Difference]: With dead ends: 91 [2019-10-01 23:26:51,850 INFO L226 Difference]: Without dead ends: 69 [2019-10-01 23:26:51,851 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=471, Unknown=0, NotChecked=0, Total=600 [2019-10-01 23:26:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-01 23:26:51,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2019-10-01 23:26:51,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-01 23:26:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-10-01 23:26:51,892 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 30 [2019-10-01 23:26:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:51,892 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-10-01 23:26:51,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:26:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-10-01 23:26:51,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-01 23:26:51,896 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:51,896 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:51,897 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:51,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:51,898 INFO L82 PathProgramCache]: Analyzing trace with hash 515609862, now seen corresponding path program 1 times [2019-10-01 23:26:51,898 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:51,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:51,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:51,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:51,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-01 23:26:51,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:26:51,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:26:51,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:26:51,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:26:51,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:26:51,999 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 3 states. [2019-10-01 23:26:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:52,014 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2019-10-01 23:26:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:26:52,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-01 23:26:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:52,022 INFO L225 Difference]: With dead ends: 68 [2019-10-01 23:26:52,023 INFO L226 Difference]: Without dead ends: 46 [2019-10-01 23:26:52,024 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:26:52,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-01 23:26:52,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-10-01 23:26:52,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-01 23:26:52,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-10-01 23:26:52,042 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 35 [2019-10-01 23:26:52,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:52,043 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-10-01 23:26:52,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:26:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-10-01 23:26:52,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-01 23:26:52,045 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:52,045 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:52,045 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1119863012, now seen corresponding path program 1 times [2019-10-01 23:26:52,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:52,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:52,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:52,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:52,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-01 23:26:52,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:52,190 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:52,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:52,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:26:52,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-01 23:26:52,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:52,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:26:52,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:26:52,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:26:52,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:26:52,292 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 8 states. [2019-10-01 23:26:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:52,376 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2019-10-01 23:26:52,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:26:52,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2019-10-01 23:26:52,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:52,380 INFO L225 Difference]: With dead ends: 85 [2019-10-01 23:26:52,380 INFO L226 Difference]: Without dead ends: 54 [2019-10-01 23:26:52,381 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:26:52,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-01 23:26:52,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-10-01 23:26:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-01 23:26:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2019-10-01 23:26:52,390 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 43 [2019-10-01 23:26:52,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:52,390 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2019-10-01 23:26:52,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:26:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2019-10-01 23:26:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-01 23:26:52,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:52,403 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:52,403 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:52,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:52,404 INFO L82 PathProgramCache]: Analyzing trace with hash 875136345, now seen corresponding path program 2 times [2019-10-01 23:26:52,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:52,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:52,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:52,543 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-01 23:26:52,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:52,543 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:52,571 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:26:52,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:26:52,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:52,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:26:52,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-01 23:26:52,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:52,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 23:26:52,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:26:52,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:26:52,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:26:52,655 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 9 states. [2019-10-01 23:26:52,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:52,719 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2019-10-01 23:26:52,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:26:52,720 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 48 [2019-10-01 23:26:52,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:52,721 INFO L225 Difference]: With dead ends: 93 [2019-10-01 23:26:52,721 INFO L226 Difference]: Without dead ends: 59 [2019-10-01 23:26:52,722 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 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-01 23:26:52,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-01 23:26:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-10-01 23:26:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-10-01 23:26:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-10-01 23:26:52,730 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 48 [2019-10-01 23:26:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:52,731 INFO L475 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-10-01 23:26:52,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:26:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-10-01 23:26:52,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-01 23:26:52,732 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:52,732 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:52,733 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:52,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:52,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1037062664, now seen corresponding path program 3 times [2019-10-01 23:26:52,733 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:52,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:52,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:52,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:52,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:52,823 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-01 23:26:52,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:52,824 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:52,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:26:52,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-01 23:26:52,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:52,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:26:52,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:53,096 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:53,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2019-10-01 23:26:53,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:53,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:53,101 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-01 23:26:53,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-01 23:26:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-10-01 23:26:53,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:53,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 19 [2019-10-01 23:26:53,169 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:26:53,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:26:53,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:26:53,172 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 19 states. [2019-10-01 23:26:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:53,808 INFO L93 Difference]: Finished difference Result 111 states and 117 transitions. [2019-10-01 23:26:53,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:26:53,809 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2019-10-01 23:26:53,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:53,810 INFO L225 Difference]: With dead ends: 111 [2019-10-01 23:26:53,810 INFO L226 Difference]: Without dead ends: 74 [2019-10-01 23:26:53,811 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=949, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:26:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-01 23:26:53,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 69. [2019-10-01 23:26:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-01 23:26:53,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2019-10-01 23:26:53,819 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 53 [2019-10-01 23:26:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:53,820 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2019-10-01 23:26:53,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:26:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2019-10-01 23:26:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-01 23:26:53,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:53,821 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:53,822 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:53,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:53,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1707343249, now seen corresponding path program 4 times [2019-10-01 23:26:53,822 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:53,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:53,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 4 proven. 70 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-01 23:26:53,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:53,915 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-01 23:26:53,941 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:53,981 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:26:53,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:53,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:26:53,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:54,007 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:26:54,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:54,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:26:54,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:26:54,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:26:54,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:26:54,017 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 11 states. [2019-10-01 23:26:54,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:54,098 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2019-10-01 23:26:54,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:26:54,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-10-01 23:26:54,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:54,100 INFO L225 Difference]: With dead ends: 125 [2019-10-01 23:26:54,100 INFO L226 Difference]: Without dead ends: 77 [2019-10-01 23:26:54,101 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:26:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-01 23:26:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2019-10-01 23:26:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-01 23:26:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-10-01 23:26:54,110 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 66 [2019-10-01 23:26:54,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:54,110 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-10-01 23:26:54,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:26:54,110 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-10-01 23:26:54,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-01 23:26:54,112 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:54,112 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:54,112 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:54,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:54,112 INFO L82 PathProgramCache]: Analyzing trace with hash 130026728, now seen corresponding path program 5 times [2019-10-01 23:26:54,112 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:54,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:54,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:54,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:54,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:54,213 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 4 proven. 92 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-01 23:26:54,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:54,214 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:54,241 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:26:54,637 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-10-01 23:26:54,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:54,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:26:54,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-01 23:26:54,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:54,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 23:26:54,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:26:54,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:26:54,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:26:54,704 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 12 states. [2019-10-01 23:26:54,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:54,806 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-10-01 23:26:54,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:26:54,807 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-10-01 23:26:54,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:54,808 INFO L225 Difference]: With dead ends: 133 [2019-10-01 23:26:54,808 INFO L226 Difference]: Without dead ends: 82 [2019-10-01 23:26:54,809 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:26:54,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-01 23:26:54,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-10-01 23:26:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-10-01 23:26:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2019-10-01 23:26:54,817 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 71 [2019-10-01 23:26:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:54,818 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2019-10-01 23:26:54,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:26:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2019-10-01 23:26:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-01 23:26:54,819 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:54,819 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:54,820 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:54,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:54,820 INFO L82 PathProgramCache]: Analyzing trace with hash 556989109, now seen corresponding path program 6 times [2019-10-01 23:26:54,820 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:54,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:54,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:54,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:54,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 4 proven. 117 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-01 23:26:54,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:54,928 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:54,947 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:26:55,136 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2019-10-01 23:26:55,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:55,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-01 23:26:55,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:55,517 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:55,518 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2019-10-01 23:26:55,518 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:55,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:55,521 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-01 23:26:55,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-01 23:26:55,581 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 4 proven. 68 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-01 23:26:55,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:55,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2019-10-01 23:26:55,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:26:55,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:26:55,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:26:55,587 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 24 states. [2019-10-01 23:26:56,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:56,574 INFO L93 Difference]: Finished difference Result 151 states and 157 transitions. [2019-10-01 23:26:56,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:26:56,574 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2019-10-01 23:26:56,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:56,575 INFO L225 Difference]: With dead ends: 151 [2019-10-01 23:26:56,575 INFO L226 Difference]: Without dead ends: 97 [2019-10-01 23:26:56,576 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=391, Invalid=1589, Unknown=0, NotChecked=0, Total=1980 [2019-10-01 23:26:56,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-01 23:26:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2019-10-01 23:26:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-10-01 23:26:56,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2019-10-01 23:26:56,588 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 76 [2019-10-01 23:26:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:56,589 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2019-10-01 23:26:56,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:26:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2019-10-01 23:26:56,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-01 23:26:56,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:56,591 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:56,591 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:56,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:56,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1762177064, now seen corresponding path program 7 times [2019-10-01 23:26:56,592 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:56,593 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:56,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:56,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:56,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 6 proven. 100 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-10-01 23:26:56,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:56,744 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-10-01 23:26:56,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:56,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:56,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:26:56,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:56,855 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-10-01 23:26:56,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:56,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:26:56,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:26:56,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:26:56,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:26:56,869 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 14 states. [2019-10-01 23:26:56,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:56,966 INFO L93 Difference]: Finished difference Result 165 states and 170 transitions. [2019-10-01 23:26:56,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:26:56,966 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 89 [2019-10-01 23:26:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:56,967 INFO L225 Difference]: With dead ends: 165 [2019-10-01 23:26:56,968 INFO L226 Difference]: Without dead ends: 100 [2019-10-01 23:26:56,968 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:26:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-01 23:26:56,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-10-01 23:26:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-10-01 23:26:56,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2019-10-01 23:26:56,977 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 89 [2019-10-01 23:26:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:56,977 INFO L475 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2019-10-01 23:26:56,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:26:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2019-10-01 23:26:56,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-01 23:26:56,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:56,979 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:56,979 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:56,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:56,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1125903635, now seen corresponding path program 8 times [2019-10-01 23:26:56,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:56,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:56,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:56,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:56,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 6 proven. 121 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2019-10-01 23:26:57,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:57,132 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:57,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:26:57,213 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:26:57,213 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:57,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:26:57,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:26:57,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:57,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 23:26:57,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:26:57,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:26:57,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:26:57,268 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 15 states. [2019-10-01 23:26:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:57,366 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2019-10-01 23:26:57,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:26:57,367 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2019-10-01 23:26:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:57,368 INFO L225 Difference]: With dead ends: 173 [2019-10-01 23:26:57,368 INFO L226 Difference]: Without dead ends: 105 [2019-10-01 23:26:57,369 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:26:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-01 23:26:57,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-10-01 23:26:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-01 23:26:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-10-01 23:26:57,377 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 94 [2019-10-01 23:26:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:57,377 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-10-01 23:26:57,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:26:57,378 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-10-01 23:26:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-01 23:26:57,379 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:57,379 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:57,379 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:57,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1552689484, now seen corresponding path program 9 times [2019-10-01 23:26:57,380 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:57,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:57,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:57,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:57,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 6 proven. 144 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-01 23:26:57,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:57,521 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:57,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:26:57,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-10-01 23:26:57,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:57,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 23:26:57,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:58,241 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:58,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2019-10-01 23:26:58,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:58,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:58,244 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-01 23:26:58,244 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-01 23:26:58,327 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-10-01 23:26:58,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:58,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-10-01 23:26:58,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:26:58,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:26:58,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=627, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:26:58,334 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 29 states. [2019-10-01 23:26:59,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:59,552 INFO L93 Difference]: Finished difference Result 191 states and 197 transitions. [2019-10-01 23:26:59,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 23:26:59,553 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 99 [2019-10-01 23:26:59,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:59,554 INFO L225 Difference]: With dead ends: 191 [2019-10-01 23:26:59,555 INFO L226 Difference]: Without dead ends: 120 [2019-10-01 23:26:59,557 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 83 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=579, Invalid=2391, Unknown=0, NotChecked=0, Total=2970 [2019-10-01 23:26:59,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-10-01 23:26:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2019-10-01 23:26:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-01 23:26:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-10-01 23:26:59,565 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 99 [2019-10-01 23:26:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:59,565 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-10-01 23:26:59,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:26:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-10-01 23:26:59,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-01 23:26:59,566 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:59,567 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:59,567 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:59,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:59,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1018298587, now seen corresponding path program 10 times [2019-10-01 23:26:59,567 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:59,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:59,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:59,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:59,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:59,766 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 8 proven. 169 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-10-01 23:26:59,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:59,767 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:59,805 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:26:59,878 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:26:59,878 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:59,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:26:59,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-10-01 23:26:59,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:59,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:26:59,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:26:59,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:26:59,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:26:59,930 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 17 states. [2019-10-01 23:27:00,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:00,094 INFO L93 Difference]: Finished difference Result 205 states and 210 transitions. [2019-10-01 23:27:00,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:27:00,094 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2019-10-01 23:27:00,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:00,096 INFO L225 Difference]: With dead ends: 205 [2019-10-01 23:27:00,096 INFO L226 Difference]: Without dead ends: 123 [2019-10-01 23:27:00,098 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:27:00,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-10-01 23:27:00,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2019-10-01 23:27:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-10-01 23:27:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2019-10-01 23:27:00,109 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 112 [2019-10-01 23:27:00,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:00,111 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2019-10-01 23:27:00,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:27:00,112 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2019-10-01 23:27:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-01 23:27:00,113 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:00,113 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:00,113 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:00,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:00,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1682959964, now seen corresponding path program 11 times [2019-10-01 23:27:00,114 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:00,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:00,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:00,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:00,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:00,344 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 8 proven. 196 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2019-10-01 23:27:00,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:00,344 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:00,373 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:27:04,711 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-10-01 23:27:04,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:04,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:27:04,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-10-01 23:27:04,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:04,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 23:27:04,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:27:04,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:27:04,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:27:04,753 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 18 states. [2019-10-01 23:27:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:04,880 INFO L93 Difference]: Finished difference Result 213 states and 218 transitions. [2019-10-01 23:27:04,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:27:04,880 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 117 [2019-10-01 23:27:04,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:04,881 INFO L225 Difference]: With dead ends: 213 [2019-10-01 23:27:04,882 INFO L226 Difference]: Without dead ends: 128 [2019-10-01 23:27:04,882 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:27:04,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-01 23:27:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2019-10-01 23:27:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-01 23:27:04,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2019-10-01 23:27:04,891 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 117 [2019-10-01 23:27:04,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:04,892 INFO L475 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2019-10-01 23:27:04,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:27:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2019-10-01 23:27:04,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-01 23:27:04,893 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:04,893 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:04,893 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:04,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:04,894 INFO L82 PathProgramCache]: Analyzing trace with hash -876870583, now seen corresponding path program 12 times [2019-10-01 23:27:04,894 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:04,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:04,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:04,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:04,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:05,081 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 8 proven. 330 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-10-01 23:27:05,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:05,082 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:05,109 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:27:05,747 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-10-01 23:27:05,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:05,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 43 conjunts are in the unsatisfiable core [2019-10-01 23:27:05,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:06,095 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:06,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2019-10-01 23:27:06,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:06,104 INFO L567 ElimStorePlain]: treesize reduction 9, result has 25.0 percent of original size [2019-10-01 23:27:06,104 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-01 23:27:06,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-01 23:27:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 8 proven. 207 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-10-01 23:27:06,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:06,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-10-01 23:27:06,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-01 23:27:06,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-01 23:27:06,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=860, Unknown=0, NotChecked=0, Total=1122 [2019-10-01 23:27:06,206 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 34 states. [2019-10-01 23:27:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:07,871 INFO L93 Difference]: Finished difference Result 231 states and 237 transitions. [2019-10-01 23:27:07,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 23:27:07,871 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 122 [2019-10-01 23:27:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:07,873 INFO L225 Difference]: With dead ends: 231 [2019-10-01 23:27:07,873 INFO L226 Difference]: Without dead ends: 143 [2019-10-01 23:27:07,875 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 103 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=805, Invalid=3355, Unknown=0, NotChecked=0, Total=4160 [2019-10-01 23:27:07,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-01 23:27:07,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 138. [2019-10-01 23:27:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-01 23:27:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2019-10-01 23:27:07,883 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 122 [2019-10-01 23:27:07,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:07,883 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2019-10-01 23:27:07,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-01 23:27:07,883 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2019-10-01 23:27:07,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-01 23:27:07,885 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:07,885 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:07,885 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:07,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:07,886 INFO L82 PathProgramCache]: Analyzing trace with hash -33787756, now seen corresponding path program 13 times [2019-10-01 23:27:07,886 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:07,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:07,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:07,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:07,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-10-01 23:27:08,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:08,089 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:08,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:08,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:27:08,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2019-10-01 23:27:08,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:08,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:27:08,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:27:08,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:27:08,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:27:08,215 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 20 states. [2019-10-01 23:27:08,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:08,357 INFO L93 Difference]: Finished difference Result 245 states and 250 transitions. [2019-10-01 23:27:08,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:27:08,358 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 135 [2019-10-01 23:27:08,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:08,359 INFO L225 Difference]: With dead ends: 245 [2019-10-01 23:27:08,360 INFO L226 Difference]: Without dead ends: 146 [2019-10-01 23:27:08,360 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:27:08,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-01 23:27:08,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2019-10-01 23:27:08,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-10-01 23:27:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-10-01 23:27:08,369 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-10-01 23:27:08,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:08,370 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-10-01 23:27:08,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:27:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-10-01 23:27:08,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-01 23:27:08,371 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:08,372 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:08,372 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:08,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:08,372 INFO L82 PathProgramCache]: Analyzing trace with hash 578687105, now seen corresponding path program 14 times [2019-10-01 23:27:08,372 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:08,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:08,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:08,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:08,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:08,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:08,632 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 10 proven. 425 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-10-01 23:27:08,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:08,633 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:08,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:27:08,748 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:27:08,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:08,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:27:08,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-10-01 23:27:08,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:08,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:27:08,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:27:08,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:27:08,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:27:08,796 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 21 states. [2019-10-01 23:27:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:08,932 INFO L93 Difference]: Finished difference Result 253 states and 258 transitions. [2019-10-01 23:27:08,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:27:08,932 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 140 [2019-10-01 23:27:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:08,933 INFO L225 Difference]: With dead ends: 253 [2019-10-01 23:27:08,933 INFO L226 Difference]: Without dead ends: 151 [2019-10-01 23:27:08,934 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:27:08,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-10-01 23:27:08,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2019-10-01 23:27:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-10-01 23:27:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2019-10-01 23:27:08,941 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 140 [2019-10-01 23:27:08,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:08,941 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2019-10-01 23:27:08,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:27:08,941 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2019-10-01 23:27:08,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-01 23:27:08,942 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:08,943 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:08,943 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:08,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:08,943 INFO L82 PathProgramCache]: Analyzing trace with hash -529674384, now seen corresponding path program 15 times [2019-10-01 23:27:08,943 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:08,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:08,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:08,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:08,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 10 proven. 477 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2019-10-01 23:27:09,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:09,210 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:09,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:27:11,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-10-01 23:27:11,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:11,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 23:27:11,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:11,550 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:11,551 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2019-10-01 23:27:11,552 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:11,559 INFO L567 ElimStorePlain]: treesize reduction 9, result has 25.0 percent of original size [2019-10-01 23:27:11,559 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-01 23:27:11,560 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-01 23:27:11,771 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 10 proven. 305 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2019-10-01 23:27:11,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:11,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 39 [2019-10-01 23:27:11,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 23:27:11,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 23:27:11,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=1129, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:27:11,791 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 39 states. [2019-10-01 23:27:13,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:13,816 INFO L93 Difference]: Finished difference Result 271 states and 277 transitions. [2019-10-01 23:27:13,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-01 23:27:13,817 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 145 [2019-10-01 23:27:13,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:13,819 INFO L225 Difference]: With dead ends: 271 [2019-10-01 23:27:13,821 INFO L226 Difference]: Without dead ends: 166 [2019-10-01 23:27:13,824 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 123 SyntacticMatches, 5 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1069, Invalid=4481, Unknown=0, NotChecked=0, Total=5550 [2019-10-01 23:27:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-10-01 23:27:13,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 161. [2019-10-01 23:27:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-01 23:27:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-10-01 23:27:13,837 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 145 [2019-10-01 23:27:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:13,837 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-10-01 23:27:13,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 23:27:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-10-01 23:27:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-01 23:27:13,839 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:13,839 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:13,839 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:13,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1725935801, now seen corresponding path program 16 times [2019-10-01 23:27:13,840 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:13,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:13,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:13,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:13,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:14,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 12 proven. 361 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2019-10-01 23:27:14,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:14,204 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:14,236 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:27:14,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:27:14,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:14,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:27:14,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:14,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-10-01 23:27:14,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:14,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:27:14,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:27:14,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:27:14,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:27:14,353 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 23 states. [2019-10-01 23:27:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:14,527 INFO L93 Difference]: Finished difference Result 285 states and 290 transitions. [2019-10-01 23:27:14,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:27:14,528 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 158 [2019-10-01 23:27:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:14,530 INFO L225 Difference]: With dead ends: 285 [2019-10-01 23:27:14,530 INFO L226 Difference]: Without dead ends: 169 [2019-10-01 23:27:14,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:27:14,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-10-01 23:27:14,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-10-01 23:27:14,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-01 23:27:14,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2019-10-01 23:27:14,540 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 158 [2019-10-01 23:27:14,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:14,540 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2019-10-01 23:27:14,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:27:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2019-10-01 23:27:14,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-01 23:27:14,542 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:14,542 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:14,542 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:14,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:14,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1783781792, now seen corresponding path program 17 times [2019-10-01 23:27:14,542 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:14,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:14,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:14,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:14,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 12 proven. 400 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2019-10-01 23:27:14,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:14,874 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:14,934 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:27:44,523 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-10-01 23:27:44,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:44,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:27:44,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:44,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2019-10-01 23:27:44,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:44,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:27:44,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:27:44,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:27:44,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:27:44,631 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 24 states. [2019-10-01 23:27:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:44,792 INFO L93 Difference]: Finished difference Result 293 states and 298 transitions. [2019-10-01 23:27:44,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:27:44,792 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 163 [2019-10-01 23:27:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:44,794 INFO L225 Difference]: With dead ends: 293 [2019-10-01 23:27:44,794 INFO L226 Difference]: Without dead ends: 174 [2019-10-01 23:27:44,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:27:44,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-10-01 23:27:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-10-01 23:27:44,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-01 23:27:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-10-01 23:27:44,804 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 163 [2019-10-01 23:27:44,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:44,805 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-10-01 23:27:44,805 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:27:44,805 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-10-01 23:27:44,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-01 23:27:44,806 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:44,806 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:44,807 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:44,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:44,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1151009315, now seen corresponding path program 18 times [2019-10-01 23:27:44,807 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:44,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:44,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:44,809 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:44,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 12 proven. 441 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2019-10-01 23:27:45,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:45,301 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:45,365 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:27:56,267 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-10-01 23:27:56,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:56,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 51 conjunts are in the unsatisfiable core [2019-10-01 23:27:56,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:56,738 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:56,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2019-10-01 23:27:56,739 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:56,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:56,741 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-01 23:27:56,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-01 23:27:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 12 proven. 422 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2019-10-01 23:27:56,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:56,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 44 [2019-10-01 23:27:56,909 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-10-01 23:27:56,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-10-01 23:27:56,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=458, Invalid=1434, Unknown=0, NotChecked=0, Total=1892 [2019-10-01 23:27:56,910 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 44 states. [2019-10-01 23:27:59,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:59,422 INFO L93 Difference]: Finished difference Result 311 states and 317 transitions. [2019-10-01 23:27:59,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-10-01 23:27:59,423 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 168 [2019-10-01 23:27:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:59,425 INFO L225 Difference]: With dead ends: 311 [2019-10-01 23:27:59,425 INFO L226 Difference]: Without dead ends: 189 [2019-10-01 23:27:59,427 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 143 SyntacticMatches, 6 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1732 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1371, Invalid=5769, Unknown=0, NotChecked=0, Total=7140 [2019-10-01 23:27:59,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-10-01 23:27:59,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 184. [2019-10-01 23:27:59,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-10-01 23:27:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 186 transitions. [2019-10-01 23:27:59,437 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 186 transitions. Word has length 168 [2019-10-01 23:27:59,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:59,437 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 186 transitions. [2019-10-01 23:27:59,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-10-01 23:27:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 186 transitions. [2019-10-01 23:27:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-01 23:27:59,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:59,439 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:59,439 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:59,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:59,439 INFO L82 PathProgramCache]: Analyzing trace with hash 73851216, now seen corresponding path program 19 times [2019-10-01 23:27:59,440 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:59,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:59,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:59,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:59,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 14 proven. 484 refuted. 0 times theorem prover too weak. 897 trivial. 0 not checked. [2019-10-01 23:27:59,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:59,854 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:59,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:28:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:00,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:28:00,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:00,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 911 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (23)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:28:00,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:00,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:28:00,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:28:00,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:28:00,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:28:00,143 INFO L87 Difference]: Start difference. First operand 184 states and 186 transitions. Second operand 26 states. [2019-10-01 23:28:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:00,406 INFO L93 Difference]: Finished difference Result 325 states and 330 transitions. [2019-10-01 23:28:00,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:28:00,407 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 181 [2019-10-01 23:28:00,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:00,408 INFO L225 Difference]: With dead ends: 325 [2019-10-01 23:28:00,408 INFO L226 Difference]: Without dead ends: 192 [2019-10-01 23:28:00,410 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:28:00,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-10-01 23:28:00,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 189. [2019-10-01 23:28:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-10-01 23:28:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 191 transitions. [2019-10-01 23:28:00,425 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 191 transitions. Word has length 181 [2019-10-01 23:28:00,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:00,426 INFO L475 AbstractCegarLoop]: Abstraction has 189 states and 191 transitions. [2019-10-01 23:28:00,426 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:28:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 191 transitions. [2019-10-01 23:28:00,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-01 23:28:00,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:00,430 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:00,430 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:00,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:00,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1688223253, now seen corresponding path program 20 times [2019-10-01 23:28:00,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:00,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:00,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:28:00,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:01,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1507 backedges. 14 proven. 529 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2019-10-01 23:28:01,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:01,046 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:01,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:28:01,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:28:01,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:01,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:28:01,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1507 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 978 trivial. 0 not checked. [2019-10-01 23:28:01,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:01,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:28:01,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:28:01,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:28:01,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:28:01,239 INFO L87 Difference]: Start difference. First operand 189 states and 191 transitions. Second operand 27 states. [2019-10-01 23:28:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:01,434 INFO L93 Difference]: Finished difference Result 333 states and 338 transitions. [2019-10-01 23:28:01,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:28:01,435 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 186 [2019-10-01 23:28:01,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:01,436 INFO L225 Difference]: With dead ends: 333 [2019-10-01 23:28:01,436 INFO L226 Difference]: Without dead ends: 197 [2019-10-01 23:28:01,437 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:28:01,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-10-01 23:28:01,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2019-10-01 23:28:01,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-01 23:28:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 196 transitions. [2019-10-01 23:28:01,448 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 196 transitions. Word has length 186 [2019-10-01 23:28:01,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:01,449 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 196 transitions. [2019-10-01 23:28:01,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:28:01,449 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 196 transitions. [2019-10-01 23:28:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-01 23:28:01,450 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:01,450 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:01,451 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:01,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:01,451 INFO L82 PathProgramCache]: Analyzing trace with hash -147531732, now seen corresponding path program 21 times [2019-10-01 23:28:01,451 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:01,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:01,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:01,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:01,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 14 proven. 576 refuted. 0 times theorem prover too weak. 1034 trivial. 0 not checked. [2019-10-01 23:28:01,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:01,979 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:02,034 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:28:16,233 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-10-01 23:28:16,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:16,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-01 23:28:16,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:16,785 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:28:16,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2019-10-01 23:28:16,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:16,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:28:16,789 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-01 23:28:16,789 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-01 23:28:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 14 proven. 558 refuted. 0 times theorem prover too weak. 1052 trivial. 0 not checked. [2019-10-01 23:28:16,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:16,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24] total 49 [2019-10-01 23:28:16,992 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-01 23:28:16,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-01 23:28:16,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=1775, Unknown=0, NotChecked=0, Total=2352 [2019-10-01 23:28:16,995 INFO L87 Difference]: Start difference. First operand 194 states and 196 transitions. Second operand 49 states. [2019-10-01 23:28:20,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:20,074 INFO L93 Difference]: Finished difference Result 351 states and 357 transitions. [2019-10-01 23:28:20,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-01 23:28:20,075 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 191 [2019-10-01 23:28:20,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:20,076 INFO L225 Difference]: With dead ends: 351 [2019-10-01 23:28:20,076 INFO L226 Difference]: Without dead ends: 212 [2019-10-01 23:28:20,080 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 163 SyntacticMatches, 7 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2197 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1711, Invalid=7219, Unknown=0, NotChecked=0, Total=8930 [2019-10-01 23:28:20,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-01 23:28:20,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 207. [2019-10-01 23:28:20,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-10-01 23:28:20,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 209 transitions. [2019-10-01 23:28:20,090 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 209 transitions. Word has length 191 [2019-10-01 23:28:20,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:20,091 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 209 transitions. [2019-10-01 23:28:20,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-01 23:28:20,091 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 209 transitions. [2019-10-01 23:28:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-01 23:28:20,092 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:20,092 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:20,093 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:20,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:20,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1251880371, now seen corresponding path program 22 times [2019-10-01 23:28:20,093 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:20,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:20,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:20,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:20,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:20,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 16 proven. 625 refuted. 0 times theorem prover too weak. 1165 trivial. 0 not checked. [2019-10-01 23:28:20,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:20,594 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:20,661 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:28:20,799 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:28:20,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:20,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:28:20,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:20,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 1181 trivial. 0 not checked. [2019-10-01 23:28:20,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:20,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:28:20,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:28:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:28:20,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:28:20,873 INFO L87 Difference]: Start difference. First operand 207 states and 209 transitions. Second operand 29 states. [2019-10-01 23:28:21,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:21,084 INFO L93 Difference]: Finished difference Result 365 states and 370 transitions. [2019-10-01 23:28:21,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:28:21,085 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 204 [2019-10-01 23:28:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:21,087 INFO L225 Difference]: With dead ends: 365 [2019-10-01 23:28:21,087 INFO L226 Difference]: Without dead ends: 215 [2019-10-01 23:28:21,088 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:28:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-10-01 23:28:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-10-01 23:28:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-01 23:28:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 214 transitions. [2019-10-01 23:28:21,100 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 214 transitions. Word has length 204 [2019-10-01 23:28:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:21,100 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 214 transitions. [2019-10-01 23:28:21,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:28:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 214 transitions. [2019-10-01 23:28:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-01 23:28:21,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:21,103 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:21,103 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:21,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:21,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1466954980, now seen corresponding path program 23 times [2019-10-01 23:28:21,104 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:21,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:21,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:21,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:21,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 16 proven. 676 refuted. 0 times theorem prover too weak. 1241 trivial. 0 not checked. [2019-10-01 23:28:21,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:21,534 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:21,586 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:29:34,904 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2019-10-01 23:29:34,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:29:34,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:29:34,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:29:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2019-10-01 23:29:35,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:29:35,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:29:35,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:29:35,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:29:35,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:29:35,080 INFO L87 Difference]: Start difference. First operand 212 states and 214 transitions. Second operand 30 states. [2019-10-01 23:29:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:29:35,326 INFO L93 Difference]: Finished difference Result 373 states and 378 transitions. [2019-10-01 23:29:35,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:29:35,326 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 209 [2019-10-01 23:29:35,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:29:35,330 INFO L225 Difference]: With dead ends: 373 [2019-10-01 23:29:35,331 INFO L226 Difference]: Without dead ends: 220 [2019-10-01 23:29:35,336 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:29:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-01 23:29:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2019-10-01 23:29:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-01 23:29:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-10-01 23:29:35,357 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 209 [2019-10-01 23:29:35,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:29:35,357 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-10-01 23:29:35,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:29:35,358 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-10-01 23:29:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-10-01 23:29:35,360 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:29:35,360 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:29:35,361 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:29:35,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:29:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash -619272335, now seen corresponding path program 24 times [2019-10-01 23:29:35,361 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:29:35,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:29:35,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:29:35,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:29:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:29:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:29:36,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2065 backedges. 16 proven. 729 refuted. 0 times theorem prover too weak. 1320 trivial. 0 not checked. [2019-10-01 23:29:36,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:29:36,040 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:29:36,095 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:30:12,165 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2019-10-01 23:30:12,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:12,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 59 conjunts are in the unsatisfiable core [2019-10-01 23:30:12,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:12,870 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:12,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2019-10-01 23:30:12,871 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:12,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:12,873 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-01 23:30:12,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-01 23:30:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2065 backedges. 16 proven. 713 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2019-10-01 23:30:13,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:13,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26] total 54 [2019-10-01 23:30:13,103 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-10-01 23:30:13,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-10-01 23:30:13,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=2152, Unknown=0, NotChecked=0, Total=2862 [2019-10-01 23:30:13,104 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 54 states. [2019-10-01 23:30:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:16,574 INFO L93 Difference]: Finished difference Result 391 states and 397 transitions. [2019-10-01 23:30:16,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-10-01 23:30:16,575 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 214 [2019-10-01 23:30:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:16,577 INFO L225 Difference]: With dead ends: 391 [2019-10-01 23:30:16,577 INFO L226 Difference]: Without dead ends: 235 [2019-10-01 23:30:16,581 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 183 SyntacticMatches, 8 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2717 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2089, Invalid=8831, Unknown=0, NotChecked=0, Total=10920 [2019-10-01 23:30:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-10-01 23:30:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 230. [2019-10-01 23:30:16,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-10-01 23:30:16,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 232 transitions. [2019-10-01 23:30:16,602 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 232 transitions. Word has length 214 [2019-10-01 23:30:16,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:16,602 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 232 transitions. [2019-10-01 23:30:16,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-10-01 23:30:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 232 transitions. [2019-10-01 23:30:16,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-01 23:30:16,604 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:16,604 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:16,605 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:16,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:16,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2050104820, now seen corresponding path program 25 times [2019-10-01 23:30:16,605 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:16,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:16,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:16,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:30:16,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 18 proven. 784 refuted. 0 times theorem prover too weak. 1468 trivial. 0 not checked. [2019-10-01 23:30:17,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:17,207 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:17,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:30:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:17,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 695 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:30:17,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:17,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2270 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1486 trivial. 0 not checked. [2019-10-01 23:30:17,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:17,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:30:17,424 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:30:17,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:30:17,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:30:17,426 INFO L87 Difference]: Start difference. First operand 230 states and 232 transitions. Second operand 32 states. [2019-10-01 23:30:17,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:17,667 INFO L93 Difference]: Finished difference Result 405 states and 410 transitions. [2019-10-01 23:30:17,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:30:17,668 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 227 [2019-10-01 23:30:17,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:17,669 INFO L225 Difference]: With dead ends: 405 [2019-10-01 23:30:17,670 INFO L226 Difference]: Without dead ends: 238 [2019-10-01 23:30:17,671 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:30:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2019-10-01 23:30:17,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 235. [2019-10-01 23:30:17,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-10-01 23:30:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 237 transitions. [2019-10-01 23:30:17,688 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 237 transitions. Word has length 227 [2019-10-01 23:30:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:17,688 INFO L475 AbstractCegarLoop]: Abstraction has 235 states and 237 transitions. [2019-10-01 23:30:17,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:30:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 237 transitions. [2019-10-01 23:30:17,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-10-01 23:30:17,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:17,692 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:17,693 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:17,693 INFO L82 PathProgramCache]: Analyzing trace with hash 728980393, now seen corresponding path program 26 times [2019-10-01 23:30:17,694 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:17,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:17,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:17,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:30:17,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:17,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:18,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 18 proven. 841 refuted. 0 times theorem prover too weak. 1553 trivial. 0 not checked. [2019-10-01 23:30:18,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:18,274 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:18,331 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:30:18,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:30:18,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:18,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:30:18,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2412 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1571 trivial. 0 not checked. [2019-10-01 23:30:18,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:18,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:30:18,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:30:18,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:30:18,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:30:18,512 INFO L87 Difference]: Start difference. First operand 235 states and 237 transitions. Second operand 33 states. [2019-10-01 23:30:18,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:18,736 INFO L93 Difference]: Finished difference Result 413 states and 418 transitions. [2019-10-01 23:30:18,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:30:18,737 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 232 [2019-10-01 23:30:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:18,738 INFO L225 Difference]: With dead ends: 413 [2019-10-01 23:30:18,738 INFO L226 Difference]: Without dead ends: 243 [2019-10-01 23:30:18,741 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:30:18,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-10-01 23:30:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2019-10-01 23:30:18,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-10-01 23:30:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 242 transitions. [2019-10-01 23:30:18,755 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 242 transitions. Word has length 232 [2019-10-01 23:30:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:18,756 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 242 transitions. [2019-10-01 23:30:18,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:30:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 242 transitions. [2019-10-01 23:30:18,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-01 23:30:18,758 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:18,758 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:18,759 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:18,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:18,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1264595176, now seen corresponding path program 27 times [2019-10-01 23:30:18,759 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:18,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:18,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:18,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:30:18,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2559 backedges. 18 proven. 900 refuted. 0 times theorem prover too weak. 1641 trivial. 0 not checked. [2019-10-01 23:30:19,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:19,305 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:19,363 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:30:49,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-10-01 23:30:49,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:49,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-01 23:30:49,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:50,646 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:50,646 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2019-10-01 23:30:50,647 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:50,648 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:50,649 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-01 23:30:50,649 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-01 23:30:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2559 backedges. 18 proven. 887 refuted. 0 times theorem prover too weak. 1654 trivial. 0 not checked. [2019-10-01 23:30:50,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:50,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 28] total 59 [2019-10-01 23:30:50,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-10-01 23:30:50,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-10-01 23:30:50,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=857, Invalid=2565, Unknown=0, NotChecked=0, Total=3422 [2019-10-01 23:30:50,915 INFO L87 Difference]: Start difference. First operand 240 states and 242 transitions. Second operand 59 states. [2019-10-01 23:30:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:55,145 INFO L93 Difference]: Finished difference Result 431 states and 437 transitions. [2019-10-01 23:30:55,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-10-01 23:30:55,146 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 237 [2019-10-01 23:30:55,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:55,148 INFO L225 Difference]: With dead ends: 431 [2019-10-01 23:30:55,149 INFO L226 Difference]: Without dead ends: 258 [2019-10-01 23:30:55,152 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 203 SyntacticMatches, 9 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3292 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2505, Invalid=10605, Unknown=0, NotChecked=0, Total=13110 [2019-10-01 23:30:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-10-01 23:30:55,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 253. [2019-10-01 23:30:55,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-01 23:30:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 255 transitions. [2019-10-01 23:30:55,183 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 255 transitions. Word has length 237 [2019-10-01 23:30:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:55,184 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 255 transitions. [2019-10-01 23:30:55,184 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-10-01 23:30:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 255 transitions. [2019-10-01 23:30:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-10-01 23:30:55,186 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:55,186 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:55,186 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:55,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:55,187 INFO L82 PathProgramCache]: Analyzing trace with hash 540877793, now seen corresponding path program 28 times [2019-10-01 23:30:55,187 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:55,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:55,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:55,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:30:55,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:55,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2787 backedges. 20 proven. 1426 refuted. 0 times theorem prover too weak. 1341 trivial. 0 not checked. [2019-10-01 23:30:55,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:55,766 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:55,827 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:30:55,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:30:55,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:55,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:30:55,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2787 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1826 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Stream closed [2019-10-01 23:30:56,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:56,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 23:30:56,032 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 23:30:56,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 23:30:56,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:30:56,033 INFO L87 Difference]: Start difference. First operand 253 states and 255 transitions. Second operand 35 states. [2019-10-01 23:30:56,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:56,351 INFO L93 Difference]: Finished difference Result 445 states and 450 transitions. [2019-10-01 23:30:56,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:30:56,352 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 250 [2019-10-01 23:30:56,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:56,354 INFO L225 Difference]: With dead ends: 445 [2019-10-01 23:30:56,354 INFO L226 Difference]: Without dead ends: 261 [2019-10-01 23:30:56,355 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:30:56,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-10-01 23:30:56,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 258. [2019-10-01 23:30:56,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-01 23:30:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 260 transitions. [2019-10-01 23:30:56,372 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 260 transitions. Word has length 250 [2019-10-01 23:30:56,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:56,373 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 260 transitions. [2019-10-01 23:30:56,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 23:30:56,373 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 260 transitions. [2019-10-01 23:30:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-01 23:30:56,374 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:56,375 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:56,375 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash 145653720, now seen corresponding path program 29 times [2019-10-01 23:30:56,375 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:56,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:56,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:56,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:30:56,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:56,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 20 proven. 1520 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2019-10-01 23:30:56,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:56,988 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:57,051 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:34:00,085 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-10-01 23:34:00,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:34:00,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 23:34:00,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:34:00,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [2019-10-01 23:34:00,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:34:00,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 23:34:00,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:34:00,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:34:00,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:34:00,297 INFO L87 Difference]: Start difference. First operand 258 states and 260 transitions. Second operand 36 states. [2019-10-01 23:34:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:34:00,579 INFO L93 Difference]: Finished difference Result 453 states and 458 transitions. [2019-10-01 23:34:00,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 23:34:00,579 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 255 [2019-10-01 23:34:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:34:00,581 INFO L225 Difference]: With dead ends: 453 [2019-10-01 23:34:00,581 INFO L226 Difference]: Without dead ends: 266 [2019-10-01 23:34:00,582 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:34:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-01 23:34:00,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 263. [2019-10-01 23:34:00,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-10-01 23:34:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 265 transitions. [2019-10-01 23:34:00,596 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 265 transitions. Word has length 255 [2019-10-01 23:34:00,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:34:00,597 INFO L475 AbstractCegarLoop]: Abstraction has 263 states and 265 transitions. [2019-10-01 23:34:00,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:34:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 265 transitions. [2019-10-01 23:34:00,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-01 23:34:00,599 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:34:00,599 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:34:00,599 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:34:00,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:34:00,600 INFO L82 PathProgramCache]: Analyzing trace with hash 104448261, now seen corresponding path program 30 times [2019-10-01 23:34:00,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:34:00,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:34:00,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:34:00,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:34:00,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:34:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:34:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 3106 backedges. 20 proven. 1617 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2019-10-01 23:34:01,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:34:01,514 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:34:01,591 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:36:13,516 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 32 check-sat command(s) [2019-10-01 23:36:13,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:36:13,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 67 conjunts are in the unsatisfiable core [2019-10-01 23:36:13,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:36:14,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:36:14,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2019-10-01 23:36:14,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:36:14,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:36:14,384 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-01 23:36:14,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-01 23:36:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3106 backedges. 20 proven. 1080 refuted. 0 times theorem prover too weak. 2006 trivial. 0 not checked. [2019-10-01 23:36:14,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:36:14,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 30] total 64 [2019-10-01 23:36:14,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-10-01 23:36:14,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-10-01 23:36:14,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=3014, Unknown=0, NotChecked=0, Total=4032 [2019-10-01 23:36:14,682 INFO L87 Difference]: Start difference. First operand 263 states and 265 transitions. Second operand 64 states. [2019-10-01 23:36:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:36:19,514 INFO L93 Difference]: Finished difference Result 471 states and 477 transitions. [2019-10-01 23:36:19,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-10-01 23:36:19,514 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 260 [2019-10-01 23:36:19,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:36:19,516 INFO L225 Difference]: With dead ends: 471 [2019-10-01 23:36:19,516 INFO L226 Difference]: Without dead ends: 281 [2019-10-01 23:36:19,518 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 223 SyntacticMatches, 10 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3922 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2959, Invalid=12541, Unknown=0, NotChecked=0, Total=15500 [2019-10-01 23:36:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-01 23:36:19,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 276. [2019-10-01 23:36:19,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-10-01 23:36:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-10-01 23:36:19,532 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 260 [2019-10-01 23:36:19,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:36:19,533 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-10-01 23:36:19,533 INFO L476 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-10-01 23:36:19,533 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-10-01 23:36:19,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-10-01 23:36:19,535 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:36:19,535 INFO L411 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:36:19,536 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:36:19,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:36:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash 2068361928, now seen corresponding path program 31 times [2019-10-01 23:36:19,536 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:36:19,536 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:36:19,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:19,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:36:19,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:36:20,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3357 backedges. 22 proven. 1717 refuted. 0 times theorem prover too weak. 1618 trivial. 0 not checked. [2019-10-01 23:36:20,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:36:20,401 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:36:20,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:36:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:36:20,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 36 conjunts are in the unsatisfiable core [2019-10-01 23:36:20,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:36:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3357 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 2201 trivial. 0 not checked. [2019-10-01 23:36:20,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:36:20,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-10-01 23:36:20,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-10-01 23:36:20,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-10-01 23:36:20,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:36:20,693 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 38 states. [2019-10-01 23:36:20,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:36:20,976 INFO L93 Difference]: Finished difference Result 485 states and 490 transitions. [2019-10-01 23:36:20,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-01 23:36:20,976 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 273 [2019-10-01 23:36:20,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:36:20,978 INFO L225 Difference]: With dead ends: 485 [2019-10-01 23:36:20,978 INFO L226 Difference]: Without dead ends: 284 [2019-10-01 23:36:20,979 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-10-01 23:36:20,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-10-01 23:36:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-10-01 23:36:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-10-01 23:36:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 283 transitions. [2019-10-01 23:36:20,993 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 283 transitions. Word has length 273 [2019-10-01 23:36:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:36:20,994 INFO L475 AbstractCegarLoop]: Abstraction has 281 states and 283 transitions. [2019-10-01 23:36:20,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-10-01 23:36:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 283 transitions. [2019-10-01 23:36:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-01 23:36:20,996 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:36:20,996 INFO L411 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:36:20,996 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:36:20,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:36:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1939876157, now seen corresponding path program 32 times [2019-10-01 23:36:20,997 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:36:20,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:36:20,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:20,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:36:20,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:36:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3529 backedges. 22 proven. 1820 refuted. 0 times theorem prover too weak. 1687 trivial. 0 not checked. [2019-10-01 23:36:21,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:36:21,764 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:36:21,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:36:21,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:36:21,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:36:21,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-01 23:36:22,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:36:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3529 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2019-10-01 23:36:22,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:36:22,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2019-10-01 23:36:22,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-10-01 23:36:22,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-10-01 23:36:22,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:36:22,068 INFO L87 Difference]: Start difference. First operand 281 states and 283 transitions. Second operand 39 states. [2019-10-01 23:36:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:36:22,368 INFO L93 Difference]: Finished difference Result 493 states and 498 transitions. [2019-10-01 23:36:22,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-01 23:36:22,369 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 278 [2019-10-01 23:36:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:36:22,371 INFO L225 Difference]: With dead ends: 493 [2019-10-01 23:36:22,371 INFO L226 Difference]: Without dead ends: 289 [2019-10-01 23:36:22,372 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-10-01 23:36:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-01 23:36:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-10-01 23:36:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-10-01 23:36:22,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 288 transitions. [2019-10-01 23:36:22,387 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 288 transitions. Word has length 278 [2019-10-01 23:36:22,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:36:22,387 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 288 transitions. [2019-10-01 23:36:22,387 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-10-01 23:36:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 288 transitions. [2019-10-01 23:36:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-10-01 23:36:22,389 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:36:22,389 INFO L411 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:36:22,390 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:36:22,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:36:22,390 INFO L82 PathProgramCache]: Analyzing trace with hash 2047285668, now seen corresponding path program 33 times [2019-10-01 23:36:22,390 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:36:22,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:36:22,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:22,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:36:22,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:36:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3706 backedges. 22 proven. 1926 refuted. 0 times theorem prover too weak. 1758 trivial. 0 not checked. [2019-10-01 23:36:23,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:36:23,176 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:36:23,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:37:35,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-10-01 23:37:35,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:37:35,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 71 conjunts are in the unsatisfiable core [2019-10-01 23:37:35,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:37:36,368 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:37:36,369 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 18 [2019-10-01 23:37:36,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:37:36,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:37:36,372 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-01 23:37:36,372 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-01 23:37:36,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3706 backedges. 22 proven. 1292 refuted. 0 times theorem prover too weak. 2392 trivial. 0 not checked. [2019-10-01 23:37:36,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:37:36,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 32] total 69 [2019-10-01 23:37:36,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-01 23:37:36,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-01 23:37:36,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1193, Invalid=3499, Unknown=0, NotChecked=0, Total=4692 [2019-10-01 23:37:36,707 INFO L87 Difference]: Start difference. First operand 286 states and 288 transitions. Second operand 69 states. [2019-10-01 23:37:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:37:42,193 INFO L93 Difference]: Finished difference Result 511 states and 517 transitions. [2019-10-01 23:37:42,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-01 23:37:42,193 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 283 [2019-10-01 23:37:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:37:42,195 INFO L225 Difference]: With dead ends: 511 [2019-10-01 23:37:42,196 INFO L226 Difference]: Without dead ends: 304 [2019-10-01 23:37:42,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 243 SyntacticMatches, 11 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4607 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3451, Invalid=14639, Unknown=0, NotChecked=0, Total=18090 [2019-10-01 23:37:42,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-01 23:37:42,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 299. [2019-10-01 23:37:42,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-10-01 23:37:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 301 transitions. [2019-10-01 23:37:42,213 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 301 transitions. Word has length 283 [2019-10-01 23:37:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:37:42,213 INFO L475 AbstractCegarLoop]: Abstraction has 299 states and 301 transitions. [2019-10-01 23:37:42,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-01 23:37:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 301 transitions. [2019-10-01 23:37:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-10-01 23:37:42,216 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:37:42,216 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:37:42,216 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:37:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:37:42,217 INFO L82 PathProgramCache]: Analyzing trace with hash -782604939, now seen corresponding path program 34 times [2019-10-01 23:37:42,217 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:37:42,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:37:42,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:42,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:37:42,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:37:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 24 proven. 1369 refuted. 0 times theorem prover too weak. 2587 trivial. 0 not checked. [2019-10-01 23:37:42,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:37:42,991 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:37:43,069 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:37:43,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:37:43,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:37:43,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 23:37:43,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:37:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3980 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2611 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:37:43,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:37:43,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2019-10-01 23:37:43,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-10-01 23:37:43,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-10-01 23:37:43,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:37:43,288 INFO L87 Difference]: Start difference. First operand 299 states and 301 transitions. Second operand 41 states. [2019-10-01 23:37:43,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:37:43,620 INFO L93 Difference]: Finished difference Result 525 states and 530 transitions. [2019-10-01 23:37:43,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-10-01 23:37:43,621 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 296 [2019-10-01 23:37:43,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:37:43,622 INFO L225 Difference]: With dead ends: 525 [2019-10-01 23:37:43,622 INFO L226 Difference]: Without dead ends: 307 [2019-10-01 23:37:43,623 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 296 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-10-01 23:37:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-01 23:37:43,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 304. [2019-10-01 23:37:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-10-01 23:37:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 306 transitions. [2019-10-01 23:37:43,640 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 306 transitions. Word has length 296 [2019-10-01 23:37:43,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:37:43,640 INFO L475 AbstractCegarLoop]: Abstraction has 304 states and 306 transitions. [2019-10-01 23:37:43,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-10-01 23:37:43,640 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 306 transitions. [2019-10-01 23:37:43,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-10-01 23:37:43,643 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:37:43,643 INFO L411 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:37:43,643 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:37:43,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:37:43,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1075821420, now seen corresponding path program 35 times [2019-10-01 23:37:43,644 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:37:43,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:37:43,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:43,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:37:43,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:37:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:37:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 4167 backedges. 24 proven. 1444 refuted. 0 times theorem prover too weak. 2699 trivial. 0 not checked. [2019-10-01 23:37:44,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:37:44,623 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:37:44,734 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:39:56,289 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 39 check-sat command(s) [2019-10-01 23:39:56,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:56,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 916 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-01 23:39:56,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:56,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4167 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 2020 trivial. 0 not checked. [2019-10-01 23:39:56,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:56,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2019-10-01 23:39:56,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-10-01 23:39:56,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-10-01 23:39:56,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:39:56,459 INFO L87 Difference]: Start difference. First operand 304 states and 306 transitions. Second operand 42 states. [2019-10-01 23:39:56,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:56,848 INFO L93 Difference]: Finished difference Result 533 states and 538 transitions. [2019-10-01 23:39:56,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-10-01 23:39:56,849 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 301 [2019-10-01 23:39:56,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:56,850 INFO L225 Difference]: With dead ends: 533 [2019-10-01 23:39:56,851 INFO L226 Difference]: Without dead ends: 312 [2019-10-01 23:39:56,851 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-10-01 23:39:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-10-01 23:39:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2019-10-01 23:39:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2019-10-01 23:39:56,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 311 transitions. [2019-10-01 23:39:56,870 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 311 transitions. Word has length 301 [2019-10-01 23:39:56,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:56,870 INFO L475 AbstractCegarLoop]: Abstraction has 309 states and 311 transitions. [2019-10-01 23:39:56,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-10-01 23:39:56,870 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 311 transitions. [2019-10-01 23:39:56,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-10-01 23:39:56,876 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:56,876 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:56,876 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:56,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:56,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1263072615, now seen corresponding path program 36 times [2019-10-01 23:39:56,877 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:56,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:56,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:56,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:39:56,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:57,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4359 backedges. 24 proven. 2262 refuted. 0 times theorem prover too weak. 2073 trivial. 0 not checked. [2019-10-01 23:39:57,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:57,928 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:39:58,015 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE