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_compare_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 09:29:23,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 09:29:23,909 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 09:29:23,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 09:29:23,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 09:29:23,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 09:29:23,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 09:29:23,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 09:29:23,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 09:29:23,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 09:29:23,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 09:29:23,931 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 09:29:23,931 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 09:29:23,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 09:29:23,933 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 09:29:23,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 09:29:23,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 09:29:23,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 09:29:23,938 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 09:29:23,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 09:29:23,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 09:29:23,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 09:29:23,944 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 09:29:23,945 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 09:29:23,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 09:29:23,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 09:29:23,947 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 09:29:23,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 09:29:23,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 09:29:23,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 09:29:23,950 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 09:29:23,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 09:29:23,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 09:29:23,952 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 09:29:23,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 09:29:23,954 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 09:29:23,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 09:29:23,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 09:29:23,955 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 09:29:23,956 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 09:29:23,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 09:29:23,957 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-07 09:29:23,971 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 09:29:23,972 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 09:29:23,973 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 09:29:23,973 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 09:29:23,974 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 09:29:23,974 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 09:29:23,974 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 09:29:23,974 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 09:29:23,974 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 09:29:23,975 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 09:29:23,975 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 09:29:23,975 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 09:29:23,975 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 09:29:23,975 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 09:29:23,976 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 09:29:23,976 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 09:29:23,976 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 09:29:23,976 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 09:29:23,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 09:29:23,977 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 09:29:23,977 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 09:29:23,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 09:29:23,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 09:29:23,978 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 09:29:23,978 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 09:29:23,978 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 09:29:23,978 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 09:29:23,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 09:29:23,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 09:29:24,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 09:29:24,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 09:29:24,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 09:29:24,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 09:29:24,025 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 09:29:24,026 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_compare_ground.i [2019-09-07 09:29:24,090 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5383ef948/c8673f385ddb4574a98f0d776229fda0/FLAGe966206f9 [2019-09-07 09:29:24,530 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 09:29:24,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_compare_ground.i [2019-09-07 09:29:24,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5383ef948/c8673f385ddb4574a98f0d776229fda0/FLAGe966206f9 [2019-09-07 09:29:24,926 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5383ef948/c8673f385ddb4574a98f0d776229fda0 [2019-09-07 09:29:24,935 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 09:29:24,937 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 09:29:24,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 09:29:24,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 09:29:24,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 09:29:24,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:29:24" (1/1) ... [2019-09-07 09:29:24,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a171813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:29:24, skipping insertion in model container [2019-09-07 09:29:24,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:29:24" (1/1) ... [2019-09-07 09:29:24,952 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 09:29:24,968 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 09:29:25,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:29:25,140 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 09:29:25,163 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:29:25,183 INFO L192 MainTranslator]: Completed translation [2019-09-07 09:29:25,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:29:25 WrapperNode [2019-09-07 09:29:25,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 09:29:25,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 09:29:25,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 09:29:25,185 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 09:29:25,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:29:25" (1/1) ... [2019-09-07 09:29:25,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:29:25" (1/1) ... [2019-09-07 09:29:25,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:29:25" (1/1) ... [2019-09-07 09:29:25,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:29:25" (1/1) ... [2019-09-07 09:29:25,306 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:29:25" (1/1) ... [2019-09-07 09:29:25,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:29:25" (1/1) ... [2019-09-07 09:29:25,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:29:25" (1/1) ... [2019-09-07 09:29:25,318 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 09:29:25,323 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 09:29:25,323 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 09:29:25,323 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 09:29:25,324 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:29:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 09:29:25,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 09:29:25,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 09:29:25,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 09:29:25,371 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 09:29:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 09:29:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 09:29:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 09:29:25,371 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 09:29:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 09:29:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 09:29:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 09:29:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 09:29:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 09:29:25,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 09:29:25,657 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 09:29:25,658 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-07 09:29:25,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:29:25 BoogieIcfgContainer [2019-09-07 09:29:25,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 09:29:25,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 09:29:25,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 09:29:25,665 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 09:29:25,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:29:24" (1/3) ... [2019-09-07 09:29:25,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d517c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:29:25, skipping insertion in model container [2019-09-07 09:29:25,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:29:25" (2/3) ... [2019-09-07 09:29:25,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d517c4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:29:25, skipping insertion in model container [2019-09-07 09:29:25,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:29:25" (3/3) ... [2019-09-07 09:29:25,682 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_compare_ground.i [2019-09-07 09:29:25,694 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 09:29:25,716 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 09:29:25,738 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 09:29:25,765 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 09:29:25,766 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 09:29:25,766 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 09:29:25,766 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 09:29:25,766 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 09:29:25,766 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 09:29:25,767 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 09:29:25,767 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 09:29:25,767 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 09:29:25,785 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-09-07 09:29:25,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 09:29:25,790 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:25,791 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:25,793 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:25,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:25,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1983579869, now seen corresponding path program 1 times [2019-09-07 09:29:25,800 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:25,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:25,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:25,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:25,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:29:25,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:29:25,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 09:29:25,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 09:29:25,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 09:29:25,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 09:29:25,945 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-09-07 09:29:25,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:25,966 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2019-09-07 09:29:25,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 09:29:25,967 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-09-07 09:29:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:25,974 INFO L225 Difference]: With dead ends: 48 [2019-09-07 09:29:25,974 INFO L226 Difference]: Without dead ends: 23 [2019-09-07 09:29:25,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 09:29:25,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-07 09:29:26,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-07 09:29:26,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-07 09:29:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-09-07 09:29:26,012 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 15 [2019-09-07 09:29:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:26,012 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-09-07 09:29:26,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 09:29:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2019-09-07 09:29:26,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-09-07 09:29:26,014 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:26,014 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:26,014 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:26,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:26,015 INFO L82 PathProgramCache]: Analyzing trace with hash -901393582, now seen corresponding path program 1 times [2019-09-07 09:29:26,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:26,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:26,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:26,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:26,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-07 09:29:26,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:29:26,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:29:26,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:29:26,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:29:26,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:29:26,071 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 3 states. [2019-09-07 09:29:26,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:26,105 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-09-07 09:29:26,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:29:26,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-09-07 09:29:26,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:26,107 INFO L225 Difference]: With dead ends: 40 [2019-09-07 09:29:26,108 INFO L226 Difference]: Without dead ends: 25 [2019-09-07 09:29:26,109 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:29:26,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-07 09:29:26,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-09-07 09:29:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-09-07 09:29:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2019-09-07 09:29:26,115 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2019-09-07 09:29:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:26,115 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-09-07 09:29:26,116 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:29:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2019-09-07 09:29:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 09:29:26,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:26,117 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:26,117 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:26,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:26,118 INFO L82 PathProgramCache]: Analyzing trace with hash 211155632, now seen corresponding path program 1 times [2019-09-07 09:29:26,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:26,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:26,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:26,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:26,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:29:26,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:29:26,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:29:26,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:29:26,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:29:26,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:29:26,180 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2019-09-07 09:29:26,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:26,203 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2019-09-07 09:29:26,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:29:26,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-07 09:29:26,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:26,205 INFO L225 Difference]: With dead ends: 38 [2019-09-07 09:29:26,205 INFO L226 Difference]: Without dead ends: 27 [2019-09-07 09:29:26,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:29:26,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-07 09:29:26,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-09-07 09:29:26,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-07 09:29:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-07 09:29:26,217 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 17 [2019-09-07 09:29:26,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:26,219 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-07 09:29:26,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:29:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-07 09:29:26,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-07 09:29:26,220 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:26,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:26,221 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:26,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:26,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1966133540, now seen corresponding path program 1 times [2019-09-07 09:29:26,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:26,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:26,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:26,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:26,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:29:26,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:26,306 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:26,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:26,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 09:29:26,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:29:26,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:26,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-07 09:29:26,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-07 09:29:26,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-07 09:29:26,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-07 09:29:26,429 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 5 states. [2019-09-07 09:29:26,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:26,476 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2019-09-07 09:29:26,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-07 09:29:26,478 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-07 09:29:26,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:26,480 INFO L225 Difference]: With dead ends: 44 [2019-09-07 09:29:26,480 INFO L226 Difference]: Without dead ends: 28 [2019-09-07 09:29:26,481 INFO L628 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-09-07 09:29:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-07 09:29:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-07 09:29:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-07 09:29:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-07 09:29:26,487 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 20 [2019-09-07 09:29:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:26,488 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-07 09:29:26,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-07 09:29:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-07 09:29:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 09:29:26,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:26,489 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:26,489 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:26,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:26,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1743188542, now seen corresponding path program 2 times [2019-09-07 09:29:26,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:26,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:26,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:26,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:26,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:26,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-07 09:29:26,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:26,569 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:29:26,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:26,621 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:29:26,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:26,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 09:29:26,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-07 09:29:26,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:26,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 7 [2019-09-07 09:29:26,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 09:29:26,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 09:29:26,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:29:26,662 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 7 states. [2019-09-07 09:29:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:26,741 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-09-07 09:29:26,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 09:29:26,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-09-07 09:29:26,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:26,743 INFO L225 Difference]: With dead ends: 51 [2019-09-07 09:29:26,743 INFO L226 Difference]: Without dead ends: 35 [2019-09-07 09:29:26,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:29:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-09-07 09:29:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-09-07 09:29:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 09:29:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2019-09-07 09:29:26,751 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2019-09-07 09:29:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:26,752 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2019-09-07 09:29:26,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 09:29:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2019-09-07 09:29:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-07 09:29:26,753 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:26,753 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:26,754 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:26,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:26,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1066167916, now seen corresponding path program 3 times [2019-09-07 09:29:26,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:26,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:26,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:26,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:26,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:26,833 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:29:26,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:26,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:29:26,850 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-09-07 09:29:26,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 09:29:26,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:26,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-07 09:29:26,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-07 09:29:26,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:26,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-07 09:29:26,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 09:29:26,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 09:29:26,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 09:29:26,933 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 6 states. [2019-09-07 09:29:26,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:26,980 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2019-09-07 09:29:26,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-07 09:29:26,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-09-07 09:29:26,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:26,982 INFO L225 Difference]: With dead ends: 48 [2019-09-07 09:29:26,982 INFO L226 Difference]: Without dead ends: 37 [2019-09-07 09:29:26,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-09-07 09:29:26,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-07 09:29:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2019-09-07 09:29:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-07 09:29:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2019-09-07 09:29:27,007 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 27 [2019-09-07 09:29:27,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:27,007 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2019-09-07 09:29:27,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 09:29:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2019-09-07 09:29:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-07 09:29:27,016 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:27,016 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:27,016 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:27,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:27,017 INFO L82 PathProgramCache]: Analyzing trace with hash 548753824, now seen corresponding path program 4 times [2019-09-07 09:29:27,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:27,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:27,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:27,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:27,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 09:29:27,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:27,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:27,137 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:29:27,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:29:27,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:27,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 09:29:27,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-07 09:29:27,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:27,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 09:29:27,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 09:29:27,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 09:29:27,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:29:27,186 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 7 states. [2019-09-07 09:29:27,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:27,216 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2019-09-07 09:29:27,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 09:29:27,217 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-09-07 09:29:27,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:27,218 INFO L225 Difference]: With dead ends: 60 [2019-09-07 09:29:27,218 INFO L226 Difference]: Without dead ends: 38 [2019-09-07 09:29:27,219 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:29:27,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-07 09:29:27,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-09-07 09:29:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-07 09:29:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2019-09-07 09:29:27,225 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 30 [2019-09-07 09:29:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:27,225 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2019-09-07 09:29:27,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 09:29:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2019-09-07 09:29:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-07 09:29:27,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:27,227 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:27,227 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:27,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:27,227 INFO L82 PathProgramCache]: Analyzing trace with hash 12698242, now seen corresponding path program 5 times [2019-09-07 09:29:27,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:27,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:27,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:27,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:27,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:27,317 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:29:27,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:27,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:29:27,334 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:27,406 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2019-09-07 09:29:27,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:27,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 09:29:27,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:29:27,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:27,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-07 09:29:27,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 09:29:27,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 09:29:27,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:29:27,434 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 7 states. [2019-09-07 09:29:27,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:27,466 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2019-09-07 09:29:27,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 09:29:27,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-09-07 09:29:27,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:27,469 INFO L225 Difference]: With dead ends: 53 [2019-09-07 09:29:27,470 INFO L226 Difference]: Without dead ends: 42 [2019-09-07 09:29:27,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:29:27,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-07 09:29:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2019-09-07 09:29:27,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-07 09:29:27,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2019-09-07 09:29:27,476 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 32 [2019-09-07 09:29:27,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:27,477 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2019-09-07 09:29:27,477 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 09:29:27,477 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2019-09-07 09:29:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-09-07 09:29:27,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:27,478 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:27,480 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:27,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:27,480 INFO L82 PathProgramCache]: Analyzing trace with hash -40272438, now seen corresponding path program 6 times [2019-09-07 09:29:27,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:27,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:27,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:27,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:27,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 09:29:27,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:27,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:27,602 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:29:27,639 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-09-07 09:29:27,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:27,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 09:29:27,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-07 09:29:27,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:27,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-07 09:29:27,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-07 09:29:27,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-07 09:29:27,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-07 09:29:27,664 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 8 states. [2019-09-07 09:29:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:27,705 INFO L93 Difference]: Finished difference Result 68 states and 80 transitions. [2019-09-07 09:29:27,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 09:29:27,706 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-09-07 09:29:27,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:27,707 INFO L225 Difference]: With dead ends: 68 [2019-09-07 09:29:27,707 INFO L226 Difference]: Without dead ends: 43 [2019-09-07 09:29:27,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 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-09-07 09:29:27,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-07 09:29:27,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-09-07 09:29:27,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-07 09:29:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-09-07 09:29:27,713 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 35 [2019-09-07 09:29:27,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:27,714 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-09-07 09:29:27,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-07 09:29:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-09-07 09:29:27,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-07 09:29:27,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:27,715 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:27,716 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:27,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:27,716 INFO L82 PathProgramCache]: Analyzing trace with hash -444970456, now seen corresponding path program 7 times [2019-09-07 09:29:27,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:27,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:27,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:27,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:27,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:27,837 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:29:27,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:27,838 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:27,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:27,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 09:29:27,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:29:27,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:27,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-09-07 09:29:27,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 09:29:27,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 09:29:27,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:29:27,989 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 13 states. [2019-09-07 09:29:28,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:28,071 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-09-07 09:29:28,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 09:29:28,072 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2019-09-07 09:29:28,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:28,073 INFO L225 Difference]: With dead ends: 75 [2019-09-07 09:29:28,074 INFO L226 Difference]: Without dead ends: 50 [2019-09-07 09:29:28,075 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:29:28,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-07 09:29:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-09-07 09:29:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-07 09:29:28,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2019-09-07 09:29:28,084 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 37 [2019-09-07 09:29:28,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:28,085 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2019-09-07 09:29:28,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 09:29:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2019-09-07 09:29:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-07 09:29:28,086 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:28,086 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:28,087 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:28,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1018251974, now seen corresponding path program 8 times [2019-09-07 09:29:28,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:28,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:28,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:28,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:28,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-07 09:29:28,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:28,201 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:29:28,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:28,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:29:28,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:28,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 09:29:28,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-07 09:29:28,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:28,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-07 09:29:28,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 09:29:28,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 09:29:28,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:29:28,368 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 15 states. [2019-09-07 09:29:28,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:28,470 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2019-09-07 09:29:28,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 09:29:28,470 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 42 [2019-09-07 09:29:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:28,472 INFO L225 Difference]: With dead ends: 83 [2019-09-07 09:29:28,472 INFO L226 Difference]: Without dead ends: 55 [2019-09-07 09:29:28,473 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:29:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-07 09:29:28,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-09-07 09:29:28,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-07 09:29:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-09-07 09:29:28,492 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 42 [2019-09-07 09:29:28,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:28,493 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-09-07 09:29:28,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 09:29:28,493 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-09-07 09:29:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-07 09:29:28,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:28,494 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:28,495 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:28,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:28,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1065831908, now seen corresponding path program 9 times [2019-09-07 09:29:28,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:28,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:28,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:28,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:28,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 09:29:28,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:28,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:28,628 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:29:28,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-07 09:29:28,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:28,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 09:29:28,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:28,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 09:29:28,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:28,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:29:28,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:29:28,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 09:29:28,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 09:29:28,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:28,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:29:28,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:29:28,876 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 09:29:28,940 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-07 09:29:28,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:28,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2019-09-07 09:29:28,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 09:29:28,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 09:29:28,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-07 09:29:28,951 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 17 states. [2019-09-07 09:29:29,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:29,601 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2019-09-07 09:29:29,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 09:29:29,602 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 47 [2019-09-07 09:29:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:29,606 INFO L225 Difference]: With dead ends: 103 [2019-09-07 09:29:29,607 INFO L226 Difference]: Without dead ends: 92 [2019-09-07 09:29:29,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=909, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:29:29,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-09-07 09:29:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2019-09-07 09:29:29,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-07 09:29:29,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2019-09-07 09:29:29,640 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 47 [2019-09-07 09:29:29,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:29,643 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2019-09-07 09:29:29,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 09:29:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2019-09-07 09:29:29,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-07 09:29:29,644 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:29,644 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:29,644 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:29,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:29,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1551384282, now seen corresponding path program 1 times [2019-09-07 09:29:29,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:29,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:29,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:29,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:29,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-07 09:29:29,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:29:29,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:29:29,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:29:29,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:29:29,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:29:29,701 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand 3 states. [2019-09-07 09:29:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:29,711 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2019-09-07 09:29:29,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:29:29,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-07 09:29:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:29,716 INFO L225 Difference]: With dead ends: 92 [2019-09-07 09:29:29,716 INFO L226 Difference]: Without dead ends: 61 [2019-09-07 09:29:29,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:29:29,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-09-07 09:29:29,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-09-07 09:29:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-09-07 09:29:29,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-09-07 09:29:29,726 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 50 [2019-09-07 09:29:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:29,726 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-09-07 09:29:29,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:29:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-09-07 09:29:29,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-07 09:29:29,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:29,728 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:29,729 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:29,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:29,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1606870084, now seen corresponding path program 1 times [2019-09-07 09:29:29,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:29,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:29,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:29,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:29,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:29,827 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 2 proven. 49 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-07 09:29:29,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:29,828 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:29:29,842 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-09-07 09:29:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:29,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 09:29:29,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:29,926 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-07 09:29:29,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:29,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-07 09:29:29,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-07 09:29:29,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-07 09:29:29,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-09-07 09:29:29,936 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 11 states. [2019-09-07 09:29:29,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:29,996 INFO L93 Difference]: Finished difference Result 104 states and 108 transitions. [2019-09-07 09:29:29,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 09:29:29,996 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-09-07 09:29:29,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:29,998 INFO L225 Difference]: With dead ends: 104 [2019-09-07 09:29:29,998 INFO L226 Difference]: Without dead ends: 64 [2019-09-07 09:29:30,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 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-09-07 09:29:30,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-07 09:29:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2019-09-07 09:29:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-07 09:29:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-09-07 09:29:30,015 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-09-07 09:29:30,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:30,016 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-09-07 09:29:30,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-07 09:29:30,019 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-09-07 09:29:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-07 09:29:30,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:30,021 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:30,022 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:30,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1564129890, now seen corresponding path program 2 times [2019-09-07 09:29:30,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:30,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:30,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:30,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:30,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:30,167 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 2 proven. 70 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-07 09:29:30,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:30,170 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:29:30,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:30,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:29:30,237 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:30,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 09:29:30,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:30,365 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-09-07 09:29:30,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:30,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-07 09:29:30,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 09:29:30,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 09:29:30,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:29:30,372 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 19 states. [2019-09-07 09:29:30,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:30,457 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-09-07 09:29:30,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 09:29:30,458 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2019-09-07 09:29:30,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:30,459 INFO L225 Difference]: With dead ends: 111 [2019-09-07 09:29:30,459 INFO L226 Difference]: Without dead ends: 71 [2019-09-07 09:29:30,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:29:30,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-09-07 09:29:30,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2019-09-07 09:29:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-07 09:29:30,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-09-07 09:29:30,466 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 60 [2019-09-07 09:29:30,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:30,467 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-09-07 09:29:30,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 09:29:30,467 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-09-07 09:29:30,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-07 09:29:30,468 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:30,468 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:30,468 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:30,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:30,469 INFO L82 PathProgramCache]: Analyzing trace with hash -153240012, now seen corresponding path program 3 times [2019-09-07 09:29:30,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:30,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:30,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:30,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 2 proven. 92 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-07 09:29:30,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:30,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:30,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:29:30,638 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-09-07 09:29:30,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:30,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 09:29:30,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:30,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 09:29:30,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:30,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:29:30,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:29:30,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 09:29:32,809 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|) 4) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)))) is different from true [2019-09-07 09:29:32,886 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 09:29:32,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:32,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:29:32,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:29:32,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 09:29:32,979 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 138 trivial. 2 not checked. [2019-09-07 09:29:32,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:32,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 22 [2019-09-07 09:29:32,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 09:29:32,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 09:29:32,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=323, Unknown=1, NotChecked=38, Total=462 [2019-09-07 09:29:32,988 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 22 states. [2019-09-07 09:29:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:33,508 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2019-09-07 09:29:33,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 09:29:33,508 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2019-09-07 09:29:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:33,509 INFO L225 Difference]: With dead ends: 100 [2019-09-07 09:29:33,510 INFO L226 Difference]: Without dead ends: 83 [2019-09-07 09:29:33,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=224, Invalid=835, Unknown=1, NotChecked=62, Total=1122 [2019-09-07 09:29:33,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-09-07 09:29:33,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2019-09-07 09:29:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-07 09:29:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2019-09-07 09:29:33,518 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 65 [2019-09-07 09:29:33,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:33,518 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2019-09-07 09:29:33,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 09:29:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2019-09-07 09:29:33,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 09:29:33,520 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:33,520 INFO L399 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-09-07 09:29:33,520 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:33,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:33,520 INFO L82 PathProgramCache]: Analyzing trace with hash -215652588, now seen corresponding path program 4 times [2019-09-07 09:29:33,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:33,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:33,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:33,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:33,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 4 proven. 81 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-09-07 09:29:33,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:33,628 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:29:33,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:33,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:29:33,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:33,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 09:29:33,697 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:33,718 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-09-07 09:29:33,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:33,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 09:29:33,723 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 09:29:33,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 09:29:33,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:29:33,724 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 13 states. [2019-09-07 09:29:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:33,778 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2019-09-07 09:29:33,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 09:29:33,779 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2019-09-07 09:29:33,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:33,780 INFO L225 Difference]: With dead ends: 136 [2019-09-07 09:29:33,780 INFO L226 Difference]: Without dead ends: 82 [2019-09-07 09:29:33,781 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:29:33,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-07 09:29:33,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2019-09-07 09:29:33,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-09-07 09:29:33,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2019-09-07 09:29:33,789 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 76 [2019-09-07 09:29:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:33,790 INFO L475 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2019-09-07 09:29:33,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 09:29:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2019-09-07 09:29:33,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-07 09:29:33,791 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:33,791 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:33,792 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:33,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:33,792 INFO L82 PathProgramCache]: Analyzing trace with hash -993813386, now seen corresponding path program 5 times [2019-09-07 09:29:33,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:33,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:33,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:33,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:33,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 4 proven. 117 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-07 09:29:33,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:33,962 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:29:33,983 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:34,663 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-07 09:29:34,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:34,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 09:29:34,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:34,698 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Stream closed [2019-09-07 09:29:34,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:34,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-09-07 09:29:34,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 09:29:34,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 09:29:34,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:29:34,715 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 13 states. [2019-09-07 09:29:34,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:34,758 INFO L93 Difference]: Finished difference Result 111 states and 114 transitions. [2019-09-07 09:29:34,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 09:29:34,759 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 78 [2019-09-07 09:29:34,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:34,760 INFO L225 Difference]: With dead ends: 111 [2019-09-07 09:29:34,760 INFO L226 Difference]: Without dead ends: 86 [2019-09-07 09:29:34,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:29:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-07 09:29:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2019-09-07 09:29:34,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-07 09:29:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-09-07 09:29:34,767 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 78 [2019-09-07 09:29:34,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:34,768 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-09-07 09:29:34,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 09:29:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-09-07 09:29:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-07 09:29:34,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:34,769 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:34,769 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:34,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:34,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1651651238, now seen corresponding path program 6 times [2019-09-07 09:29:34,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:34,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:34,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:34,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:34,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 4 proven. 100 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-09-07 09:29:34,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:34,888 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:29:34,902 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:35,422 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-09-07 09:29:35,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:35,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 09:29:35,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:35,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 09:29:35,441 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:35,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:29:35,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:29:35,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 09:29:37,672 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|) 8) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 8)))) is different from true [2019-09-07 09:29:39,751 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|) 8)) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)))) is different from true [2019-09-07 09:29:39,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 09:29:39,845 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:39,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:29:39,854 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:29:39,854 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 09:29:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 177 trivial. 8 not checked. [2019-09-07 09:29:39,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:39,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 27 [2019-09-07 09:29:39,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 09:29:39,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 09:29:39,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=492, Unknown=2, NotChecked=94, Total=702 [2019-09-07 09:29:39,953 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 27 states. [2019-09-07 09:29:40,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:40,736 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2019-09-07 09:29:40,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 09:29:40,736 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 81 [2019-09-07 09:29:40,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:40,737 INFO L225 Difference]: With dead ends: 154 [2019-09-07 09:29:40,737 INFO L226 Difference]: Without dead ends: 97 [2019-09-07 09:29:40,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=292, Invalid=1354, Unknown=2, NotChecked=158, Total=1806 [2019-09-07 09:29:40,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-09-07 09:29:40,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2019-09-07 09:29:40,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-07 09:29:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-09-07 09:29:40,746 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 81 [2019-09-07 09:29:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:40,747 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-09-07 09:29:40,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 09:29:40,747 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-09-07 09:29:40,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 09:29:40,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:40,748 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:40,748 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:40,748 INFO L82 PathProgramCache]: Analyzing trace with hash 734882584, now seen corresponding path program 7 times [2019-09-07 09:29:40,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:40,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:40,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:40,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:40,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:40,891 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 6 proven. 145 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-09-07 09:29:40,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:40,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:40,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:40,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 09:29:40,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:41,148 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-09-07 09:29:41,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:41,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-09-07 09:29:41,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 09:29:41,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 09:29:41,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:29:41,154 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 25 states. [2019-09-07 09:29:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:41,266 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2019-09-07 09:29:41,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 09:29:41,267 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 91 [2019-09-07 09:29:41,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:41,268 INFO L225 Difference]: With dead ends: 167 [2019-09-07 09:29:41,268 INFO L226 Difference]: Without dead ends: 102 [2019-09-07 09:29:41,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:29:41,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-07 09:29:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2019-09-07 09:29:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-09-07 09:29:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2019-09-07 09:29:41,275 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 91 [2019-09-07 09:29:41,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:41,276 INFO L475 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2019-09-07 09:29:41,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 09:29:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2019-09-07 09:29:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 09:29:41,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:41,277 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:41,277 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:41,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:41,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2047045810, now seen corresponding path program 8 times [2019-09-07 09:29:41,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:41,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:41,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:41,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:29:41,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:41,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:41,432 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 6 proven. 176 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2019-09-07 09:29:41,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:41,433 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:29:41,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:41,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:29:41,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:41,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-07 09:29:41,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (18)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:29:41,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:41,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2019-09-07 09:29:41,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 09:29:41,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 09:29:41,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-09-07 09:29:41,813 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 27 states. [2019-09-07 09:29:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:41,938 INFO L93 Difference]: Finished difference Result 175 states and 180 transitions. [2019-09-07 09:29:41,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 09:29:41,941 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 96 [2019-09-07 09:29:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:41,942 INFO L225 Difference]: With dead ends: 175 [2019-09-07 09:29:41,942 INFO L226 Difference]: Without dead ends: 107 [2019-09-07 09:29:41,943 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2019-09-07 09:29:41,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-09-07 09:29:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2019-09-07 09:29:41,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-07 09:29:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2019-09-07 09:29:41,951 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 96 [2019-09-07 09:29:41,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:41,951 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2019-09-07 09:29:41,951 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 09:29:41,952 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2019-09-07 09:29:41,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-07 09:29:41,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:41,953 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:41,953 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:41,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:41,953 INFO L82 PathProgramCache]: Analyzing trace with hash 2048783060, now seen corresponding path program 9 times [2019-09-07 09:29:41,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:41,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:41,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:41,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:41,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:42,140 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 6 proven. 210 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-09-07 09:29:42,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:42,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:42,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:29:42,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-07 09:29:42,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:42,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 09:29:42,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:42,732 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:29:42,732 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-09-07 09:29:42,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:42,745 INFO L567 ElimStorePlain]: treesize reduction 9, result has 25.0 percent of original size [2019-09-07 09:29:42,746 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:29:42,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-09-07 09:29:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 6 proven. 128 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-09-07 09:29:42,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:42,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2019-09-07 09:29:42,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 09:29:42,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 09:29:42,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=623, Unknown=0, NotChecked=0, Total=812 [2019-09-07 09:29:42,826 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 29 states. [2019-09-07 09:29:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:43,601 INFO L93 Difference]: Finished difference Result 152 states and 156 transitions. [2019-09-07 09:29:43,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 09:29:43,603 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 101 [2019-09-07 09:29:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:43,604 INFO L225 Difference]: With dead ends: 152 [2019-09-07 09:29:43,604 INFO L226 Difference]: Without dead ends: 119 [2019-09-07 09:29:43,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 85 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=376, Invalid=1694, Unknown=0, NotChecked=0, Total=2070 [2019-09-07 09:29:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-09-07 09:29:43,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2019-09-07 09:29:43,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-07 09:29:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-09-07 09:29:43,614 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 101 [2019-09-07 09:29:43,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:43,614 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-09-07 09:29:43,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 09:29:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-09-07 09:29:43,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 09:29:43,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:43,616 INFO L399 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-09-07 09:29:43,616 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:43,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1139166780, now seen corresponding path program 10 times [2019-09-07 09:29:43,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:43,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:43,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:43,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:43,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:43,821 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 8 proven. 169 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-09-07 09:29:43,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:43,821 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:29:43,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:43,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:29:43,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:43,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 09:29:43,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-09-07 09:29:43,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:43,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-07 09:29:43,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 09:29:43,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 09:29:43,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 09:29:43,923 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 17 states. [2019-09-07 09:29:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:44,006 INFO L93 Difference]: Finished difference Result 200 states and 204 transitions. [2019-09-07 09:29:44,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-07 09:29:44,011 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2019-09-07 09:29:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:44,012 INFO L225 Difference]: With dead ends: 200 [2019-09-07 09:29:44,012 INFO L226 Difference]: Without dead ends: 118 [2019-09-07 09:29:44,013 INFO L628 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-09-07 09:29:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-09-07 09:29:44,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2019-09-07 09:29:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-09-07 09:29:44,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2019-09-07 09:29:44,021 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 112 [2019-09-07 09:29:44,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:44,021 INFO L475 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2019-09-07 09:29:44,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 09:29:44,022 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2019-09-07 09:29:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-07 09:29:44,023 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:44,023 INFO L399 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:44,023 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:44,024 INFO L82 PathProgramCache]: Analyzing trace with hash -608149978, now seen corresponding path program 11 times [2019-09-07 09:29:44,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:44,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:44,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:44,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 8 proven. 247 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-09-07 09:29:44,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:44,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:44,231 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:29:50,979 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-09-07 09:29:50,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:50,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-07 09:29:50,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2019-09-07 09:29:51,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:51,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2019-09-07 09:29:51,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 09:29:51,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 09:29:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:29:51,238 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 31 states. [2019-09-07 09:29:51,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:51,417 INFO L93 Difference]: Finished difference Result 207 states and 212 transitions. [2019-09-07 09:29:51,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 09:29:51,418 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 114 [2019-09-07 09:29:51,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:51,419 INFO L225 Difference]: With dead ends: 207 [2019-09-07 09:29:51,419 INFO L226 Difference]: Without dead ends: 125 [2019-09-07 09:29:51,420 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:29:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-09-07 09:29:51,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2019-09-07 09:29:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-07 09:29:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-09-07 09:29:51,431 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 114 [2019-09-07 09:29:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:51,432 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-09-07 09:29:51,432 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 09:29:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-09-07 09:29:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-07 09:29:51,433 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:51,433 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:51,433 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:51,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1115109156, now seen corresponding path program 12 times [2019-09-07 09:29:51,434 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:51,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:51,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:51,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:51,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:51,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 8 proven. 287 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2019-09-07 09:29:51,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:51,588 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:51,599 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:29:52,242 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-09-07 09:29:52,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:52,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 45 conjunts are in the unsatisfiable core [2019-09-07 09:29:52,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:52,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 09:29:52,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:29:52,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:29:52,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:29:52,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 09:29:54,491 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_7| |v_main_~#a~0.base_BEFORE_CALL_7|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|) 16) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) 16)))) is different from true [2019-09-07 09:29:56,565 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|) 16) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|) 16)) (not (= |v_main_~#b~0.base_BEFORE_CALL_8| |v_main_~#a~0.base_BEFORE_CALL_8|)))) is different from true [2019-09-07 09:29:58,639 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_9| Int) (|v_main_~#b~0.base_BEFORE_CALL_9| Int)) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_9| |v_main_~#a~0.base_BEFORE_CALL_9|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|) 16) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_9|) 16)))) is different from true [2019-09-07 09:30:00,719 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_10| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_10|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_10|) 16) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 16)))) is different from true [2019-09-07 09:30:00,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 09:30:00,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:30:00,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:30:00,797 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:30:00,797 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 09:30:00,896 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 351 trivial. 32 not checked. [2019-09-07 09:30:00,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:00,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 37 [2019-09-07 09:30:00,902 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 09:30:00,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 09:30:00,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=815, Unknown=4, NotChecked=260, Total=1332 [2019-09-07 09:30:00,903 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 37 states. [2019-09-07 09:30:01,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:01,907 INFO L93 Difference]: Finished difference Result 178 states and 182 transitions. [2019-09-07 09:30:01,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 09:30:01,908 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 119 [2019-09-07 09:30:01,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:01,910 INFO L225 Difference]: With dead ends: 178 [2019-09-07 09:30:01,910 INFO L226 Difference]: Without dead ends: 137 [2019-09-07 09:30:01,911 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 96 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=449, Invalid=1819, Unknown=4, NotChecked=380, Total=2652 [2019-09-07 09:30:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-09-07 09:30:01,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2019-09-07 09:30:01,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-09-07 09:30:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-09-07 09:30:01,919 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 119 [2019-09-07 09:30:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:01,920 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-09-07 09:30:01,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 09:30:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-09-07 09:30:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-07 09:30:01,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:01,921 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:01,921 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:01,922 INFO L82 PathProgramCache]: Analyzing trace with hash 441594140, now seen corresponding path program 13 times [2019-09-07 09:30:01,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:01,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:01,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:01,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:01,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:02,104 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 10 proven. 225 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2019-09-07 09:30:02,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:02,105 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:02,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:02,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 09:30:02,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:02,202 INFO L134 CoverageAnalysis]: Checked inductivity of 655 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2019-09-07 09:30:02,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:02,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-09-07 09:30:02,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 09:30:02,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 09:30:02,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:30:02,212 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 19 states. [2019-09-07 09:30:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:02,291 INFO L93 Difference]: Finished difference Result 232 states and 236 transitions. [2019-09-07 09:30:02,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 09:30:02,292 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 130 [2019-09-07 09:30:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:02,294 INFO L225 Difference]: With dead ends: 232 [2019-09-07 09:30:02,294 INFO L226 Difference]: Without dead ends: 136 [2019-09-07 09:30:02,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:30:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-09-07 09:30:02,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-09-07 09:30:02,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-09-07 09:30:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2019-09-07 09:30:02,304 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 130 [2019-09-07 09:30:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:02,304 INFO L475 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2019-09-07 09:30:02,304 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 09:30:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2019-09-07 09:30:02,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-07 09:30:02,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:02,305 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:02,306 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:02,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:02,306 INFO L82 PathProgramCache]: Analyzing trace with hash 291457278, now seen corresponding path program 14 times [2019-09-07 09:30:02,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:02,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:02,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:02,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:02,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:02,480 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 10 proven. 330 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2019-09-07 09:30:02,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:02,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:02,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:30:02,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:30:02,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:02,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 09:30:02,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2019-09-07 09:30:02,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:02,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 35 [2019-09-07 09:30:02,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 09:30:02,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 09:30:02,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:30:02,863 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 35 states. [2019-09-07 09:30:03,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:03,028 INFO L93 Difference]: Finished difference Result 239 states and 244 transitions. [2019-09-07 09:30:03,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 09:30:03,032 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 132 [2019-09-07 09:30:03,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:03,033 INFO L225 Difference]: With dead ends: 239 [2019-09-07 09:30:03,033 INFO L226 Difference]: Without dead ends: 143 [2019-09-07 09:30:03,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:30:03,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-09-07 09:30:03,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2019-09-07 09:30:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-07 09:30:03,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2019-09-07 09:30:03,044 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 132 [2019-09-07 09:30:03,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:03,044 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2019-09-07 09:30:03,044 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 09:30:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2019-09-07 09:30:03,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-07 09:30:03,045 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:03,046 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:03,046 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:03,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:03,046 INFO L82 PathProgramCache]: Analyzing trace with hash -2064935052, now seen corresponding path program 15 times [2019-09-07 09:30:03,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:03,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:03,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:03,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:03,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:03,317 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2019-09-07 09:30:03,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:03,318 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:03,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:30:05,371 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-09-07 09:30:05,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:05,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 09:30:05,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:05,422 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 33 proven. 376 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2019-09-07 09:30:05,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:05,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 22 [2019-09-07 09:30:05,429 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-07 09:30:05,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-07 09:30:05,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2019-09-07 09:30:05,429 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 22 states. [2019-09-07 09:30:05,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:05,728 INFO L93 Difference]: Finished difference Result 194 states and 197 transitions. [2019-09-07 09:30:05,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 09:30:05,728 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 137 [2019-09-07 09:30:05,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:05,729 INFO L225 Difference]: With dead ends: 194 [2019-09-07 09:30:05,729 INFO L226 Difference]: Without dead ends: 145 [2019-09-07 09:30:05,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=536, Invalid=946, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:30:05,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-09-07 09:30:05,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2019-09-07 09:30:05,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-07 09:30:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-09-07 09:30:05,739 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 137 [2019-09-07 09:30:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:05,739 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-09-07 09:30:05,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-07 09:30:05,740 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-09-07 09:30:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-07 09:30:05,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:05,741 INFO L399 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-09-07 09:30:05,741 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:05,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:05,742 INFO L82 PathProgramCache]: Analyzing trace with hash -816207904, now seen corresponding path program 16 times [2019-09-07 09:30:05,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:05,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:05,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:05,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:05,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 10 proven. 289 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2019-09-07 09:30:05,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:05,971 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:05,981 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:30:06,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:30:06,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:06,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 09:30:06,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:06,101 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-09-07 09:30:06,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:06,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-09-07 09:30:06,105 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 09:30:06,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 09:30:06,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:30:06,106 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 21 states. [2019-09-07 09:30:06,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:06,185 INFO L93 Difference]: Finished difference Result 248 states and 252 transitions. [2019-09-07 09:30:06,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 09:30:06,186 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 140 [2019-09-07 09:30:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:06,187 INFO L225 Difference]: With dead ends: 248 [2019-09-07 09:30:06,187 INFO L226 Difference]: Without dead ends: 146 [2019-09-07 09:30:06,188 INFO L628 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-09-07 09:30:06,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-07 09:30:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-09-07 09:30:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-09-07 09:30:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2019-09-07 09:30:06,197 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 140 [2019-09-07 09:30:06,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:06,197 INFO L475 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2019-09-07 09:30:06,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 09:30:06,198 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2019-09-07 09:30:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-07 09:30:06,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:06,199 INFO L399 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:06,199 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:06,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:06,199 INFO L82 PathProgramCache]: Analyzing trace with hash 404475202, now seen corresponding path program 17 times [2019-09-07 09:30:06,200 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:06,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:06,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:06,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:06,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 10 proven. 425 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2019-09-07 09:30:06,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:06,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:06,426 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:30:17,212 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2019-09-07 09:30:17,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:17,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 09:30:17,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2019-09-07 09:30:17,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:17,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2019-09-07 09:30:17,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 09:30:17,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 09:30:17,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:30:17,588 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 39 states. [2019-09-07 09:30:17,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:17,784 INFO L93 Difference]: Finished difference Result 255 states and 260 transitions. [2019-09-07 09:30:17,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 09:30:17,785 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 142 [2019-09-07 09:30:17,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:17,787 INFO L225 Difference]: With dead ends: 255 [2019-09-07 09:30:17,787 INFO L226 Difference]: Without dead ends: 153 [2019-09-07 09:30:17,788 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:30:17,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-09-07 09:30:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2019-09-07 09:30:17,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-09-07 09:30:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-09-07 09:30:17,796 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 142 [2019-09-07 09:30:17,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:17,796 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-09-07 09:30:17,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 09:30:17,796 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-09-07 09:30:17,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-07 09:30:17,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:17,797 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:17,798 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:17,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:17,798 INFO L82 PathProgramCache]: Analyzing trace with hash -240722128, now seen corresponding path program 18 times [2019-09-07 09:30:17,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:17,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:17,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:17,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:17,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:18,060 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 10 proven. 477 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2019-09-07 09:30:18,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:18,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:30:18,074 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:23,681 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2019-09-07 09:30:23,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:23,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-07 09:30:23,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:23,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 09:30:23,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:30:23,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:30:23,702 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:30:23,702 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 09:30:25,937 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_11| Int) (|v_main_~#b~0.base_BEFORE_CALL_11| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_11| |v_main_~#b~0.base_BEFORE_CALL_11|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_11|) 20) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|) 20)))) is different from true [2019-09-07 09:30:28,002 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_12| Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|) 20) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_12|) 20)) (not (= |v_main_~#a~0.base_BEFORE_CALL_12| |v_main_~#b~0.base_BEFORE_CALL_12|)))) is different from true [2019-09-07 09:30:30,066 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_13| Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_13| |v_main_~#b~0.base_BEFORE_CALL_13|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 20) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_13|) 20)))) is different from true [2019-09-07 09:30:32,144 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_14| Int) (|v_main_~#b~0.base_BEFORE_CALL_14| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_14|) 20) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_14|) 20)) (not (= |v_main_~#a~0.base_BEFORE_CALL_14| |v_main_~#b~0.base_BEFORE_CALL_14|)))) is different from true [2019-09-07 09:30:34,214 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_15| Int) (|v_main_~#b~0.base_BEFORE_CALL_15| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_15| |v_main_~#b~0.base_BEFORE_CALL_15|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_15|) 20) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_15|) 20)))) is different from true [2019-09-07 09:30:34,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 09:30:34,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:30:34,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:30:34,314 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:30:34,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 09:30:34,462 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 0 proven. 305 refuted. 0 times theorem prover too weak. 583 trivial. 50 not checked. [2019-09-07 09:30:34,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:34,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25] total 44 [2019-09-07 09:30:34,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 09:30:34,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 09:30:34,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=1128, Unknown=5, NotChecked=390, Total=1892 [2019-09-07 09:30:34,470 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 44 states. [2019-09-07 09:30:35,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:35,848 INFO L93 Difference]: Finished difference Result 214 states and 218 transitions. [2019-09-07 09:30:35,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 09:30:35,849 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 147 [2019-09-07 09:30:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:35,850 INFO L225 Difference]: With dead ends: 214 [2019-09-07 09:30:35,850 INFO L226 Difference]: Without dead ends: 165 [2019-09-07 09:30:35,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 120 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=655, Invalid=2552, Unknown=5, NotChecked=570, Total=3782 [2019-09-07 09:30:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-07 09:30:35,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2019-09-07 09:30:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-09-07 09:30:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-09-07 09:30:35,863 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 147 [2019-09-07 09:30:35,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:35,864 INFO L475 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-09-07 09:30:35,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 09:30:35,864 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-09-07 09:30:35,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-07 09:30:35,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:35,867 INFO L399 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-09-07 09:30:35,867 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:35,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:35,867 INFO L82 PathProgramCache]: Analyzing trace with hash -891177160, now seen corresponding path program 19 times [2019-09-07 09:30:35,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:35,868 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:35,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:35,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:35,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 12 proven. 361 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2019-09-07 09:30:36,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:36,141 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:30:36,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:36,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 09:30:36,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:36,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1037 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 09:30:36,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:36,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-07 09:30:36,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-07 09:30:36,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-07 09:30:36,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-09-07 09:30:36,276 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 23 states. [2019-09-07 09:30:36,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:36,396 INFO L93 Difference]: Finished difference Result 280 states and 284 transitions. [2019-09-07 09:30:36,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-07 09:30:36,397 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 158 [2019-09-07 09:30:36,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:36,398 INFO L225 Difference]: With dead ends: 280 [2019-09-07 09:30:36,398 INFO L226 Difference]: Without dead ends: 164 [2019-09-07 09:30:36,403 INFO L628 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-09-07 09:30:36,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-09-07 09:30:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-09-07 09:30:36,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-09-07 09:30:36,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 165 transitions. [2019-09-07 09:30:36,416 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 165 transitions. Word has length 158 [2019-09-07 09:30:36,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:36,416 INFO L475 AbstractCegarLoop]: Abstraction has 163 states and 165 transitions. [2019-09-07 09:30:36,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-07 09:30:36,416 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 165 transitions. [2019-09-07 09:30:36,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-07 09:30:36,417 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:36,418 INFO L399 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:36,418 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:36,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:36,418 INFO L82 PathProgramCache]: Analyzing trace with hash -2105669606, now seen corresponding path program 20 times [2019-09-07 09:30:36,418 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:36,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:36,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:36,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:30:36,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:36,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 12 proven. 532 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-09-07 09:30:36,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:36,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:30:36,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:36,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:30:36,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:36,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 09:30:36,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:37,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2019-09-07 09:30:37,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:37,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-09-07 09:30:37,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 09:30:37,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 09:30:37,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:30:37,409 INFO L87 Difference]: Start difference. First operand 163 states and 165 transitions. Second operand 43 states. [2019-09-07 09:30:37,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:37,584 INFO L93 Difference]: Finished difference Result 287 states and 292 transitions. [2019-09-07 09:30:37,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 09:30:37,585 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 160 [2019-09-07 09:30:37,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:37,586 INFO L225 Difference]: With dead ends: 287 [2019-09-07 09:30:37,586 INFO L226 Difference]: Without dead ends: 171 [2019-09-07 09:30:37,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:30:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-09-07 09:30:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2019-09-07 09:30:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-09-07 09:30:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-09-07 09:30:37,599 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 160 [2019-09-07 09:30:37,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:37,600 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-09-07 09:30:37,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 09:30:37,600 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-09-07 09:30:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-07 09:30:37,602 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:37,602 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:37,602 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:37,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:37,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1698563968, now seen corresponding path program 21 times [2019-09-07 09:30:37,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:37,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:37,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:37,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:37,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 12 proven. 590 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2019-09-07 09:30:37,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:37,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:30:37,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:41,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-07 09:30:41,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:41,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-07 09:30:41,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-09-07 09:30:41,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:41,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-09-07 09:30:41,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 09:30:41,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 09:30:41,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:30:41,849 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 24 states. [2019-09-07 09:30:41,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:41,929 INFO L93 Difference]: Finished difference Result 230 states and 233 transitions. [2019-09-07 09:30:41,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-07 09:30:41,929 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 165 [2019-09-07 09:30:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:41,931 INFO L225 Difference]: With dead ends: 230 [2019-09-07 09:30:41,931 INFO L226 Difference]: Without dead ends: 173 [2019-09-07 09:30:41,933 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 165 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-09-07 09:30:41,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-09-07 09:30:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-09-07 09:30:41,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-09-07 09:30:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-09-07 09:30:41,945 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 165 [2019-09-07 09:30:41,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:41,946 INFO L475 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-09-07 09:30:41,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 09:30:41,946 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-09-07 09:30:41,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-07 09:30:41,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:41,947 INFO L399 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-09-07 09:30:41,948 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:41,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:41,948 INFO L82 PathProgramCache]: Analyzing trace with hash -621078020, now seen corresponding path program 22 times [2019-09-07 09:30:41,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:41,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:41,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:41,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:41,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 12 proven. 441 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2019-09-07 09:30:42,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:42,272 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:30:42,290 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:42,374 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:30:42,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:30:42,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 09:30:42,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:30:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1236 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (32)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:30:42,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:30:42,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2019-09-07 09:30:42,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 09:30:42,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 09:30:42,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:30:42,414 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 25 states. [2019-09-07 09:30:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:30:42,505 INFO L93 Difference]: Finished difference Result 296 states and 300 transitions. [2019-09-07 09:30:42,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 09:30:42,506 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 168 [2019-09-07 09:30:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:30:42,507 INFO L225 Difference]: With dead ends: 296 [2019-09-07 09:30:42,507 INFO L226 Difference]: Without dead ends: 174 [2019-09-07 09:30:42,508 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:30:42,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-07 09:30:42,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2019-09-07 09:30:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-09-07 09:30:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2019-09-07 09:30:42,521 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 168 [2019-09-07 09:30:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:30:42,521 INFO L475 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2019-09-07 09:30:42,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 09:30:42,521 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2019-09-07 09:30:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-07 09:30:42,522 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:30:42,523 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:30:42,523 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:30:42,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:30:42,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1453770658, now seen corresponding path program 23 times [2019-09-07 09:30:42,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:30:42,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:30:42,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:42,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:30:42,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:30:42,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:42,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 12 proven. 651 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2019-09-07 09:30:42,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:42,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:30:42,906 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:31:32,810 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2019-09-07 09:31:32,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:31:32,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 533 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 09:31:32,843 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:31:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 795 trivial. 0 not checked. [2019-09-07 09:31:33,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:31:33,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2019-09-07 09:31:33,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 09:31:33,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 09:31:33,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:31:33,289 INFO L87 Difference]: Start difference. First operand 173 states and 175 transitions. Second operand 47 states. [2019-09-07 09:31:33,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:31:33,498 INFO L93 Difference]: Finished difference Result 303 states and 308 transitions. [2019-09-07 09:31:33,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 09:31:33,499 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 170 [2019-09-07 09:31:33,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:31:33,500 INFO L225 Difference]: With dead ends: 303 [2019-09-07 09:31:33,500 INFO L226 Difference]: Without dead ends: 181 [2019-09-07 09:31:33,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:31:33,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-09-07 09:31:33,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2019-09-07 09:31:33,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-09-07 09:31:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-09-07 09:31:33,510 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 170 [2019-09-07 09:31:33,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:31:33,510 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-09-07 09:31:33,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 09:31:33,510 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-09-07 09:31:33,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-07 09:31:33,511 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:31:33,512 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:31:33,512 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:31:33,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:31:33,512 INFO L82 PathProgramCache]: Analyzing trace with hash -935959748, now seen corresponding path program 24 times [2019-09-07 09:31:33,512 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:31:33,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:31:33,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:33,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:31:33,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 12 proven. 715 refuted. 0 times theorem prover too weak. 661 trivial. 0 not checked. [2019-09-07 09:31:33,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:31:33,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:31:33,908 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:31:43,034 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2019-09-07 09:31:43,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:31:43,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 09:31:43,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:31:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 859 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (34)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:31:43,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:31:43,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 49 [2019-09-07 09:31:43,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 09:31:43,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 09:31:43,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:31:43,528 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 49 states. [2019-09-07 09:31:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:31:43,759 INFO L93 Difference]: Finished difference Result 311 states and 316 transitions. [2019-09-07 09:31:43,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 09:31:43,760 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 175 [2019-09-07 09:31:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:31:43,761 INFO L225 Difference]: With dead ends: 311 [2019-09-07 09:31:43,761 INFO L226 Difference]: Without dead ends: 186 [2019-09-07 09:31:43,762 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:31:43,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-07 09:31:43,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2019-09-07 09:31:43,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-09-07 09:31:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 185 transitions. [2019-09-07 09:31:43,773 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 185 transitions. Word has length 175 [2019-09-07 09:31:43,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:31:43,773 INFO L475 AbstractCegarLoop]: Abstraction has 183 states and 185 transitions. [2019-09-07 09:31:43,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 09:31:43,774 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 185 transitions. [2019-09-07 09:31:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-07 09:31:43,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:31:43,775 INFO L399 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:31:43,775 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:31:43,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:31:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash -602709854, now seen corresponding path program 25 times [2019-09-07 09:31:43,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:31:43,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:31:43,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:43,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:31:43,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1502 backedges. 12 proven. 782 refuted. 0 times theorem prover too weak. 708 trivial. 0 not checked. [2019-09-07 09:31:44,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:31:44,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:31:44,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:31:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:44,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 26 conjunts are in the unsatisfiable core [2019-09-07 09:31:44,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:31:44,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1502 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 926 trivial. 0 not checked. [2019-09-07 09:31:44,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:31:44,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2019-09-07 09:31:44,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-09-07 09:31:44,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-09-07 09:31:44,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 09:31:44,684 INFO L87 Difference]: Start difference. First operand 183 states and 185 transitions. Second operand 51 states. [2019-09-07 09:31:44,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:31:44,906 INFO L93 Difference]: Finished difference Result 319 states and 324 transitions. [2019-09-07 09:31:44,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-07 09:31:44,906 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 180 [2019-09-07 09:31:44,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:31:44,907 INFO L225 Difference]: With dead ends: 319 [2019-09-07 09:31:44,907 INFO L226 Difference]: Without dead ends: 191 [2019-09-07 09:31:44,909 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2019-09-07 09:31:44,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-09-07 09:31:44,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2019-09-07 09:31:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-07 09:31:44,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 190 transitions. [2019-09-07 09:31:44,919 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 190 transitions. Word has length 180 [2019-09-07 09:31:44,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:31:44,919 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 190 transitions. [2019-09-07 09:31:44,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-09-07 09:31:44,920 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 190 transitions. [2019-09-07 09:31:44,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-07 09:31:44,921 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:31:44,921 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:31:44,921 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:31:44,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:31:44,921 INFO L82 PathProgramCache]: Analyzing trace with hash -62675208, now seen corresponding path program 26 times [2019-09-07 09:31:44,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:31:44,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:31:44,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:44,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:31:44,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:45,300 INFO L134 CoverageAnalysis]: Checked inductivity of 1621 backedges. 12 proven. 852 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2019-09-07 09:31:45,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:31:45,301 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:31:45,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:31:45,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:31:45,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:31:45,403 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 09:31:45,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:31:45,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1621 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2019-09-07 09:31:45,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:31:45,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 53 [2019-09-07 09:31:45,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 09:31:45,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 09:31:45,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:31:45,930 INFO L87 Difference]: Start difference. First operand 188 states and 190 transitions. Second operand 53 states. [2019-09-07 09:31:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:31:46,184 INFO L93 Difference]: Finished difference Result 327 states and 332 transitions. [2019-09-07 09:31:46,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 09:31:46,184 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 185 [2019-09-07 09:31:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:31:46,185 INFO L225 Difference]: With dead ends: 327 [2019-09-07 09:31:46,185 INFO L226 Difference]: Without dead ends: 196 [2019-09-07 09:31:46,186 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:31:46,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-09-07 09:31:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2019-09-07 09:31:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-07 09:31:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 195 transitions. [2019-09-07 09:31:46,194 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 195 transitions. Word has length 185 [2019-09-07 09:31:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:31:46,195 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 195 transitions. [2019-09-07 09:31:46,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 09:31:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 195 transitions. [2019-09-07 09:31:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-07 09:31:46,196 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:31:46,196 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:31:46,196 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:31:46,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:31:46,197 INFO L82 PathProgramCache]: Analyzing trace with hash 621068518, now seen corresponding path program 27 times [2019-09-07 09:31:46,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:31:46,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:31:46,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:46,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:31:46,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:31:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:31:46,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 12 proven. 925 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-09-07 09:31:46,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:31:46,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:31:46,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:31:52,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-09-07 09:31:52,524 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:31:52,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-07 09:31:52,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:31:52,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 09:31:52,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:31:52,551 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:31:52,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:31:52,551 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 09:31:54,840 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_16| Int) (|v_main_~#a~0.base_BEFORE_CALL_16| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_16|) 24) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|) 24)) (not (= |v_main_~#a~0.base_BEFORE_CALL_16| |v_main_~#b~0.base_BEFORE_CALL_16|)))) is different from true [2019-09-07 09:31:56,935 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_17| |v_main_~#b~0.base_BEFORE_CALL_17|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_17|) 24) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) 24)))) is different from true [2019-09-07 09:31:59,031 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_18| Int) (|v_main_~#b~0.base_BEFORE_CALL_18| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_18|) 24) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_18|) 24)) (not (= |v_main_~#a~0.base_BEFORE_CALL_18| |v_main_~#b~0.base_BEFORE_CALL_18|)))) is different from true [2019-09-07 09:32:01,113 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| Int) (|v_main_~#b~0.base_BEFORE_CALL_19| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_19| |v_main_~#b~0.base_BEFORE_CALL_19|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|) 24) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_19|) 24)))) is different from true [2019-09-07 09:32:03,198 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_20| Int) (|v_main_~#a~0.base_BEFORE_CALL_20| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_20| |v_main_~#b~0.base_BEFORE_CALL_20|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_20|) 24) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_20|) 24)))) is different from true [2019-09-07 09:32:05,284 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_21| Int) (|v_main_~#b~0.base_BEFORE_CALL_21| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_21|) 24) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_21|) 24)) (not (= |v_main_~#a~0.base_BEFORE_CALL_21| |v_main_~#b~0.base_BEFORE_CALL_21|)))) is different from true [2019-09-07 09:32:05,380 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 09:32:05,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:32:05,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:32:05,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-09-07 09:32:05,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 09:32:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1745 backedges. 0 proven. 502 refuted. 0 times theorem prover too weak. 1171 trivial. 72 not checked. [2019-09-07 09:32:05,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:32:05,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 54 [2019-09-07 09:32:05,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-07 09:32:05,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-07 09:32:05,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=607, Invalid=1667, Unknown=6, NotChecked=582, Total=2862 [2019-09-07 09:32:05,598 INFO L87 Difference]: Start difference. First operand 193 states and 195 transitions. Second operand 54 states. [2019-09-07 09:32:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:32:07,258 INFO L93 Difference]: Finished difference Result 265 states and 269 transitions. [2019-09-07 09:32:07,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 09:32:07,258 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 190 [2019-09-07 09:32:07,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:32:07,261 INFO L225 Difference]: With dead ends: 265 [2019-09-07 09:32:07,261 INFO L226 Difference]: Without dead ends: 208 [2019-09-07 09:32:07,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 159 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=1127, Invalid=4003, Unknown=6, NotChecked=870, Total=6006 [2019-09-07 09:32:07,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-09-07 09:32:07,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 204. [2019-09-07 09:32:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-09-07 09:32:07,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 206 transitions. [2019-09-07 09:32:07,272 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 206 transitions. Word has length 190 [2019-09-07 09:32:07,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:32:07,273 INFO L475 AbstractCegarLoop]: Abstraction has 204 states and 206 transitions. [2019-09-07 09:32:07,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-07 09:32:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 206 transitions. [2019-09-07 09:32:07,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-07 09:32:07,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:32:07,274 INFO L399 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:32:07,275 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:32:07,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:32:07,275 INFO L82 PathProgramCache]: Analyzing trace with hash -998699670, now seen corresponding path program 28 times [2019-09-07 09:32:07,275 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:32:07,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:32:07,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:07,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:32:07,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:32:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1873 backedges. 14 proven. 676 refuted. 0 times theorem prover too weak. 1183 trivial. 0 not checked. [2019-09-07 09:32:07,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:32:07,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:32:07,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:32:07,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:32:07,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:32:07,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 09:32:07,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:32:07,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1873 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 1197 trivial. 0 not checked. [2019-09-07 09:32:07,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:32:07,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 09:32:07,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 09:32:07,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 09:32:07,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:32:07,857 INFO L87 Difference]: Start difference. First operand 204 states and 206 transitions. Second operand 30 states. [2019-09-07 09:32:07,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:32:07,972 INFO L93 Difference]: Finished difference Result 352 states and 356 transitions. [2019-09-07 09:32:07,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 09:32:07,972 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 201 [2019-09-07 09:32:07,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:32:07,974 INFO L225 Difference]: With dead ends: 352 [2019-09-07 09:32:07,974 INFO L226 Difference]: Without dead ends: 207 [2019-09-07 09:32:07,975 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 201 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-09-07 09:32:07,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-09-07 09:32:07,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2019-09-07 09:32:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-07 09:32:07,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-09-07 09:32:07,986 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 201 [2019-09-07 09:32:07,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:32:07,987 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-09-07 09:32:07,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 09:32:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-09-07 09:32:07,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-07 09:32:07,988 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:32:07,988 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:32:07,989 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:32:07,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:32:07,989 INFO L82 PathProgramCache]: Analyzing trace with hash -654326968, now seen corresponding path program 29 times [2019-09-07 09:32:07,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:32:07,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:32:07,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:07,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:32:07,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:08,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:32:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 14 proven. 1001 refuted. 0 times theorem prover too weak. 911 trivial. 0 not checked. [2019-09-07 09:32:08,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:32:08,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:32:08,394 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:32:47,270 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 28 check-sat command(s) [2019-09-07 09:32:47,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:32:47,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-07 09:32:47,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:32:47,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2019-09-07 09:32:47,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:32:47,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-09-07 09:32:47,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 09:32:47,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 09:32:47,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:32:47,360 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 30 states. [2019-09-07 09:32:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:32:47,455 INFO L93 Difference]: Finished difference Result 276 states and 279 transitions. [2019-09-07 09:32:47,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 09:32:47,455 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 203 [2019-09-07 09:32:47,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:32:47,458 INFO L225 Difference]: With dead ends: 276 [2019-09-07 09:32:47,458 INFO L226 Difference]: Without dead ends: 211 [2019-09-07 09:32:47,458 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 203 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-09-07 09:32:47,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-09-07 09:32:47,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2019-09-07 09:32:47,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-09-07 09:32:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 211 transitions. [2019-09-07 09:32:47,470 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 211 transitions. Word has length 203 [2019-09-07 09:32:47,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:32:47,470 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 211 transitions. [2019-09-07 09:32:47,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 09:32:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 211 transitions. [2019-09-07 09:32:47,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-07 09:32:47,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:32:47,471 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:32:47,472 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:32:47,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:32:47,472 INFO L82 PathProgramCache]: Analyzing trace with hash -144265508, now seen corresponding path program 30 times [2019-09-07 09:32:47,472 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:32:47,472 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:32:47,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:47,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:32:47,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:32:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:32:47,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2005 backedges. 14 proven. 729 refuted. 0 times theorem prover too weak. 1262 trivial. 0 not checked. [2019-09-07 09:32:47,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:32:47,868 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:32:47,878 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:32:59,615 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2019-09-07 09:32:59,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:32:59,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 09:32:59,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:32:59,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 09:32:59,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:32:59,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:32:59,645 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:32:59,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 09:33:02,031 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_22| Int) (|v_main_~#b~0.base_BEFORE_CALL_22| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_22|) 28) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_22|) 28)) (not (= |v_main_~#a~0.base_BEFORE_CALL_22| |v_main_~#b~0.base_BEFORE_CALL_22|)))) is different from true [2019-09-07 09:33:04,119 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_23| Int) (|v_main_~#a~0.base_BEFORE_CALL_23| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_23| |v_main_~#b~0.base_BEFORE_CALL_23|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_23|) 28) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_23|) 28)))) is different from true [2019-09-07 09:33:06,262 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_24| Int) (|v_main_~#a~0.base_BEFORE_CALL_24| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_24|) 28) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_24|) 28)) (not (= |v_main_~#a~0.base_BEFORE_CALL_24| |v_main_~#b~0.base_BEFORE_CALL_24|)))) is different from true [2019-09-07 09:33:08,356 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_25| Int) (|v_main_~#b~0.base_BEFORE_CALL_25| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_25| |v_main_~#b~0.base_BEFORE_CALL_25|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_25|) 28) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_25|) 28)))) is different from true [2019-09-07 09:33:10,490 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_26| Int) (|v_main_~#b~0.base_BEFORE_CALL_26| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_26|) 28) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_26|) 28)) (not (= |v_main_~#a~0.base_BEFORE_CALL_26| |v_main_~#b~0.base_BEFORE_CALL_26|)))) is different from true [2019-09-07 09:33:12,588 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_27| Int) (|v_main_~#a~0.base_BEFORE_CALL_27| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_27|) 28) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_27|) 28)) (not (= |v_main_~#a~0.base_BEFORE_CALL_27| |v_main_~#b~0.base_BEFORE_CALL_27|)))) is different from true [2019-09-07 09:33:14,686 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_28| Int) (|v_main_~#a~0.base_BEFORE_CALL_28| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_28| |v_main_~#b~0.base_BEFORE_CALL_28|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_28|) 28) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_28|) 28)))) is different from true [2019-09-07 09:33:14,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 09:33:14,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:33:14,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:33:14,811 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:33:14,811 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 09:33:15,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2005 backedges. 0 proven. 627 refuted. 0 times theorem prover too weak. 1280 trivial. 98 not checked. [2019-09-07 09:33:15,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:33:15,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 59 [2019-09-07 09:33:15,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 09:33:15,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 09:33:15,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=2162, Unknown=7, NotChecked=742, Total=3422 [2019-09-07 09:33:15,056 INFO L87 Difference]: Start difference. First operand 209 states and 211 transitions. Second operand 59 states. [2019-09-07 09:33:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:33:17,785 INFO L93 Difference]: Finished difference Result 370 states and 375 transitions. [2019-09-07 09:33:17,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 09:33:17,786 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 206 [2019-09-07 09:33:17,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:33:17,787 INFO L225 Difference]: With dead ends: 370 [2019-09-07 09:33:17,788 INFO L226 Difference]: Without dead ends: 222 [2019-09-07 09:33:17,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 171 SyntacticMatches, 7 SemanticMatches, 90 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=1403, Invalid=5758, Unknown=7, NotChecked=1204, Total=8372 [2019-09-07 09:33:17,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-07 09:33:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2019-09-07 09:33:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-09-07 09:33:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 221 transitions. [2019-09-07 09:33:17,801 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 221 transitions. Word has length 206 [2019-09-07 09:33:17,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:33:17,802 INFO L475 AbstractCegarLoop]: Abstraction has 219 states and 221 transitions. [2019-09-07 09:33:17,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 09:33:17,802 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 221 transitions. [2019-09-07 09:33:17,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-07 09:33:17,803 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:33:17,804 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:33:17,804 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:33:17,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:33:17,804 INFO L82 PathProgramCache]: Analyzing trace with hash -79005102, now seen corresponding path program 31 times [2019-09-07 09:33:17,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:33:17,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:33:17,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:17,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:33:17,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:33:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 16 proven. 1080 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-07 09:33:18,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:33:18,254 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:33:18,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:33:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:33:18,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 09:33:18,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:33:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2120 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1336 trivial. 0 not checked. [2019-09-07 09:33:19,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:33:19,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 59 [2019-09-07 09:33:19,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 09:33:19,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 09:33:19,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 09:33:19,061 INFO L87 Difference]: Start difference. First operand 219 states and 221 transitions. Second operand 59 states. [2019-09-07 09:33:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:33:19,346 INFO L93 Difference]: Finished difference Result 383 states and 388 transitions. [2019-09-07 09:33:19,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 09:33:19,347 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 216 [2019-09-07 09:33:19,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:33:19,348 INFO L225 Difference]: With dead ends: 383 [2019-09-07 09:33:19,348 INFO L226 Difference]: Without dead ends: 227 [2019-09-07 09:33:19,349 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 09:33:19,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-09-07 09:33:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-09-07 09:33:19,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-07 09:33:19,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 226 transitions. [2019-09-07 09:33:19,360 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 226 transitions. Word has length 216 [2019-09-07 09:33:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:33:19,361 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 226 transitions. [2019-09-07 09:33:19,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 09:33:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 226 transitions. [2019-09-07 09:33:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-09-07 09:33:19,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:33:19,363 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:33:19,363 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:33:19,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:33:19,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1228503960, now seen corresponding path program 32 times [2019-09-07 09:33:19,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:33:19,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:33:19,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:19,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:33:19,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:33:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2259 backedges. 16 proven. 1162 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-09-07 09:33:19,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:33:19,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:33:19,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:33:20,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:33:20,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:33:20,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 09:33:20,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:33:20,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2259 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1418 trivial. 0 not checked. [2019-09-07 09:33:20,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:33:20,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 61 [2019-09-07 09:33:20,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 09:33:20,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 09:33:20,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:33:20,811 INFO L87 Difference]: Start difference. First operand 224 states and 226 transitions. Second operand 61 states. [2019-09-07 09:33:21,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:33:21,107 INFO L93 Difference]: Finished difference Result 391 states and 396 transitions. [2019-09-07 09:33:21,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 09:33:21,120 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 221 [2019-09-07 09:33:21,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:33:21,122 INFO L225 Difference]: With dead ends: 391 [2019-09-07 09:33:21,122 INFO L226 Difference]: Without dead ends: 232 [2019-09-07 09:33:21,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:33:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-07 09:33:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2019-09-07 09:33:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-09-07 09:33:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 231 transitions. [2019-09-07 09:33:21,140 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 231 transitions. Word has length 221 [2019-09-07 09:33:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:33:21,140 INFO L475 AbstractCegarLoop]: Abstraction has 229 states and 231 transitions. [2019-09-07 09:33:21,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 09:33:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 231 transitions. [2019-09-07 09:33:21,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-07 09:33:21,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:33:21,142 INFO L399 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:33:21,143 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:33:21,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:33:21,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1236402838, now seen corresponding path program 33 times [2019-09-07 09:33:21,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:33:21,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:33:21,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:21,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:33:21,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:33:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2403 backedges. 16 proven. 1247 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2019-09-07 09:33:21,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:33:21,716 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:33:21,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:33:41,864 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-09-07 09:33:41,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:33:41,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 09:33:41,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:33:42,565 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:33:42,566 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-09-07 09:33:42,567 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:33:42,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:33:42,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:33:42,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-09-07 09:33:42,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2403 backedges. 16 proven. 765 refuted. 0 times theorem prover too weak. 1622 trivial. 0 not checked. [2019-09-07 09:33:42,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:33:42,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 26] total 56 [2019-09-07 09:33:42,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 09:33:42,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 09:33:42,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=798, Invalid=2282, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 09:33:42,794 INFO L87 Difference]: Start difference. First operand 229 states and 231 transitions. Second operand 56 states. [2019-09-07 09:33:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:33:45,445 INFO L93 Difference]: Finished difference Result 317 states and 321 transitions. [2019-09-07 09:33:45,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-07 09:33:45,445 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 226 [2019-09-07 09:33:45,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:33:45,447 INFO L225 Difference]: With dead ends: 317 [2019-09-07 09:33:45,448 INFO L226 Difference]: Without dead ends: 244 [2019-09-07 09:33:45,449 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 195 SyntacticMatches, 8 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1991 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1454, Invalid=6556, Unknown=0, NotChecked=0, Total=8010 [2019-09-07 09:33:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-09-07 09:33:45,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2019-09-07 09:33:45,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-09-07 09:33:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 242 transitions. [2019-09-07 09:33:45,461 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 242 transitions. Word has length 226 [2019-09-07 09:33:45,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:33:45,461 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 242 transitions. [2019-09-07 09:33:45,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 09:33:45,462 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 242 transitions. [2019-09-07 09:33:45,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-07 09:33:45,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:33:45,463 INFO L399 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-09-07 09:33:45,464 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:33:45,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:33:45,464 INFO L82 PathProgramCache]: Analyzing trace with hash 718205194, now seen corresponding path program 34 times [2019-09-07 09:33:45,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:33:45,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:33:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:45,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:33:45,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:33:45,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2559 backedges. 18 proven. 900 refuted. 0 times theorem prover too weak. 1641 trivial. 0 not checked. [2019-09-07 09:33:45,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:33:45,927 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:33:45,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:33:46,053 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:33:46,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:33:46,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-07 09:33:46,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:33:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2559 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 1659 trivial. 0 not checked. [2019-09-07 09:33:46,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:33:46,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2019-09-07 09:33:46,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 09:33:46,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 09:33:46,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:33:46,110 INFO L87 Difference]: Start difference. First operand 240 states and 242 transitions. Second operand 34 states. [2019-09-07 09:33:46,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:33:46,267 INFO L93 Difference]: Finished difference Result 416 states and 420 transitions. [2019-09-07 09:33:46,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 09:33:46,268 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 237 [2019-09-07 09:33:46,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:33:46,269 INFO L225 Difference]: With dead ends: 416 [2019-09-07 09:33:46,269 INFO L226 Difference]: Without dead ends: 243 [2019-09-07 09:33:46,269 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:33:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-09-07 09:33:46,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2019-09-07 09:33:46,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-07 09:33:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 244 transitions. [2019-09-07 09:33:46,282 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 244 transitions. Word has length 237 [2019-09-07 09:33:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:33:46,282 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 244 transitions. [2019-09-07 09:33:46,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 09:33:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 244 transitions. [2019-09-07 09:33:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-07 09:33:46,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:33:46,284 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:33:46,284 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:33:46,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:33:46,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1469542424, now seen corresponding path program 35 times [2019-09-07 09:33:46,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:33:46,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:33:46,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:46,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:33:46,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:33:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:33:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2620 backedges. 18 proven. 1335 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2019-09-07 09:33:46,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:33:46,784 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:33:46,794 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:35:58,194 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-09-07 09:35:58,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:35:58,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 09:35:58,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:35:59,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2620 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1659 trivial. 0 not checked. [2019-09-07 09:35:59,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:35:59,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 65 [2019-09-07 09:35:59,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-09-07 09:35:59,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-09-07 09:35:59,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 09:35:59,646 INFO L87 Difference]: Start difference. First operand 242 states and 244 transitions. Second operand 65 states. [2019-09-07 09:35:59,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:35:59,957 INFO L93 Difference]: Finished difference Result 423 states and 428 transitions. [2019-09-07 09:35:59,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-07 09:35:59,957 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 239 [2019-09-07 09:35:59,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:35:59,958 INFO L225 Difference]: With dead ends: 423 [2019-09-07 09:35:59,958 INFO L226 Difference]: Without dead ends: 250 [2019-09-07 09:35:59,960 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2019-09-07 09:35:59,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-09-07 09:35:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2019-09-07 09:35:59,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-09-07 09:35:59,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 249 transitions. [2019-09-07 09:35:59,973 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 249 transitions. Word has length 239 [2019-09-07 09:35:59,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:35:59,974 INFO L475 AbstractCegarLoop]: Abstraction has 247 states and 249 transitions. [2019-09-07 09:35:59,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-09-07 09:35:59,974 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 249 transitions. [2019-09-07 09:35:59,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-07 09:35:59,976 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:35:59,976 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:35:59,976 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:35:59,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:35:59,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2104218258, now seen corresponding path program 36 times [2019-09-07 09:35:59,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:35:59,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:35:59,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:35:59,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:35:59,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:36:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:36:00,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 18 proven. 1426 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2019-09-07 09:36:00,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:36:00,634 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:36:00,645 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:37:48,561 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2019-09-07 09:37:48,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:37:48,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 65 conjunts are in the unsatisfiable core [2019-09-07 09:37:48,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:37:48,618 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 09:37:48,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:37:48,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:37:48,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:37:48,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 09:37:50,973 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_37| Int) (|v_main_~#b~0.base_BEFORE_CALL_37| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_37|) 36) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_37|) 36)) (not (= |v_main_~#a~0.base_BEFORE_CALL_37| |v_main_~#b~0.base_BEFORE_CALL_37|)))) is different from true [2019-09-07 09:37:53,069 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_38| Int) (|v_main_~#a~0.base_BEFORE_CALL_38| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_38|) 36) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_38|) 36)) (not (= |v_main_~#a~0.base_BEFORE_CALL_38| |v_main_~#b~0.base_BEFORE_CALL_38|)))) is different from true [2019-09-07 09:37:55,159 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_39| Int) (|v_main_~#a~0.base_BEFORE_CALL_39| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_39|) 36) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_39|) 36)) (not (= |v_main_~#a~0.base_BEFORE_CALL_39| |v_main_~#b~0.base_BEFORE_CALL_39|)))) is different from true [2019-09-07 09:37:57,251 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_40| Int) (|v_main_~#b~0.base_BEFORE_CALL_40| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_40|) 36) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_40|) 36)) (not (= |v_main_~#a~0.base_BEFORE_CALL_40| |v_main_~#b~0.base_BEFORE_CALL_40|)))) is different from true [2019-09-07 09:37:59,345 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_41| Int) (|v_main_~#b~0.base_BEFORE_CALL_41| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_41|) 36) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_41|) 36)) (not (= |v_main_~#a~0.base_BEFORE_CALL_41| |v_main_~#b~0.base_BEFORE_CALL_41|)))) is different from true [2019-09-07 09:38:01,442 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_42| Int) (|v_main_~#a~0.base_BEFORE_CALL_42| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_42|) 36) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_42|) 36)) (not (= |v_main_~#a~0.base_BEFORE_CALL_42| |v_main_~#b~0.base_BEFORE_CALL_42|)))) is different from true [2019-09-07 09:38:03,536 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_43| Int) (|v_main_~#b~0.base_BEFORE_CALL_43| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_43|) 36) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_43|) 36)) (not (= |v_main_~#a~0.base_BEFORE_CALL_43| |v_main_~#b~0.base_BEFORE_CALL_43|)))) is different from true [2019-09-07 09:38:05,644 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_44| Int) (|v_main_~#b~0.base_BEFORE_CALL_44| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_44| |v_main_~#b~0.base_BEFORE_CALL_44|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_44|) 36) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_44|) 36)))) is different from true [2019-09-07 09:38:07,756 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_45| Int) (|v_main_~#a~0.base_BEFORE_CALL_45| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_45|) 36) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_45|) 36)) (not (= |v_main_~#a~0.base_BEFORE_CALL_45| |v_main_~#b~0.base_BEFORE_CALL_45|)))) is different from true [2019-09-07 09:38:07,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 09:38:07,870 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:38:07,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:38:07,875 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:38:07,875 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 09:38:08,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2774 backedges. 0 proven. 916 refuted. 0 times theorem prover too weak. 1696 trivial. 162 not checked. [2019-09-07 09:38:08,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:38:08,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 37] total 69 [2019-09-07 09:38:08,187 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-07 09:38:08,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-07 09:38:08,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=928, Invalid=2639, Unknown=9, NotChecked=1116, Total=4692 [2019-09-07 09:38:08,188 INFO L87 Difference]: Start difference. First operand 247 states and 249 transitions. Second operand 69 states. [2019-09-07 09:38:10,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:38:10,909 INFO L93 Difference]: Finished difference Result 343 states and 347 transitions. [2019-09-07 09:38:10,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 09:38:10,909 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 244 [2019-09-07 09:38:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:38:10,911 INFO L225 Difference]: With dead ends: 343 [2019-09-07 09:38:10,911 INFO L226 Difference]: Without dead ends: 262 [2019-09-07 09:38:10,912 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 201 SyntacticMatches, 9 SemanticMatches, 94 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2302 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=1592, Invalid=5917, Unknown=9, NotChecked=1602, Total=9120 [2019-09-07 09:38:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-09-07 09:38:10,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 258. [2019-09-07 09:38:10,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-09-07 09:38:10,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 260 transitions. [2019-09-07 09:38:10,925 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 260 transitions. Word has length 244 [2019-09-07 09:38:10,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:38:10,926 INFO L475 AbstractCegarLoop]: Abstraction has 258 states and 260 transitions. [2019-09-07 09:38:10,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-07 09:38:10,926 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 260 transitions. [2019-09-07 09:38:10,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-07 09:38:10,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:38:10,928 INFO L399 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-09-07 09:38:10,928 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:38:10,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:38:10,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1721097434, now seen corresponding path program 37 times [2019-09-07 09:38:10,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:38:10,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:38:10,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:38:10,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:38:10,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:38:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:38:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 20 proven. 1024 refuted. 0 times theorem prover too weak. 1900 trivial. 0 not checked. [2019-09-07 09:38:11,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:38:11,627 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:38:11,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:38:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:38:11,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 09:38:11,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:38:11,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (47)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:38:11,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:38:11,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-09-07 09:38:11,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 09:38:11,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 09:38:11,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:38:11,825 INFO L87 Difference]: Start difference. First operand 258 states and 260 transitions. Second operand 36 states. [2019-09-07 09:38:11,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:38:11,942 INFO L93 Difference]: Finished difference Result 448 states and 452 transitions. [2019-09-07 09:38:11,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 09:38:11,942 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 255 [2019-09-07 09:38:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:38:11,944 INFO L225 Difference]: With dead ends: 448 [2019-09-07 09:38:11,944 INFO L226 Difference]: Without dead ends: 261 [2019-09-07 09:38:11,945 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:38:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-09-07 09:38:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2019-09-07 09:38:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-07 09:38:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 262 transitions. [2019-09-07 09:38:11,963 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 262 transitions. Word has length 255 [2019-09-07 09:38:11,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:38:11,964 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 262 transitions. [2019-09-07 09:38:11,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 09:38:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 262 transitions. [2019-09-07 09:38:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-09-07 09:38:11,967 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:38:11,967 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:38:11,968 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:38:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:38:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1845182408, now seen corresponding path program 38 times [2019-09-07 09:38:11,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:38:11,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:38:11,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:38:11,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:38:11,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:38:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:38:12,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3009 backedges. 20 proven. 1520 refuted. 0 times theorem prover too weak. 1469 trivial. 0 not checked. [2019-09-07 09:38:12,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:38:12,559 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:38:12,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:38:12,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:38:12,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:38:12,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 09:38:12,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:38:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3009 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (48)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:38:13,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:38:13,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36] total 69 [2019-09-07 09:38:13,619 INFO L454 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-09-07 09:38:13,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-09-07 09:38:13,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 09:38:13,620 INFO L87 Difference]: Start difference. First operand 260 states and 262 transitions. Second operand 69 states. [2019-09-07 09:38:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:38:13,923 INFO L93 Difference]: Finished difference Result 455 states and 460 transitions. [2019-09-07 09:38:13,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-07 09:38:13,927 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 257 [2019-09-07 09:38:13,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:38:13,929 INFO L225 Difference]: With dead ends: 455 [2019-09-07 09:38:13,929 INFO L226 Difference]: Without dead ends: 268 [2019-09-07 09:38:13,930 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1088 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2019-09-07 09:38:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-07 09:38:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2019-09-07 09:38:13,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-09-07 09:38:13,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 267 transitions. [2019-09-07 09:38:13,944 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 267 transitions. Word has length 257 [2019-09-07 09:38:13,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:38:13,944 INFO L475 AbstractCegarLoop]: Abstraction has 265 states and 267 transitions. [2019-09-07 09:38:13,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-09-07 09:38:13,946 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 267 transitions. [2019-09-07 09:38:13,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-07 09:38:13,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:38:13,948 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:38:13,948 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:38:13,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:38:13,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1603515462, now seen corresponding path program 39 times [2019-09-07 09:38:13,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:38:13,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:38:13,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:38:13,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:38:13,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:38:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:38:14,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3173 backedges. 20 proven. 1617 refuted. 0 times theorem prover too weak. 1536 trivial. 0 not checked. [2019-09-07 09:38:14,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:38:14,686 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:38:14,695 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:38:59,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-09-07 09:38:59,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:38:59,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 70 conjunts are in the unsatisfiable core [2019-09-07 09:38:59,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:38:59,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-07 09:38:59,920 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:38:59,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:38:59,925 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:38:59,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-09-07 09:38:59,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2019-09-07 09:38:59,968 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:38:59,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:38:59,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:38:59,979 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:11 [2019-09-07 09:39:02,335 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_46| Int) (|v_main_~#a~0.base_BEFORE_CALL_46| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_46|) 40) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_46|) 40)) (not (= |v_main_~#a~0.base_BEFORE_CALL_46| |v_main_~#b~0.base_BEFORE_CALL_46|)))) is different from true [2019-09-07 09:39:04,440 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_47| Int) (|v_main_~#b~0.base_BEFORE_CALL_47| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_47| |v_main_~#b~0.base_BEFORE_CALL_47|)) (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_47|) 40) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_47|) 40)))) is different from true [2019-09-07 09:39:06,533 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_48| Int) (|v_main_~#b~0.base_BEFORE_CALL_48| Int)) (and (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_48|) 40) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_48|) 40)) (not (= |v_main_~#a~0.base_BEFORE_CALL_48| |v_main_~#b~0.base_BEFORE_CALL_48|)))) is different from true [2019-09-07 09:39:08,623 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_49| Int) (|v_main_~#a~0.base_BEFORE_CALL_49| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_49| |v_main_~#b~0.base_BEFORE_CALL_49|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_49|) 40) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_49|) 40)))) is different from true [2019-09-07 09:39:10,728 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_50| Int) (|v_main_~#b~0.base_BEFORE_CALL_50| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_50|) 40) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_50|) 40)) (not (= |v_main_~#a~0.base_BEFORE_CALL_50| |v_main_~#b~0.base_BEFORE_CALL_50|)))) is different from true [2019-09-07 09:39:12,827 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_51| Int) (|v_main_~#b~0.base_BEFORE_CALL_51| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_51|) 40) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_51|) 40)) (not (= |v_main_~#a~0.base_BEFORE_CALL_51| |v_main_~#b~0.base_BEFORE_CALL_51|)))) is different from true [2019-09-07 09:39:14,937 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_52| Int) (|v_main_~#b~0.base_BEFORE_CALL_52| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_52|) 40) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_52|) 40)) (not (= |v_main_~#a~0.base_BEFORE_CALL_52| |v_main_~#b~0.base_BEFORE_CALL_52|)))) is different from true [2019-09-07 09:39:17,041 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_53| Int) (|v_main_~#a~0.base_BEFORE_CALL_53| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_53|) 40) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_53|) 40)) (not (= |v_main_~#a~0.base_BEFORE_CALL_53| |v_main_~#b~0.base_BEFORE_CALL_53|)))) is different from true [2019-09-07 09:39:19,169 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_54| Int) (|v_main_~#b~0.base_BEFORE_CALL_54| Int)) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_54| |v_main_~#b~0.base_BEFORE_CALL_54|)) (= (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_54|) 40) (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_54|) 40)))) is different from true [2019-09-07 09:39:21,275 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_55| Int) (|v_main_~#b~0.base_BEFORE_CALL_55| Int)) (and (= (select (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_55|) 40) (select (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_55|) 40)) (not (= |v_main_~#a~0.base_BEFORE_CALL_55| |v_main_~#b~0.base_BEFORE_CALL_55|)))) is different from true [2019-09-07 09:39:21,391 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2019-09-07 09:39:21,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-07 09:39:21,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-07 09:39:21,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-07 09:39:21,396 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2019-09-07 09:39:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3173 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 1893 trivial. 200 not checked. [2019-09-07 09:39:21,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:39:21,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 40] total 74 [2019-09-07 09:39:21,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-09-07 09:39:21,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-09-07 09:39:21,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1049, Invalid=3013, Unknown=10, NotChecked=1330, Total=5402 [2019-09-07 09:39:21,758 INFO L87 Difference]: Start difference. First operand 265 states and 267 transitions. Second operand 74 states. [2019-09-07 09:39:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:39:24,727 INFO L93 Difference]: Finished difference Result 369 states and 373 transitions. [2019-09-07 09:39:24,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-09-07 09:39:24,728 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 262 [2019-09-07 09:39:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:39:24,730 INFO L225 Difference]: With dead ends: 369 [2019-09-07 09:39:24,730 INFO L226 Difference]: Without dead ends: 280 [2019-09-07 09:39:24,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 215 SyntacticMatches, 10 SemanticMatches, 100 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 2639 ImplicationChecksByTransitivity, 23.3s TimeCoverageRelationStatistics Valid=1765, Invalid=6637, Unknown=10, NotChecked=1890, Total=10302 [2019-09-07 09:39:24,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-09-07 09:39:24,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 276. [2019-09-07 09:39:24,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-09-07 09:39:24,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-09-07 09:39:24,745 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 262 [2019-09-07 09:39:24,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:39:24,745 INFO L475 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-09-07 09:39:24,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-09-07 09:39:24,746 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-09-07 09:39:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-09-07 09:39:24,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:39:24,748 INFO L399 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-09-07 09:39:24,748 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:39:24,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:39:24,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1738947414, now seen corresponding path program 40 times [2019-09-07 09:39:24,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:39:24,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:39:24,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:39:24,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:39:24,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:39:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:39:25,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3357 backedges. 22 proven. 1156 refuted. 0 times theorem prover too weak. 2179 trivial. 0 not checked. [2019-09-07 09:39:25,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:39:25,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:39:25,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:39:25,529 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:39:25,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:39:25,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 831 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 09:39:25,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:39:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3357 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 2201 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (50)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:39:25,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:39:25,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2019-09-07 09:39:25,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 09:39:25,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 09:39:25,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:39:25,624 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 38 states. [2019-09-07 09:39:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:39:25,756 INFO L93 Difference]: Finished difference Result 480 states and 484 transitions. [2019-09-07 09:39:25,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 09:39:25,757 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 273 [2019-09-07 09:39:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:39:25,758 INFO L225 Difference]: With dead ends: 480 [2019-09-07 09:39:25,758 INFO L226 Difference]: Without dead ends: 279 [2019-09-07 09:39:25,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:39:25,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-09-07 09:39:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 278. [2019-09-07 09:39:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-07 09:39:25,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 280 transitions. [2019-09-07 09:39:25,773 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 280 transitions. Word has length 273 [2019-09-07 09:39:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:39:25,773 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 280 transitions. [2019-09-07 09:39:25,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 09:39:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 280 transitions. [2019-09-07 09:39:25,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-09-07 09:39:25,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:39:25,775 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:39:25,776 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:39:25,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:39:25,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1652175736, now seen corresponding path program 41 times [2019-09-07 09:39:25,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:39:25,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:39:25,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:39:25,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:39:25,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:39:25,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:39:26,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 22 proven. 1717 refuted. 0 times theorem prover too weak. 1687 trivial. 0 not checked. [2019-09-07 09:39:26,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:39:26,408 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:39:26,422 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:41:27,870 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2019-09-07 09:41:27,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:41:27,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 09:41:27,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:41:28,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3426 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 2201 trivial. 0 not checked. [2019-09-07 09:41:28,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:41:28,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 73 [2019-09-07 09:41:28,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-09-07 09:41:28,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-09-07 09:41:28,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 09:41:28,963 INFO L87 Difference]: Start difference. First operand 278 states and 280 transitions. Second operand 73 states. [2019-09-07 09:41:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:41:29,308 INFO L93 Difference]: Finished difference Result 487 states and 492 transitions. [2019-09-07 09:41:29,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-07 09:41:29,308 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 275 [2019-09-07 09:41:29,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:41:29,310 INFO L225 Difference]: With dead ends: 487 [2019-09-07 09:41:29,310 INFO L226 Difference]: Without dead ends: 286 [2019-09-07 09:41:29,311 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2019-09-07 09:41:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-09-07 09:41:29,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2019-09-07 09:41:29,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-09-07 09:41:29,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 285 transitions. [2019-09-07 09:41:29,326 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 285 transitions. Word has length 275 [2019-09-07 09:41:29,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:41:29,326 INFO L475 AbstractCegarLoop]: Abstraction has 283 states and 285 transitions. [2019-09-07 09:41:29,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-09-07 09:41:29,326 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 285 transitions. [2019-09-07 09:41:29,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-09-07 09:41:29,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:41:29,328 INFO L399 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:41:29,328 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:41:29,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:41:29,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1962989342, now seen corresponding path program 42 times [2019-09-07 09:41:29,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:41:29,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:41:29,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:41:29,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:41:29,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:41:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:41:30,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 22 proven. 1820 refuted. 0 times theorem prover too weak. 1758 trivial. 0 not checked. [2019-09-07 09:41:30,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:41:30,031 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:41:30,043 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:42:36,550 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2019-09-07 09:42:36,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:42:36,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 856 conjuncts, 40 conjunts are in the unsatisfiable core [2019-09-07 09:42:36,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:42:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 71 proven. 1820 refuted. 0 times theorem prover too weak. 1709 trivial. 0 not checked. [2019-09-07 09:42:36,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:42:36,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 40] total 41 [2019-09-07 09:42:36,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-09-07 09:42:36,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-09-07 09:42:36,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2019-09-07 09:42:36,765 INFO L87 Difference]: Start difference. First operand 283 states and 285 transitions. Second operand 41 states. [2019-09-07 09:42:37,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:42:37,683 INFO L93 Difference]: Finished difference Result 385 states and 388 transitions. [2019-09-07 09:42:37,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-07 09:42:37,684 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 280 [2019-09-07 09:42:37,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:42:37,685 INFO L225 Difference]: With dead ends: 385 [2019-09-07 09:42:37,685 INFO L226 Difference]: Without dead ends: 288 [2019-09-07 09:42:37,686 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2151, Invalid=3701, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 09:42:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-09-07 09:42:37,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2019-09-07 09:42:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-09-07 09:42:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 288 transitions. [2019-09-07 09:42:37,701 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 288 transitions. Word has length 280 [2019-09-07 09:42:37,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:42:37,702 INFO L475 AbstractCegarLoop]: Abstraction has 286 states and 288 transitions. [2019-09-07 09:42:37,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-09-07 09:42:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 288 transitions. [2019-09-07 09:42:37,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-07 09:42:37,704 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:42:37,704 INFO L399 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-09-07 09:42:37,704 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:42:37,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:42:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1767999974, now seen corresponding path program 43 times [2019-09-07 09:42:37,705 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:42:37,705 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:42:37,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:42:37,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:42:37,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:42:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:42:38,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3706 backedges. 22 proven. 1296 refuted. 0 times theorem prover too weak. 2388 trivial. 0 not checked. [2019-09-07 09:42:38,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:42:38,712 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:42:38,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:42:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:42:38,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 09:42:38,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:42:38,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3706 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 2410 trivial. 0 not checked. [2019-09-07 09:42:38,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:42:38,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2019-09-07 09:42:38,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-09-07 09:42:38,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-09-07 09:42:38,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 09:42:38,964 INFO L87 Difference]: Start difference. First operand 286 states and 288 transitions. Second operand 40 states. [2019-09-07 09:42:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:42:39,122 INFO L93 Difference]: Finished difference Result 496 states and 500 transitions. [2019-09-07 09:42:39,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 09:42:39,123 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 283 [2019-09-07 09:42:39,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:42:39,124 INFO L225 Difference]: With dead ends: 496 [2019-09-07 09:42:39,124 INFO L226 Difference]: Without dead ends: 289 [2019-09-07 09:42:39,125 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-09-07 09:42:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-07 09:42:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 288. [2019-09-07 09:42:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-09-07 09:42:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 290 transitions. [2019-09-07 09:42:39,144 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 290 transitions. Word has length 283 [2019-09-07 09:42:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:42:39,144 INFO L475 AbstractCegarLoop]: Abstraction has 288 states and 290 transitions. [2019-09-07 09:42:39,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-09-07 09:42:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 290 transitions. [2019-09-07 09:42:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-07 09:42:39,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:42:39,147 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:42:39,147 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:42:39,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:42:39,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1187238980, now seen corresponding path program 44 times [2019-09-07 09:42:39,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:42:39,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:42:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:42:39,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:42:39,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:42:39,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:42:40,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3779 backedges. 22 proven. 1926 refuted. 0 times theorem prover too weak. 1831 trivial. 0 not checked. [2019-09-07 09:42:40,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:42:40,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:42:40,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:42:40,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:42:40,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:42:40,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 09:42:40,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:42:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 3779 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2410 trivial. 0 not checked. [2019-09-07 09:42:41,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:42:41,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40] total 77 [2019-09-07 09:42:41,318 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-07 09:42:41,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-07 09:42:41,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 09:42:41,318 INFO L87 Difference]: Start difference. First operand 288 states and 290 transitions. Second operand 77 states. [2019-09-07 09:42:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:42:41,674 INFO L93 Difference]: Finished difference Result 503 states and 508 transitions. [2019-09-07 09:42:41,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-07 09:42:41,674 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 285 [2019-09-07 09:42:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:42:41,676 INFO L225 Difference]: With dead ends: 503 [2019-09-07 09:42:41,676 INFO L226 Difference]: Without dead ends: 296 [2019-09-07 09:42:41,676 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2019-09-07 09:42:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-09-07 09:42:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 293. [2019-09-07 09:42:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-09-07 09:42:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 295 transitions. [2019-09-07 09:42:41,691 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 295 transitions. Word has length 285 [2019-09-07 09:42:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:42:41,691 INFO L475 AbstractCegarLoop]: Abstraction has 293 states and 295 transitions. [2019-09-07 09:42:41,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-07 09:42:41,691 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 295 transitions. [2019-09-07 09:42:41,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-09-07 09:42:41,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:42:41,693 INFO L399 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:42:41,694 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:42:41,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:42:41,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1302973598, now seen corresponding path program 45 times [2019-09-07 09:42:41,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:42:41,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:42:41,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:42:41,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:42:41,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:42:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:42:42,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3963 backedges. 22 proven. 2035 refuted. 0 times theorem prover too weak. 1906 trivial. 0 not checked. [2019-09-07 09:42:42,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:42:42,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:42:42,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2