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/sanfoundry_02_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-07 09:17:00,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-07 09:17:00,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-07 09:17:00,949 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-07 09:17:00,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-07 09:17:00,950 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-07 09:17:00,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-07 09:17:00,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-07 09:17:00,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-07 09:17:00,956 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-07 09:17:00,957 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-07 09:17:00,958 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-07 09:17:00,959 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-07 09:17:00,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-07 09:17:00,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-07 09:17:00,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-07 09:17:00,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-07 09:17:00,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-07 09:17:00,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-07 09:17:00,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-07 09:17:00,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-07 09:17:00,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-07 09:17:00,972 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-07 09:17:00,973 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-07 09:17:00,975 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-07 09:17:00,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-07 09:17:00,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-07 09:17:00,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-07 09:17:00,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-07 09:17:00,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-07 09:17:00,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-07 09:17:00,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-07 09:17:00,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-07 09:17:00,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-07 09:17:00,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-07 09:17:00,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-07 09:17:00,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-07 09:17:00,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-07 09:17:00,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-07 09:17:00,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-07 09:17:00,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-07 09:17:00,987 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:17:01,011 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-07 09:17:01,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-07 09:17:01,012 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-07 09:17:01,012 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-07 09:17:01,013 INFO L138 SettingsManager]: * Use SBE=true [2019-09-07 09:17:01,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-07 09:17:01,013 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-07 09:17:01,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-07 09:17:01,013 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-07 09:17:01,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-07 09:17:01,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-07 09:17:01,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-07 09:17:01,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-07 09:17:01,014 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-07 09:17:01,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-07 09:17:01,015 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-07 09:17:01,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-07 09:17:01,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-07 09:17:01,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-07 09:17:01,016 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-07 09:17:01,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-07 09:17:01,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-07 09:17:01,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-07 09:17:01,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-07 09:17:01,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-07 09:17:01,017 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-07 09:17:01,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-07 09:17:01,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-07 09:17:01,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-07 09:17:01,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-07 09:17:01,073 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-07 09:17:01,076 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-07 09:17:01,078 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-07 09:17:01,078 INFO L275 PluginConnector]: CDTParser initialized [2019-09-07 09:17:01,079 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_02_ground.i [2019-09-07 09:17:01,142 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9138228/6e53dbf9c3d844f9b37bf7b84a82fb5b/FLAG87f461604 [2019-09-07 09:17:01,584 INFO L306 CDTParser]: Found 1 translation units. [2019-09-07 09:17:01,586 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_02_ground.i [2019-09-07 09:17:01,594 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9138228/6e53dbf9c3d844f9b37bf7b84a82fb5b/FLAG87f461604 [2019-09-07 09:17:01,927 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f9138228/6e53dbf9c3d844f9b37bf7b84a82fb5b [2019-09-07 09:17:01,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-07 09:17:01,939 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-07 09:17:01,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-07 09:17:01,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-07 09:17:01,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-07 09:17:01,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:17:01" (1/1) ... [2019-09-07 09:17:01,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@545ef91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:17:01, skipping insertion in model container [2019-09-07 09:17:01,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.09 09:17:01" (1/1) ... [2019-09-07 09:17:01,955 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-07 09:17:01,974 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-07 09:17:02,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:17:02,162 INFO L188 MainTranslator]: Completed pre-run [2019-09-07 09:17:02,189 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-07 09:17:02,209 INFO L192 MainTranslator]: Completed translation [2019-09-07 09:17:02,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:17:02 WrapperNode [2019-09-07 09:17:02,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-07 09:17:02,211 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-07 09:17:02,211 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-07 09:17:02,211 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-07 09:17:02,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:17:02" (1/1) ... [2019-09-07 09:17:02,309 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:17:02" (1/1) ... [2019-09-07 09:17:02,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:17:02" (1/1) ... [2019-09-07 09:17:02,321 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:17:02" (1/1) ... [2019-09-07 09:17:02,329 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:17:02" (1/1) ... [2019-09-07 09:17:02,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:17:02" (1/1) ... [2019-09-07 09:17:02,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:17:02" (1/1) ... [2019-09-07 09:17:02,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-07 09:17:02,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-07 09:17:02,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-07 09:17:02,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-07 09:17:02,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:17:02" (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:17:02,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-07 09:17:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-07 09:17:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-07 09:17:02,397 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-07 09:17:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-07 09:17:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-07 09:17:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-07 09:17:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-07 09:17:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-07 09:17:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-07 09:17:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-07 09:17:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-07 09:17:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-07 09:17:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-07 09:17:02,705 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-07 09:17:02,705 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-07 09:17:02,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:17:02 BoogieIcfgContainer [2019-09-07 09:17:02,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-07 09:17:02,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-07 09:17:02,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-07 09:17:02,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-07 09:17:02,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.09 09:17:01" (1/3) ... [2019-09-07 09:17:02,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bca8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:17:02, skipping insertion in model container [2019-09-07 09:17:02,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.09 09:17:02" (2/3) ... [2019-09-07 09:17:02,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17bca8e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.09 09:17:02, skipping insertion in model container [2019-09-07 09:17:02,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.09 09:17:02" (3/3) ... [2019-09-07 09:17:02,714 INFO L109 eAbstractionObserver]: Analyzing ICFG sanfoundry_02_ground.i [2019-09-07 09:17:02,726 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-07 09:17:02,734 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-07 09:17:02,750 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-07 09:17:02,781 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-07 09:17:02,782 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-07 09:17:02,782 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-07 09:17:02,782 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-07 09:17:02,782 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-07 09:17:02,782 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-07 09:17:02,783 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-07 09:17:02,783 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-07 09:17:02,783 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-07 09:17:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-09-07 09:17:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 09:17:02,806 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:02,807 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:17:02,809 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:02,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1606204250, now seen corresponding path program 1 times [2019-09-07 09:17:02,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:02,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:02,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:02,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:02,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:02,953 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:17:02,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:17:02,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-07 09:17:02,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-07 09:17:02,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-07 09:17:02,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-07 09:17:02,972 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 2 states. [2019-09-07 09:17:02,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:02,997 INFO L93 Difference]: Finished difference Result 66 states and 92 transitions. [2019-09-07 09:17:02,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-07 09:17:02,999 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-09-07 09:17:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:03,009 INFO L225 Difference]: With dead ends: 66 [2019-09-07 09:17:03,009 INFO L226 Difference]: Without dead ends: 32 [2019-09-07 09:17:03,013 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:17:03,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-07 09:17:03,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-09-07 09:17:03,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-07 09:17:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-09-07 09:17:03,059 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2019-09-07 09:17:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:03,059 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-09-07 09:17:03,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-07 09:17:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-09-07 09:17:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-07 09:17:03,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:03,062 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:17:03,062 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:03,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:03,063 INFO L82 PathProgramCache]: Analyzing trace with hash -729587696, now seen corresponding path program 1 times [2019-09-07 09:17:03,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:03,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:03,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:03,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:03,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:03,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:03,126 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:17:03,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:17:03,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:17:03,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:17:03,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:17:03,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:17:03,135 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 3 states. [2019-09-07 09:17:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:03,228 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2019-09-07 09:17:03,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:17:03,228 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-09-07 09:17:03,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:03,230 INFO L225 Difference]: With dead ends: 58 [2019-09-07 09:17:03,230 INFO L226 Difference]: Without dead ends: 34 [2019-09-07 09:17:03,231 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:17:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-07 09:17:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-09-07 09:17:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-07 09:17:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-09-07 09:17:03,245 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 17 [2019-09-07 09:17:03,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:03,246 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-09-07 09:17:03,246 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:17:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-09-07 09:17:03,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-07 09:17:03,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:03,247 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:03,247 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:03,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:03,248 INFO L82 PathProgramCache]: Analyzing trace with hash 617787630, now seen corresponding path program 1 times [2019-09-07 09:17:03,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:03,250 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:03,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:03,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:03,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:03,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:03,325 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:17:03,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-07 09:17:03,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-07 09:17:03,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-07 09:17:03,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-07 09:17:03,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-07 09:17:03,327 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 3 states. [2019-09-07 09:17:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:03,371 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-09-07 09:17:03,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-07 09:17:03,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-07 09:17:03,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:03,373 INFO L225 Difference]: With dead ends: 55 [2019-09-07 09:17:03,373 INFO L226 Difference]: Without dead ends: 38 [2019-09-07 09:17:03,374 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:17:03,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-07 09:17:03,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-09-07 09:17:03,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-07 09:17:03,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-09-07 09:17:03,382 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 19 [2019-09-07 09:17:03,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:03,382 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-09-07 09:17:03,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-07 09:17:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-09-07 09:17:03,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-07 09:17:03,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:03,384 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:03,384 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:03,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1226217789, now seen corresponding path program 1 times [2019-09-07 09:17:03,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:03,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:03,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:03,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:03,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:03,480 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:17:03,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:03,480 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:17:03,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:03,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-07 09:17:03,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:03,582 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:17:03,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:03,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-09-07 09:17:03,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 09:17:03,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 09:17:03,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 09:17:03,593 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 6 states. [2019-09-07 09:17:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:03,718 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2019-09-07 09:17:03,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 09:17:03,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-09-07 09:17:03,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:03,720 INFO L225 Difference]: With dead ends: 73 [2019-09-07 09:17:03,720 INFO L226 Difference]: Without dead ends: 48 [2019-09-07 09:17:03,721 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 09:17:03,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-07 09:17:03,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2019-09-07 09:17:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-09-07 09:17:03,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2019-09-07 09:17:03,738 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 22 [2019-09-07 09:17:03,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:03,741 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2019-09-07 09:17:03,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 09:17:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2019-09-07 09:17:03,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-07 09:17:03,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:03,743 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:03,743 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:03,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:03,744 INFO L82 PathProgramCache]: Analyzing trace with hash 874149032, now seen corresponding path program 2 times [2019-09-07 09:17:03,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:03,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:03,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:03,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:03,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-07 09:17:03,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:03,860 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:03,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:17:03,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:17:03,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:03,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-07 09:17:03,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-07 09:17:03,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:03,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 7 [2019-09-07 09:17:03,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-07 09:17:03,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-07 09:17:03,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:17:03,964 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 7 states. [2019-09-07 09:17:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:04,081 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2019-09-07 09:17:04,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-07 09:17:04,082 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-07 09:17:04,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:04,083 INFO L225 Difference]: With dead ends: 83 [2019-09-07 09:17:04,084 INFO L226 Difference]: Without dead ends: 54 [2019-09-07 09:17:04,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-07 09:17:04,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-07 09:17:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-09-07 09:17:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-09-07 09:17:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 62 transitions. [2019-09-07 09:17:04,094 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 62 transitions. Word has length 31 [2019-09-07 09:17:04,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:04,095 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 62 transitions. [2019-09-07 09:17:04,095 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-07 09:17:04,095 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 62 transitions. [2019-09-07 09:17:04,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-07 09:17:04,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:04,096 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:04,096 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:04,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:04,097 INFO L82 PathProgramCache]: Analyzing trace with hash -31110619, now seen corresponding path program 3 times [2019-09-07 09:17:04,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:04,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:04,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:04,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:04,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:17:04,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:04,199 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:17:04,215 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:17:04,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-07 09:17:04,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:04,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-07 09:17:04,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:04,262 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-07 09:17:04,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:04,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-07 09:17:04,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-07 09:17:04,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-07 09:17:04,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 09:17:04,268 INFO L87 Difference]: Start difference. First operand 50 states and 62 transitions. Second operand 6 states. [2019-09-07 09:17:04,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:04,336 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2019-09-07 09:17:04,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-07 09:17:04,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-09-07 09:17:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:04,340 INFO L225 Difference]: With dead ends: 74 [2019-09-07 09:17:04,340 INFO L226 Difference]: Without dead ends: 57 [2019-09-07 09:17:04,340 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-07 09:17:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-09-07 09:17:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2019-09-07 09:17:04,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-09-07 09:17:04,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2019-09-07 09:17:04,348 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 36 [2019-09-07 09:17:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:04,348 INFO L475 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2019-09-07 09:17:04,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-07 09:17:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2019-09-07 09:17:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-07 09:17:04,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:04,350 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, 1, 1] [2019-09-07 09:17:04,350 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:04,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:04,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1546281126, now seen corresponding path program 4 times [2019-09-07 09:17:04,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:04,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:04,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:04,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:04,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:04,448 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:17:04,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:04,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:17:04,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:04,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:17:04,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:04,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-07 09:17:04,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:04,516 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 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:17:04,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:04,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2019-09-07 09:17:04,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 09:17:04,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 09:17:04,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 09:17:04,521 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand 9 states. [2019-09-07 09:17:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:04,619 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2019-09-07 09:17:04,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 09:17:04,620 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-09-07 09:17:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:04,621 INFO L225 Difference]: With dead ends: 103 [2019-09-07 09:17:04,621 INFO L226 Difference]: Without dead ends: 66 [2019-09-07 09:17:04,622 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 09:17:04,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-07 09:17:04,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2019-09-07 09:17:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-09-07 09:17:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 78 transitions. [2019-09-07 09:17:04,629 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 78 transitions. Word has length 39 [2019-09-07 09:17:04,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:04,629 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 78 transitions. [2019-09-07 09:17:04,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 09:17:04,629 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 78 transitions. [2019-09-07 09:17:04,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-07 09:17:04,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:04,631 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:04,631 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:04,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:04,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2027681847, now seen corresponding path program 5 times [2019-09-07 09:17:04,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:04,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:04,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:04,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:04,736 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-07 09:17:04,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:04,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:17:04,750 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:17:04,811 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-09-07 09:17:04,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:04,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-07 09:17:04,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:17:04,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:04,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 10 [2019-09-07 09:17:04,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-07 09:17:04,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-07 09:17:04,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 09:17:04,865 INFO L87 Difference]: Start difference. First operand 62 states and 78 transitions. Second operand 10 states. [2019-09-07 09:17:04,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:04,986 INFO L93 Difference]: Finished difference Result 113 states and 150 transitions. [2019-09-07 09:17:04,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-07 09:17:04,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2019-09-07 09:17:04,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:04,988 INFO L225 Difference]: With dead ends: 113 [2019-09-07 09:17:04,988 INFO L226 Difference]: Without dead ends: 72 [2019-09-07 09:17:04,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-09-07 09:17:04,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-09-07 09:17:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2019-09-07 09:17:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-07 09:17:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2019-09-07 09:17:05,005 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 46 [2019-09-07 09:17:05,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:05,005 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2019-09-07 09:17:05,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-07 09:17:05,006 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2019-09-07 09:17:05,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-07 09:17:05,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:05,009 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:05,009 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:05,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:05,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2134546080, now seen corresponding path program 6 times [2019-09-07 09:17:05,010 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:05,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:05,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 09:17:05,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:05,168 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:17:05,188 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:17:05,263 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-09-07 09:17:05,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:05,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-07 09:17:05,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:05,281 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 09:17:05,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:05,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-09-07 09:17:05,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-07 09:17:05,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-07 09:17:05,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 09:17:05,294 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand 9 states. [2019-09-07 09:17:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:05,413 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2019-09-07 09:17:05,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-07 09:17:05,414 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-09-07 09:17:05,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:05,418 INFO L225 Difference]: With dead ends: 92 [2019-09-07 09:17:05,418 INFO L226 Difference]: Without dead ends: 75 [2019-09-07 09:17:05,419 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-09-07 09:17:05,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-09-07 09:17:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-09-07 09:17:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-07 09:17:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2019-09-07 09:17:05,435 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 51 [2019-09-07 09:17:05,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:05,437 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2019-09-07 09:17:05,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-07 09:17:05,438 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2019-09-07 09:17:05,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-07 09:17:05,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:05,439 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:05,439 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:05,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:05,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1673311115, now seen corresponding path program 7 times [2019-09-07 09:17:05,440 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:05,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:05,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:05,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:05,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:05,576 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-09-07 09:17:05,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:05,576 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) [2019-09-07 09:17:05,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:05,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-07 09:17:05,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-07 09:17:05,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:05,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 12 [2019-09-07 09:17:05,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 09:17:05,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 09:17:05,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 09:17:05,692 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 12 states. [2019-09-07 09:17:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:05,824 INFO L93 Difference]: Finished difference Result 133 states and 179 transitions. [2019-09-07 09:17:05,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 09:17:05,825 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-09-07 09:17:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:05,826 INFO L225 Difference]: With dead ends: 133 [2019-09-07 09:17:05,826 INFO L226 Difference]: Without dead ends: 84 [2019-09-07 09:17:05,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 09:17:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-09-07 09:17:05,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2019-09-07 09:17:05,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-07 09:17:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 102 transitions. [2019-09-07 09:17:05,835 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 102 transitions. Word has length 54 [2019-09-07 09:17:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:05,835 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 102 transitions. [2019-09-07 09:17:05,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 09:17:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2019-09-07 09:17:05,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-07 09:17:05,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:05,837 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:05,837 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash -5592132, now seen corresponding path program 8 times [2019-09-07 09:17:05,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:05,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:05,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-07 09:17:05,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:05,938 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:17:05,951 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:17:05,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:17:05,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:05,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-07 09:17:05,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-09-07 09:17:06,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:06,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 13 [2019-09-07 09:17:06,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-07 09:17:06,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-07 09:17:06,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:17:06,027 INFO L87 Difference]: Start difference. First operand 80 states and 102 transitions. Second operand 13 states. [2019-09-07 09:17:06,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:06,157 INFO L93 Difference]: Finished difference Result 143 states and 192 transitions. [2019-09-07 09:17:06,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-07 09:17:06,158 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 61 [2019-09-07 09:17:06,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:06,159 INFO L225 Difference]: With dead ends: 143 [2019-09-07 09:17:06,159 INFO L226 Difference]: Without dead ends: 90 [2019-09-07 09:17:06,160 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-09-07 09:17:06,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-09-07 09:17:06,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2019-09-07 09:17:06,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-07 09:17:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2019-09-07 09:17:06,168 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 61 [2019-09-07 09:17:06,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:06,168 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2019-09-07 09:17:06,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-07 09:17:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2019-09-07 09:17:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-07 09:17:06,185 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:06,185 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:06,186 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:06,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:06,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1895895825, now seen corresponding path program 9 times [2019-09-07 09:17:06,186 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:06,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:06,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:06,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:06,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:06,319 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 09:17:06,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:06,320 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:17:06,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:17:06,403 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-07 09:17:06,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:06,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-07 09:17:06,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 09:17:06,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:06,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2019-09-07 09:17:06,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-07 09:17:06,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-07 09:17:06,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 09:17:06,434 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand 12 states. [2019-09-07 09:17:06,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:06,563 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2019-09-07 09:17:06,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-07 09:17:06,564 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-09-07 09:17:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:06,565 INFO L225 Difference]: With dead ends: 110 [2019-09-07 09:17:06,566 INFO L226 Difference]: Without dead ends: 93 [2019-09-07 09:17:06,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-09-07 09:17:06,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-09-07 09:17:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2019-09-07 09:17:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-09-07 09:17:06,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 116 transitions. [2019-09-07 09:17:06,573 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 116 transitions. Word has length 66 [2019-09-07 09:17:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:06,573 INFO L475 AbstractCegarLoop]: Abstraction has 90 states and 116 transitions. [2019-09-07 09:17:06,573 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-07 09:17:06,573 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 116 transitions. [2019-09-07 09:17:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-07 09:17:06,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:06,574 INFO L399 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:06,575 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:06,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1832591302, now seen corresponding path program 10 times [2019-09-07 09:17:06,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:06,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:06,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:06,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:06,698 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-09-07 09:17:06,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:06,699 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:17:06,712 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:06,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:17:06,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:06,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 09:17:06,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-09-07 09:17:06,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:06,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 15 [2019-09-07 09:17:06,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-07 09:17:06,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-07 09:17:06,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:17:06,787 INFO L87 Difference]: Start difference. First operand 90 states and 116 transitions. Second operand 15 states. [2019-09-07 09:17:06,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:06,989 INFO L93 Difference]: Finished difference Result 163 states and 221 transitions. [2019-09-07 09:17:06,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-07 09:17:06,990 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2019-09-07 09:17:06,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:06,992 INFO L225 Difference]: With dead ends: 163 [2019-09-07 09:17:06,992 INFO L226 Difference]: Without dead ends: 102 [2019-09-07 09:17:06,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-09-07 09:17:06,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-07 09:17:06,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 98. [2019-09-07 09:17:06,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-07 09:17:07,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 126 transitions. [2019-09-07 09:17:07,000 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 126 transitions. Word has length 69 [2019-09-07 09:17:07,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:07,000 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 126 transitions. [2019-09-07 09:17:07,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-07 09:17:07,001 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 126 transitions. [2019-09-07 09:17:07,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-07 09:17:07,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:07,002 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:07,002 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:07,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:07,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1016848565, now seen corresponding path program 11 times [2019-09-07 09:17:07,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:07,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:07,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:07,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:07,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:07,187 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 09:17:07,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:07,187 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:17:07,208 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:07,396 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2019-09-07 09:17:07,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:07,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-07 09:17:07,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 09:17:07,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:07,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2019-09-07 09:17:07,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-07 09:17:07,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-07 09:17:07,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 09:17:07,435 INFO L87 Difference]: Start difference. First operand 98 states and 126 transitions. Second operand 14 states. [2019-09-07 09:17:07,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:07,583 INFO L93 Difference]: Finished difference Result 122 states and 158 transitions. [2019-09-07 09:17:07,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-07 09:17:07,584 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 76 [2019-09-07 09:17:07,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:07,585 INFO L225 Difference]: With dead ends: 122 [2019-09-07 09:17:07,585 INFO L226 Difference]: Without dead ends: 105 [2019-09-07 09:17:07,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-09-07 09:17:07,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-07 09:17:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-09-07 09:17:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-09-07 09:17:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 132 transitions. [2019-09-07 09:17:07,598 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 132 transitions. Word has length 76 [2019-09-07 09:17:07,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:07,599 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 132 transitions. [2019-09-07 09:17:07,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-07 09:17:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 132 transitions. [2019-09-07 09:17:07,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-07 09:17:07,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:07,600 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:07,600 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:07,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:07,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1181057046, now seen corresponding path program 12 times [2019-09-07 09:17:07,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:07,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:07,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:07,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:07,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:07,802 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2019-09-07 09:17:07,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:07,803 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:17:07,821 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:17:07,969 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2019-09-07 09:17:07,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:07,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-07 09:17:07,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-09-07 09:17:08,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:08,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 17 [2019-09-07 09:17:08,022 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-07 09:17:08,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-07 09:17:08,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 09:17:08,023 INFO L87 Difference]: Start difference. First operand 102 states and 132 transitions. Second operand 17 states. [2019-09-07 09:17:08,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:08,211 INFO L93 Difference]: Finished difference Result 183 states and 249 transitions. [2019-09-07 09:17:08,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-07 09:17:08,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2019-09-07 09:17:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:08,215 INFO L225 Difference]: With dead ends: 183 [2019-09-07 09:17:08,215 INFO L226 Difference]: Without dead ends: 114 [2019-09-07 09:17:08,216 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-09-07 09:17:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-09-07 09:17:08,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-09-07 09:17:08,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-09-07 09:17:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 142 transitions. [2019-09-07 09:17:08,221 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 142 transitions. Word has length 79 [2019-09-07 09:17:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:08,222 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 142 transitions. [2019-09-07 09:17:08,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-07 09:17:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 142 transitions. [2019-09-07 09:17:08,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-07 09:17:08,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:08,223 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:08,223 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:08,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:08,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2102517337, now seen corresponding path program 13 times [2019-09-07 09:17:08,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:08,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:08,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:08,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:08,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:08,428 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2019-09-07 09:17:08,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:08,428 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) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:08,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:08,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 09:17:08,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2019-09-07 09:17:08,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:08,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 18 [2019-09-07 09:17:08,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 09:17:08,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 09:17:08,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 09:17:08,530 INFO L87 Difference]: Start difference. First operand 110 states and 142 transitions. Second operand 18 states. [2019-09-07 09:17:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:08,722 INFO L93 Difference]: Finished difference Result 193 states and 262 transitions. [2019-09-07 09:17:08,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 09:17:08,725 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 86 [2019-09-07 09:17:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:08,726 INFO L225 Difference]: With dead ends: 193 [2019-09-07 09:17:08,726 INFO L226 Difference]: Without dead ends: 120 [2019-09-07 09:17:08,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 09:17:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-07 09:17:08,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2019-09-07 09:17:08,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-09-07 09:17:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 150 transitions. [2019-09-07 09:17:08,732 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 150 transitions. Word has length 86 [2019-09-07 09:17:08,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:08,732 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 150 transitions. [2019-09-07 09:17:08,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 09:17:08,733 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 150 transitions. [2019-09-07 09:17:08,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-07 09:17:08,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:08,734 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:08,734 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:08,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:08,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1364290864, now seen corresponding path program 14 times [2019-09-07 09:17:08,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:08,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:08,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:08,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:08,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2019-09-07 09:17:08,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:08,917 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:08,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:17:08,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:17:08,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:08,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-07 09:17:08,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:09,027 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-07 09:17:09,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:09,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 19 [2019-09-07 09:17:09,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-07 09:17:09,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-07 09:17:09,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:17:09,041 INFO L87 Difference]: Start difference. First operand 116 states and 150 transitions. Second operand 19 states. [2019-09-07 09:17:09,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:09,209 INFO L93 Difference]: Finished difference Result 203 states and 276 transitions. [2019-09-07 09:17:09,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-07 09:17:09,210 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 91 [2019-09-07 09:17:09,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:09,211 INFO L225 Difference]: With dead ends: 203 [2019-09-07 09:17:09,211 INFO L226 Difference]: Without dead ends: 126 [2019-09-07 09:17:09,212 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-09-07 09:17:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-09-07 09:17:09,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2019-09-07 09:17:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-07 09:17:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 158 transitions. [2019-09-07 09:17:09,217 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 158 transitions. Word has length 91 [2019-09-07 09:17:09,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:09,218 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 158 transitions. [2019-09-07 09:17:09,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-07 09:17:09,218 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 158 transitions. [2019-09-07 09:17:09,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-07 09:17:09,219 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:09,219 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:09,219 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:09,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:09,220 INFO L82 PathProgramCache]: Analyzing trace with hash 213994493, now seen corresponding path program 15 times [2019-09-07 09:17:09,220 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:09,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:09,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:09,221 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:09,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:09,399 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 09:17:09,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:09,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:09,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:17:09,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-07 09:17:09,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:09,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-07 09:17:09,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 09:17:09,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:09,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2019-09-07 09:17:09,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-07 09:17:09,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-07 09:17:09,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 09:17:09,658 INFO L87 Difference]: Start difference. First operand 122 states and 158 transitions. Second operand 18 states. [2019-09-07 09:17:09,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:09,838 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2019-09-07 09:17:09,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-07 09:17:09,839 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 96 [2019-09-07 09:17:09,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:09,840 INFO L225 Difference]: With dead ends: 146 [2019-09-07 09:17:09,840 INFO L226 Difference]: Without dead ends: 129 [2019-09-07 09:17:09,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-09-07 09:17:09,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-09-07 09:17:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-09-07 09:17:09,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-09-07 09:17:09,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 164 transitions. [2019-09-07 09:17:09,847 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 164 transitions. Word has length 96 [2019-09-07 09:17:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:09,847 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 164 transitions. [2019-09-07 09:17:09,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-07 09:17:09,847 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 164 transitions. [2019-09-07 09:17:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-07 09:17:09,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:09,848 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:09,849 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:09,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:09,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2028269518, now seen corresponding path program 16 times [2019-09-07 09:17:09,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:09,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:09,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:09,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:09,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2019-09-07 09:17:10,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:10,063 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17:10,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:17:10,133 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:17:10,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:10,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 09:17:10,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2019-09-07 09:17:10,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:10,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 21 [2019-09-07 09:17:10,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 09:17:10,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 09:17:10,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:17:10,178 INFO L87 Difference]: Start difference. First operand 126 states and 164 transitions. Second operand 21 states. [2019-09-07 09:17:10,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:10,436 INFO L93 Difference]: Finished difference Result 223 states and 305 transitions. [2019-09-07 09:17:10,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 09:17:10,450 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2019-09-07 09:17:10,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:10,451 INFO L225 Difference]: With dead ends: 223 [2019-09-07 09:17:10,451 INFO L226 Difference]: Without dead ends: 138 [2019-09-07 09:17:10,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:17:10,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-09-07 09:17:10,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 134. [2019-09-07 09:17:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-09-07 09:17:10,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 174 transitions. [2019-09-07 09:17:10,458 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 174 transitions. Word has length 99 [2019-09-07 09:17:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:10,458 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 174 transitions. [2019-09-07 09:17:10,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 09:17:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 174 transitions. [2019-09-07 09:17:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-07 09:17:10,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:10,460 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:10,460 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:10,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:10,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1191733665, now seen corresponding path program 17 times [2019-09-07 09:17:10,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:10,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:10,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:10,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:10,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 09:17:10,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:10,735 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:10,746 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:17:11,146 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-09-07 09:17:11,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:11,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-07 09:17:11,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 09:17:11,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:11,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2019-09-07 09:17:11,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-07 09:17:11,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-07 09:17:11,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 09:17:11,185 INFO L87 Difference]: Start difference. First operand 134 states and 174 transitions. Second operand 20 states. [2019-09-07 09:17:11,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:11,377 INFO L93 Difference]: Finished difference Result 158 states and 206 transitions. [2019-09-07 09:17:11,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-07 09:17:11,378 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 106 [2019-09-07 09:17:11,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:11,379 INFO L225 Difference]: With dead ends: 158 [2019-09-07 09:17:11,379 INFO L226 Difference]: Without dead ends: 141 [2019-09-07 09:17:11,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-09-07 09:17:11,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-07 09:17:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2019-09-07 09:17:11,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-09-07 09:17:11,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 180 transitions. [2019-09-07 09:17:11,387 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 180 transitions. Word has length 106 [2019-09-07 09:17:11,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:11,388 INFO L475 AbstractCegarLoop]: Abstraction has 138 states and 180 transitions. [2019-09-07 09:17:11,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-07 09:17:11,388 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 180 transitions. [2019-09-07 09:17:11,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-07 09:17:11,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:11,389 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:11,389 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:11,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:11,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1387741098, now seen corresponding path program 18 times [2019-09-07 09:17:11,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:11,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:11,392 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:11,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 09:17:11,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:11,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 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:17:11,645 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:17:12,354 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-09-07 09:17:12,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:12,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 20 conjunts are in the unsatisfiable core [2019-09-07 09:17:12,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 838 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:17:12,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:12,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2019-09-07 09:17:12,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-07 09:17:12,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-07 09:17:12,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:17:12,408 INFO L87 Difference]: Start difference. First operand 138 states and 180 transitions. Second operand 21 states. [2019-09-07 09:17:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:12,596 INFO L93 Difference]: Finished difference Result 163 states and 213 transitions. [2019-09-07 09:17:12,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-07 09:17:12,596 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 109 [2019-09-07 09:17:12,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:12,598 INFO L225 Difference]: With dead ends: 163 [2019-09-07 09:17:12,598 INFO L226 Difference]: Without dead ends: 146 [2019-09-07 09:17:12,599 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-09-07 09:17:12,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-07 09:17:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2019-09-07 09:17:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-09-07 09:17:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 186 transitions. [2019-09-07 09:17:12,604 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 186 transitions. Word has length 109 [2019-09-07 09:17:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:12,605 INFO L475 AbstractCegarLoop]: Abstraction has 142 states and 186 transitions. [2019-09-07 09:17:12,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-07 09:17:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 186 transitions. [2019-09-07 09:17:12,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-07 09:17:12,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:12,606 INFO L399 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:12,606 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:12,606 INFO L82 PathProgramCache]: Analyzing trace with hash -510344959, now seen corresponding path program 19 times [2019-09-07 09:17:12,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:12,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:12,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:12,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:12,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-09-07 09:17:12,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:12,856 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:17:12,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:12,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-07 09:17:12,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:12,953 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2019-09-07 09:17:12,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:12,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2019-09-07 09:17:12,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 09:17:12,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 09:17:12,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:17:12,957 INFO L87 Difference]: Start difference. First operand 142 states and 186 transitions. Second operand 24 states. [2019-09-07 09:17:13,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:13,216 INFO L93 Difference]: Finished difference Result 253 states and 348 transitions. [2019-09-07 09:17:13,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 09:17:13,218 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 112 [2019-09-07 09:17:13,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:13,219 INFO L225 Difference]: With dead ends: 253 [2019-09-07 09:17:13,219 INFO L226 Difference]: Without dead ends: 156 [2019-09-07 09:17:13,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:17:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-09-07 09:17:13,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2019-09-07 09:17:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-09-07 09:17:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 198 transitions. [2019-09-07 09:17:13,224 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 198 transitions. Word has length 112 [2019-09-07 09:17:13,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:13,225 INFO L475 AbstractCegarLoop]: Abstraction has 152 states and 198 transitions. [2019-09-07 09:17:13,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 09:17:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 198 transitions. [2019-09-07 09:17:13,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-07 09:17:13,226 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:13,226 INFO L399 BasicCegarLoop]: trace histogram [22, 22, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:13,226 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:13,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:13,227 INFO L82 PathProgramCache]: Analyzing trace with hash 380987876, now seen corresponding path program 20 times [2019-09-07 09:17:13,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:13,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:13,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:13,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:13,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2019-09-07 09:17:13,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:13,558 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:17:13,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:17:13,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:17:13,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:13,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-07 09:17:13,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:13,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2019-09-07 09:17:13,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:13,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 25 [2019-09-07 09:17:13,666 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-07 09:17:13,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-07 09:17:13,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:17:13,667 INFO L87 Difference]: Start difference. First operand 152 states and 198 transitions. Second operand 25 states. [2019-09-07 09:17:13,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:13,914 INFO L93 Difference]: Finished difference Result 263 states and 360 transitions. [2019-09-07 09:17:13,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-07 09:17:13,915 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2019-09-07 09:17:13,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:13,916 INFO L225 Difference]: With dead ends: 263 [2019-09-07 09:17:13,917 INFO L226 Difference]: Without dead ends: 162 [2019-09-07 09:17:13,918 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-09-07 09:17:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-07 09:17:13,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2019-09-07 09:17:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-09-07 09:17:13,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 206 transitions. [2019-09-07 09:17:13,924 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 206 transitions. Word has length 121 [2019-09-07 09:17:13,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:13,925 INFO L475 AbstractCegarLoop]: Abstraction has 158 states and 206 transitions. [2019-09-07 09:17:13,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-07 09:17:13,926 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 206 transitions. [2019-09-07 09:17:13,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-07 09:17:13,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:13,927 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:13,927 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:13,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:13,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1860782871, now seen corresponding path program 21 times [2019-09-07 09:17:13,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:13,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:13,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:13,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:13,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:14,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 09:17:14,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:14,218 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:17:14,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:17:14,983 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-09-07 09:17:14,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:14,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-07 09:17:14,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (22)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:17:15,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:15,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2019-09-07 09:17:15,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-07 09:17:15,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-07 09:17:15,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:17:15,023 INFO L87 Difference]: Start difference. First operand 158 states and 206 transitions. Second operand 24 states. [2019-09-07 09:17:15,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:15,277 INFO L93 Difference]: Finished difference Result 182 states and 238 transitions. [2019-09-07 09:17:15,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-07 09:17:15,277 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 126 [2019-09-07 09:17:15,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:15,279 INFO L225 Difference]: With dead ends: 182 [2019-09-07 09:17:15,279 INFO L226 Difference]: Without dead ends: 165 [2019-09-07 09:17:15,279 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-09-07 09:17:15,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-09-07 09:17:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2019-09-07 09:17:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-07 09:17:15,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 212 transitions. [2019-09-07 09:17:15,286 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 212 transitions. Word has length 126 [2019-09-07 09:17:15,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:15,286 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 212 transitions. [2019-09-07 09:17:15,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-07 09:17:15,286 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 212 transitions. [2019-09-07 09:17:15,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-07 09:17:15,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:15,287 INFO L399 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:15,288 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:15,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:15,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1210175330, now seen corresponding path program 22 times [2019-09-07 09:17:15,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:15,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:15,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:15,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:15,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2019-09-07 09:17:15,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:15,721 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) [2019-09-07 09:17:15,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:15,807 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:17:15,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:15,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 09:17:15,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1244 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-09-07 09:17:15,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:15,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 27 [2019-09-07 09:17:15,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-07 09:17:15,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-07 09:17:15,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 09:17:15,843 INFO L87 Difference]: Start difference. First operand 162 states and 212 transitions. Second operand 27 states. [2019-09-07 09:17:16,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:16,098 INFO L93 Difference]: Finished difference Result 283 states and 389 transitions. [2019-09-07 09:17:16,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-07 09:17:16,099 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 129 [2019-09-07 09:17:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:16,100 INFO L225 Difference]: With dead ends: 283 [2019-09-07 09:17:16,101 INFO L226 Difference]: Without dead ends: 174 [2019-09-07 09:17:16,101 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-09-07 09:17:16,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-09-07 09:17:16,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2019-09-07 09:17:16,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-09-07 09:17:16,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 222 transitions. [2019-09-07 09:17:16,108 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 222 transitions. Word has length 129 [2019-09-07 09:17:16,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:16,108 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 222 transitions. [2019-09-07 09:17:16,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-07 09:17:16,108 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 222 transitions. [2019-09-07 09:17:16,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-07 09:17:16,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:16,110 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:16,110 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:16,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:16,110 INFO L82 PathProgramCache]: Analyzing trace with hash 697983629, now seen corresponding path program 23 times [2019-09-07 09:17:16,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:16,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:16,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:16,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:16,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-07 09:17:16,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:16,572 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) [2019-09-07 09:17:16,588 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:17,538 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 26 check-sat command(s) [2019-09-07 09:17:17,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:17,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-07 09:17:17,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1407 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-07 09:17:17,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:17,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2019-09-07 09:17:17,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-07 09:17:17,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-07 09:17:17,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 09:17:17,577 INFO L87 Difference]: Start difference. First operand 170 states and 222 transitions. Second operand 26 states. [2019-09-07 09:17:17,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:17,868 INFO L93 Difference]: Finished difference Result 194 states and 254 transitions. [2019-09-07 09:17:17,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-07 09:17:17,869 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 136 [2019-09-07 09:17:17,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:17,871 INFO L225 Difference]: With dead ends: 194 [2019-09-07 09:17:17,871 INFO L226 Difference]: Without dead ends: 177 [2019-09-07 09:17:17,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-09-07 09:17:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-09-07 09:17:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2019-09-07 09:17:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-09-07 09:17:17,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 228 transitions. [2019-09-07 09:17:17,880 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 228 transitions. Word has length 136 [2019-09-07 09:17:17,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:17,881 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 228 transitions. [2019-09-07 09:17:17,881 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-07 09:17:17,881 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 228 transitions. [2019-09-07 09:17:17,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-07 09:17:17,883 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:17,883 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:17,883 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:17,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:17,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1951559874, now seen corresponding path program 24 times [2019-09-07 09:17:17,884 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:17,884 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:17,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:17,885 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:17,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1477 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2019-09-07 09:17:18,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:18,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:17:18,426 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:19,597 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2019-09-07 09:17:19,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:19,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-07 09:17:19,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:19,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1477 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 852 trivial. 0 not checked. [2019-09-07 09:17:19,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:19,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 29 [2019-09-07 09:17:19,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-07 09:17:19,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-07 09:17:19,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 09:17:19,639 INFO L87 Difference]: Start difference. First operand 174 states and 228 transitions. Second operand 29 states. [2019-09-07 09:17:19,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:19,916 INFO L93 Difference]: Finished difference Result 303 states and 417 transitions. [2019-09-07 09:17:19,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-07 09:17:19,917 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 139 [2019-09-07 09:17:19,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:19,918 INFO L225 Difference]: With dead ends: 303 [2019-09-07 09:17:19,918 INFO L226 Difference]: Without dead ends: 186 [2019-09-07 09:17:19,920 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-09-07 09:17:19,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-09-07 09:17:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 182. [2019-09-07 09:17:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-09-07 09:17:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 238 transitions. [2019-09-07 09:17:19,927 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 238 transitions. Word has length 139 [2019-09-07 09:17:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:19,927 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 238 transitions. [2019-09-07 09:17:19,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-07 09:17:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 238 transitions. [2019-09-07 09:17:19,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-07 09:17:19,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:19,928 INFO L399 BasicCegarLoop]: trace histogram [27, 27, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:19,929 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:19,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:19,930 INFO L82 PathProgramCache]: Analyzing trace with hash -965820367, now seen corresponding path program 25 times [2019-09-07 09:17:19,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:19,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:19,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:19,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:19,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:20,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-07 09:17:20,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:20,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:17:20,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:20,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 09:17:20,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 925 trivial. 0 not checked. [2019-09-07 09:17:20,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:20,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30] total 30 [2019-09-07 09:17:20,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 09:17:20,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 09:17:20,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:17:20,498 INFO L87 Difference]: Start difference. First operand 182 states and 238 transitions. Second operand 30 states. [2019-09-07 09:17:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:20,816 INFO L93 Difference]: Finished difference Result 313 states and 430 transitions. [2019-09-07 09:17:20,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 09:17:20,818 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 146 [2019-09-07 09:17:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:20,819 INFO L225 Difference]: With dead ends: 313 [2019-09-07 09:17:20,819 INFO L226 Difference]: Without dead ends: 192 [2019-09-07 09:17:20,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:17:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-09-07 09:17:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2019-09-07 09:17:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-09-07 09:17:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 246 transitions. [2019-09-07 09:17:20,826 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 246 transitions. Word has length 146 [2019-09-07 09:17:20,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:20,826 INFO L475 AbstractCegarLoop]: Abstraction has 188 states and 246 transitions. [2019-09-07 09:17:20,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 09:17:20,827 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 246 transitions. [2019-09-07 09:17:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-07 09:17:20,828 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:20,828 INFO L399 BasicCegarLoop]: trace histogram [28, 28, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:20,828 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:20,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:20,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1865518856, now seen corresponding path program 26 times [2019-09-07 09:17:20,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:20,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:20,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:20,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:20,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:21,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-09-07 09:17:21,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:21,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-07 09:17:21,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:21,421 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:17:21,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:21,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-07 09:17:21,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1785 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 1001 trivial. 0 not checked. [2019-09-07 09:17:21,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:21,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 31] total 31 [2019-09-07 09:17:21,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-07 09:17:21,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-07 09:17:21,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:17:21,503 INFO L87 Difference]: Start difference. First operand 188 states and 246 transitions. Second operand 31 states. [2019-09-07 09:17:21,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:21,813 INFO L93 Difference]: Finished difference Result 323 states and 444 transitions. [2019-09-07 09:17:21,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-07 09:17:21,814 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 151 [2019-09-07 09:17:21,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:21,818 INFO L225 Difference]: With dead ends: 323 [2019-09-07 09:17:21,819 INFO L226 Difference]: Without dead ends: 198 [2019-09-07 09:17:21,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-09-07 09:17:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-09-07 09:17:21,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 194. [2019-09-07 09:17:21,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-07 09:17:21,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 254 transitions. [2019-09-07 09:17:21,829 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 254 transitions. Word has length 151 [2019-09-07 09:17:21,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:21,830 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 254 transitions. [2019-09-07 09:17:21,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-07 09:17:21,830 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 254 transitions. [2019-09-07 09:17:21,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-07 09:17:21,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:21,831 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:21,831 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:21,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:21,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1815219669, now seen corresponding path program 27 times [2019-09-07 09:17:21,831 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:21,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:21,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:21,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:21,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1921 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-07 09:17:22,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:22,281 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:17:22,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:25,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-09-07 09:17:25,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:25,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-07 09:17:25,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:25,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1921 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:17:25,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:25,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2019-09-07 09:17:25,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-07 09:17:25,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-07 09:17:25,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:17:25,416 INFO L87 Difference]: Start difference. First operand 194 states and 254 transitions. Second operand 30 states. [2019-09-07 09:17:25,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:25,763 INFO L93 Difference]: Finished difference Result 218 states and 286 transitions. [2019-09-07 09:17:25,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-07 09:17:25,763 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 156 [2019-09-07 09:17:25,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:25,764 INFO L225 Difference]: With dead ends: 218 [2019-09-07 09:17:25,764 INFO L226 Difference]: Without dead ends: 201 [2019-09-07 09:17:25,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-09-07 09:17:25,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-09-07 09:17:25,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2019-09-07 09:17:25,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-09-07 09:17:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 260 transitions. [2019-09-07 09:17:25,772 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 260 transitions. Word has length 156 [2019-09-07 09:17:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:25,772 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 260 transitions. [2019-09-07 09:17:25,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-07 09:17:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 260 transitions. [2019-09-07 09:17:25,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-07 09:17:25,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:25,774 INFO L399 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:25,774 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:25,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:25,774 INFO L82 PathProgramCache]: Analyzing trace with hash -74268938, now seen corresponding path program 28 times [2019-09-07 09:17:25,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:25,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:25,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:25,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:26,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2019-09-07 09:17:26,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:26,291 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:17:26,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:26,405 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:17:26,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:26,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-07 09:17:26,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:26,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2003 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 1162 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:17:26,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:26,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 33 [2019-09-07 09:17:26,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-07 09:17:26,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-07 09:17:26,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 09:17:26,459 INFO L87 Difference]: Start difference. First operand 198 states and 260 transitions. Second operand 33 states. [2019-09-07 09:17:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:26,819 INFO L93 Difference]: Finished difference Result 343 states and 473 transitions. [2019-09-07 09:17:26,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-07 09:17:26,819 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 159 [2019-09-07 09:17:26,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:26,821 INFO L225 Difference]: With dead ends: 343 [2019-09-07 09:17:26,821 INFO L226 Difference]: Without dead ends: 210 [2019-09-07 09:17:26,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-09-07 09:17:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-09-07 09:17:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 206. [2019-09-07 09:17:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-09-07 09:17:26,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 270 transitions. [2019-09-07 09:17:26,829 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 270 transitions. Word has length 159 [2019-09-07 09:17:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:26,830 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 270 transitions. [2019-09-07 09:17:26,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-07 09:17:26,830 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 270 transitions. [2019-09-07 09:17:26,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-07 09:17:26,831 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:26,831 INFO L399 BasicCegarLoop]: trace histogram [31, 31, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:26,832 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:26,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:26,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2046987129, now seen corresponding path program 29 times [2019-09-07 09:17:26,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:26,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:26,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:26,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:26,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 961 trivial. 0 not checked. [2019-09-07 09:17:27,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:27,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:27,479 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:17:28,950 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2019-09-07 09:17:28,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:28,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-07 09:17:28,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:28,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2208 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1247 trivial. 0 not checked. [2019-09-07 09:17:28,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:28,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 34 [2019-09-07 09:17:28,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-07 09:17:28,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-07 09:17:28,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:17:28,998 INFO L87 Difference]: Start difference. First operand 206 states and 270 transitions. Second operand 34 states. [2019-09-07 09:17:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:29,356 INFO L93 Difference]: Finished difference Result 353 states and 486 transitions. [2019-09-07 09:17:29,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-07 09:17:29,357 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 166 [2019-09-07 09:17:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:29,358 INFO L225 Difference]: With dead ends: 353 [2019-09-07 09:17:29,358 INFO L226 Difference]: Without dead ends: 216 [2019-09-07 09:17:29,359 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-09-07 09:17:29,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-09-07 09:17:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 212. [2019-09-07 09:17:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-07 09:17:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 278 transitions. [2019-09-07 09:17:29,365 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 278 transitions. Word has length 166 [2019-09-07 09:17:29,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:29,366 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 278 transitions. [2019-09-07 09:17:29,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-07 09:17:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 278 transitions. [2019-09-07 09:17:29,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-07 09:17:29,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:29,367 INFO L399 BasicCegarLoop]: trace histogram [32, 32, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:29,367 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:29,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:29,368 INFO L82 PathProgramCache]: Analyzing trace with hash 710272432, now seen corresponding path program 30 times [2019-09-07 09:17:29,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:29,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:29,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:29,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:29,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:29,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2359 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2019-09-07 09:17:29,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:29,959 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:17:29,989 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:37,111 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2019-09-07 09:17:37,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:37,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-07 09:17:37,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:37,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2359 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1335 trivial. 0 not checked. [2019-09-07 09:17:37,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:37,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 35] total 35 [2019-09-07 09:17:37,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-09-07 09:17:37,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-09-07 09:17:37,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:17:37,191 INFO L87 Difference]: Start difference. First operand 212 states and 278 transitions. Second operand 35 states. [2019-09-07 09:17:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:37,585 INFO L93 Difference]: Finished difference Result 363 states and 500 transitions. [2019-09-07 09:17:37,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-07 09:17:37,586 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 171 [2019-09-07 09:17:37,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:37,587 INFO L225 Difference]: With dead ends: 363 [2019-09-07 09:17:37,587 INFO L226 Difference]: Without dead ends: 222 [2019-09-07 09:17:37,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-09-07 09:17:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-09-07 09:17:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 218. [2019-09-07 09:17:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2019-09-07 09:17:37,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 286 transitions. [2019-09-07 09:17:37,595 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 286 transitions. Word has length 171 [2019-09-07 09:17:37,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:37,596 INFO L475 AbstractCegarLoop]: Abstraction has 218 states and 286 transitions. [2019-09-07 09:17:37,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-09-07 09:17:37,596 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 286 transitions. [2019-09-07 09:17:37,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-07 09:17:37,597 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:37,597 INFO L399 BasicCegarLoop]: trace histogram [33, 33, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:37,597 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:37,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:37,598 INFO L82 PathProgramCache]: Analyzing trace with hash -847349475, now seen corresponding path program 31 times [2019-09-07 09:17:37,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:37,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:37,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:37,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:37,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:37,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2515 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 1089 trivial. 0 not checked. [2019-09-07 09:17:38,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:38,065 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) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:38,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:38,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 09:17:38,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2515 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 1426 trivial. 0 not checked. [2019-09-07 09:17:38,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:38,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36] total 36 [2019-09-07 09:17:38,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 09:17:38,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 09:17:38,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:17:38,235 INFO L87 Difference]: Start difference. First operand 218 states and 286 transitions. Second operand 36 states. [2019-09-07 09:17:38,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:38,577 INFO L93 Difference]: Finished difference Result 373 states and 514 transitions. [2019-09-07 09:17:38,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 09:17:38,578 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 176 [2019-09-07 09:17:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:38,579 INFO L225 Difference]: With dead ends: 373 [2019-09-07 09:17:38,579 INFO L226 Difference]: Without dead ends: 228 [2019-09-07 09:17:38,580 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:17:38,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2019-09-07 09:17:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2019-09-07 09:17:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-09-07 09:17:38,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 294 transitions. [2019-09-07 09:17:38,589 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 294 transitions. Word has length 176 [2019-09-07 09:17:38,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:38,590 INFO L475 AbstractCegarLoop]: Abstraction has 224 states and 294 transitions. [2019-09-07 09:17:38,590 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 09:17:38,590 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 294 transitions. [2019-09-07 09:17:38,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-07 09:17:38,593 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:38,593 INFO L399 BasicCegarLoop]: trace histogram [34, 34, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:38,593 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:38,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:38,594 INFO L82 PathProgramCache]: Analyzing trace with hash -846665716, now seen corresponding path program 32 times [2019-09-07 09:17:38,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:38,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:38,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:38,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:17:38,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:39,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2019-09-07 09:17:39,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:39,378 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:17:39,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:39,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:17:39,482 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:39,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-07 09:17:39,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2676 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2019-09-07 09:17:39,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:39,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 37] total 37 [2019-09-07 09:17:39,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-07 09:17:39,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-07 09:17:39,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 09:17:39,528 INFO L87 Difference]: Start difference. First operand 224 states and 294 transitions. Second operand 37 states. [2019-09-07 09:17:39,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:39,950 INFO L93 Difference]: Finished difference Result 383 states and 528 transitions. [2019-09-07 09:17:39,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-07 09:17:39,950 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 181 [2019-09-07 09:17:39,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:39,952 INFO L225 Difference]: With dead ends: 383 [2019-09-07 09:17:39,952 INFO L226 Difference]: Without dead ends: 234 [2019-09-07 09:17:39,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-09-07 09:17:39,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-09-07 09:17:39,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2019-09-07 09:17:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2019-09-07 09:17:39,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 302 transitions. [2019-09-07 09:17:39,958 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 302 transitions. Word has length 181 [2019-09-07 09:17:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:39,959 INFO L475 AbstractCegarLoop]: Abstraction has 230 states and 302 transitions. [2019-09-07 09:17:39,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-07 09:17:39,959 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 302 transitions. [2019-09-07 09:17:39,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-07 09:17:39,960 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:39,960 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:39,960 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:39,961 INFO L82 PathProgramCache]: Analyzing trace with hash -423356735, now seen corresponding path program 33 times [2019-09-07 09:17:39,961 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:39,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:39,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:39,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:39,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2842 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-07 09:17:40,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:40,746 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:17:40,772 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:17:49,461 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-09-07 09:17:49,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:49,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-07 09:17:49,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2842 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-07 09:17:49,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:49,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2019-09-07 09:17:49,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-07 09:17:49,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-07 09:17:49,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:17:49,512 INFO L87 Difference]: Start difference. First operand 230 states and 302 transitions. Second operand 36 states. [2019-09-07 09:17:49,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:49,913 INFO L93 Difference]: Finished difference Result 254 states and 334 transitions. [2019-09-07 09:17:49,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-07 09:17:49,913 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 186 [2019-09-07 09:17:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:49,915 INFO L225 Difference]: With dead ends: 254 [2019-09-07 09:17:49,915 INFO L226 Difference]: Without dead ends: 237 [2019-09-07 09:17:49,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-09-07 09:17:49,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-09-07 09:17:49,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2019-09-07 09:17:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-09-07 09:17:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 308 transitions. [2019-09-07 09:17:49,922 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 308 transitions. Word has length 186 [2019-09-07 09:17:49,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:49,923 INFO L475 AbstractCegarLoop]: Abstraction has 234 states and 308 transitions. [2019-09-07 09:17:49,923 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-07 09:17:49,923 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 308 transitions. [2019-09-07 09:17:49,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-07 09:17:49,924 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:49,924 INFO L399 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:49,925 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:49,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:49,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1546715510, now seen corresponding path program 34 times [2019-09-07 09:17:49,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:49,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:49,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:49,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:49,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2942 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-09-07 09:17:50,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:50,509 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:17:50,519 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:17:50,622 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:17:50,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:50,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 09:17:50,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2942 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1717 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (35)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:17:50,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:50,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 39 [2019-09-07 09:17:50,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 09:17:50,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 09:17:50,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:17:50,672 INFO L87 Difference]: Start difference. First operand 234 states and 308 transitions. Second operand 39 states. [2019-09-07 09:17:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:51,132 INFO L93 Difference]: Finished difference Result 403 states and 557 transitions. [2019-09-07 09:17:51,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 09:17:51,133 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 189 [2019-09-07 09:17:51,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:51,134 INFO L225 Difference]: With dead ends: 403 [2019-09-07 09:17:51,135 INFO L226 Difference]: Without dead ends: 246 [2019-09-07 09:17:51,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:17:51,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-09-07 09:17:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2019-09-07 09:17:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-09-07 09:17:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 318 transitions. [2019-09-07 09:17:51,141 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 318 transitions. Word has length 189 [2019-09-07 09:17:51,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:51,142 INFO L475 AbstractCegarLoop]: Abstraction has 242 states and 318 transitions. [2019-09-07 09:17:51,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 09:17:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 318 transitions. [2019-09-07 09:17:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-07 09:17:51,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:51,143 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:51,144 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:51,144 INFO L82 PathProgramCache]: Analyzing trace with hash 208774245, now seen corresponding path program 35 times [2019-09-07 09:17:51,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:51,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:51,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:51,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:51,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:51,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3189 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2019-09-07 09:17:51,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:51,774 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:17:51,785 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:17:56,401 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 38 check-sat command(s) [2019-09-07 09:17:56,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:17:56,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 37 conjunts are in the unsatisfiable core [2019-09-07 09:17:56,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:17:56,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3189 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2019-09-07 09:17:56,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:17:56,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2019-09-07 09:17:56,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-09-07 09:17:56,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-09-07 09:17:56,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:17:56,458 INFO L87 Difference]: Start difference. First operand 242 states and 318 transitions. Second operand 38 states. [2019-09-07 09:17:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:17:56,836 INFO L93 Difference]: Finished difference Result 266 states and 350 transitions. [2019-09-07 09:17:56,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-07 09:17:56,837 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 196 [2019-09-07 09:17:56,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:17:56,839 INFO L225 Difference]: With dead ends: 266 [2019-09-07 09:17:56,839 INFO L226 Difference]: Without dead ends: 249 [2019-09-07 09:17:56,840 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-09-07 09:17:56,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-09-07 09:17:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-09-07 09:17:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-09-07 09:17:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 324 transitions. [2019-09-07 09:17:56,846 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 324 transitions. Word has length 196 [2019-09-07 09:17:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:17:56,847 INFO L475 AbstractCegarLoop]: Abstraction has 246 states and 324 transitions. [2019-09-07 09:17:56,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-09-07 09:17:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 324 transitions. [2019-09-07 09:17:56,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-07 09:17:56,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:17:56,849 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:17:56,849 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:17:56,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:17:56,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1130684006, now seen corresponding path program 36 times [2019-09-07 09:17:56,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:17:56,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:17:56,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:56,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:17:56,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:17:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:17:57,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3295 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2019-09-07 09:17:57,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:17:57,472 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:17:57,481 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:18:02,692 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 38 check-sat command(s) [2019-09-07 09:18:02,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:18:02,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 38 conjunts are in the unsatisfiable core [2019-09-07 09:18:02,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:18:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3295 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (37)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:18:02,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:18:02,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2019-09-07 09:18:02,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-07 09:18:02,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-07 09:18:02,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:18:02,750 INFO L87 Difference]: Start difference. First operand 246 states and 324 transitions. Second operand 39 states. [2019-09-07 09:18:03,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:18:03,272 INFO L93 Difference]: Finished difference Result 271 states and 357 transitions. [2019-09-07 09:18:03,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-07 09:18:03,273 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 199 [2019-09-07 09:18:03,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:18:03,274 INFO L225 Difference]: With dead ends: 271 [2019-09-07 09:18:03,274 INFO L226 Difference]: Without dead ends: 254 [2019-09-07 09:18:03,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-09-07 09:18:03,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-09-07 09:18:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2019-09-07 09:18:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-09-07 09:18:03,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 330 transitions. [2019-09-07 09:18:03,282 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 330 transitions. Word has length 199 [2019-09-07 09:18:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:18:03,282 INFO L475 AbstractCegarLoop]: Abstraction has 250 states and 330 transitions. [2019-09-07 09:18:03,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-07 09:18:03,283 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 330 transitions. [2019-09-07 09:18:03,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-07 09:18:03,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:18:03,284 INFO L399 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:18:03,284 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:18:03,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:18:03,285 INFO L82 PathProgramCache]: Analyzing trace with hash -571483963, now seen corresponding path program 37 times [2019-09-07 09:18:03,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:18:03,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:18:03,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:03,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:18:03,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:03,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 1369 trivial. 0 not checked. [2019-09-07 09:18:03,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:18:03,918 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:18:03,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:18:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:04,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 39 conjunts are in the unsatisfiable core [2019-09-07 09:18:04,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:18:04,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3404 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 2035 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (38)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:18:04,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:18:04,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 42 [2019-09-07 09:18:04,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-07 09:18:04,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-07 09:18:04,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 09:18:04,103 INFO L87 Difference]: Start difference. First operand 250 states and 330 transitions. Second operand 42 states. [2019-09-07 09:18:04,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:18:04,559 INFO L93 Difference]: Finished difference Result 433 states and 600 transitions. [2019-09-07 09:18:04,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 09:18:04,559 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 202 [2019-09-07 09:18:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:18:04,560 INFO L225 Difference]: With dead ends: 433 [2019-09-07 09:18:04,560 INFO L226 Difference]: Without dead ends: 264 [2019-09-07 09:18:04,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 09:18:04,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-07 09:18:04,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2019-09-07 09:18:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-09-07 09:18:04,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 342 transitions. [2019-09-07 09:18:04,569 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 342 transitions. Word has length 202 [2019-09-07 09:18:04,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:18:04,569 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 342 transitions. [2019-09-07 09:18:04,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-07 09:18:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 342 transitions. [2019-09-07 09:18:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-07 09:18:04,571 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:18:04,571 INFO L399 BasicCegarLoop]: trace histogram [40, 40, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:18:04,571 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:18:04,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:18:04,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1460400352, now seen corresponding path program 38 times [2019-09-07 09:18:04,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:18:04,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:18:04,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:04,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:18:04,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3747 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 1600 trivial. 0 not checked. [2019-09-07 09:18:05,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:18:05,294 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:18:05,304 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:18:05,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:18:05,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:18:05,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 686 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-07 09:18:05,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:18:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3747 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 2147 trivial. 0 not checked. [2019-09-07 09:18:05,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:18:05,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 43] total 43 [2019-09-07 09:18:05,501 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-09-07 09:18:05,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-09-07 09:18:05,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:18:05,503 INFO L87 Difference]: Start difference. First operand 260 states and 342 transitions. Second operand 43 states. [2019-09-07 09:18:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:18:05,987 INFO L93 Difference]: Finished difference Result 443 states and 612 transitions. [2019-09-07 09:18:05,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-07 09:18:05,987 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 211 [2019-09-07 09:18:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:18:05,989 INFO L225 Difference]: With dead ends: 443 [2019-09-07 09:18:05,989 INFO L226 Difference]: Without dead ends: 270 [2019-09-07 09:18:05,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-09-07 09:18:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-09-07 09:18:05,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 266. [2019-09-07 09:18:05,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-07 09:18:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 350 transitions. [2019-09-07 09:18:05,997 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 350 transitions. Word has length 211 [2019-09-07 09:18:05,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:18:05,998 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 350 transitions. [2019-09-07 09:18:05,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-09-07 09:18:05,998 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 350 transitions. [2019-09-07 09:18:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-07 09:18:05,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:18:05,999 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:18:06,000 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:18:06,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:18:06,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1342017453, now seen corresponding path program 39 times [2019-09-07 09:18:06,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:18:06,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:18:06,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:06,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:18:06,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-09-07 09:18:06,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:18:06,732 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:18:06,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:18:26,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-09-07 09:18:26,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:18:26,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 690 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-07 09:18:26,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:18:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 3943 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-09-07 09:18:26,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:18:26,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2019-09-07 09:18:26,128 INFO L454 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-09-07 09:18:26,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-09-07 09:18:26,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 09:18:26,129 INFO L87 Difference]: Start difference. First operand 266 states and 350 transitions. Second operand 42 states. [2019-09-07 09:18:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:18:26,661 INFO L93 Difference]: Finished difference Result 290 states and 382 transitions. [2019-09-07 09:18:26,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-07 09:18:26,662 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 216 [2019-09-07 09:18:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:18:26,664 INFO L225 Difference]: With dead ends: 290 [2019-09-07 09:18:26,664 INFO L226 Difference]: Without dead ends: 273 [2019-09-07 09:18:26,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-09-07 09:18:26,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-09-07 09:18:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 270. [2019-09-07 09:18:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-09-07 09:18:26,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 356 transitions. [2019-09-07 09:18:26,684 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 356 transitions. Word has length 216 [2019-09-07 09:18:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:18:26,685 INFO L475 AbstractCegarLoop]: Abstraction has 270 states and 356 transitions. [2019-09-07 09:18:26,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-09-07 09:18:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 356 transitions. [2019-09-07 09:18:26,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-09-07 09:18:26,687 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:18:26,687 INFO L399 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:18:26,687 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:18:26,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:18:26,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1158820322, now seen corresponding path program 40 times [2019-09-07 09:18:26,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:18:26,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:18:26,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:26,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:18:26,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4061 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2019-09-07 09:18:27,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:18:27,606 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:18:27,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:18:27,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:18:27,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:18:27,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 712 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 09:18:27,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:18:27,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4061 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2019-09-07 09:18:27,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:18:27,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 44] total 45 [2019-09-07 09:18:27,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-09-07 09:18:27,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-09-07 09:18:27,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 09:18:27,795 INFO L87 Difference]: Start difference. First operand 270 states and 356 transitions. Second operand 45 states. [2019-09-07 09:18:28,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:18:28,337 INFO L93 Difference]: Finished difference Result 463 states and 641 transitions. [2019-09-07 09:18:28,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-07 09:18:28,338 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 219 [2019-09-07 09:18:28,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:18:28,339 INFO L225 Difference]: With dead ends: 463 [2019-09-07 09:18:28,340 INFO L226 Difference]: Without dead ends: 282 [2019-09-07 09:18:28,341 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-09-07 09:18:28,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-09-07 09:18:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 278. [2019-09-07 09:18:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-09-07 09:18:28,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 366 transitions. [2019-09-07 09:18:28,349 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 366 transitions. Word has length 219 [2019-09-07 09:18:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:18:28,349 INFO L475 AbstractCegarLoop]: Abstraction has 278 states and 366 transitions. [2019-09-07 09:18:28,349 INFO L476 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-09-07 09:18:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 366 transitions. [2019-09-07 09:18:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-07 09:18:28,351 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:18:28,351 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:18:28,351 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:18:28,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:18:28,352 INFO L82 PathProgramCache]: Analyzing trace with hash 530083153, now seen corresponding path program 41 times [2019-09-07 09:18:28,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:18:28,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:18:28,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:28,353 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:18:28,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:29,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4350 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-07 09:18:29,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:18:29,177 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:18:29,188 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:18:37,588 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 44 check-sat command(s) [2019-09-07 09:18:37,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:18:37,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 43 conjunts are in the unsatisfiable core [2019-09-07 09:18:37,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:18:37,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4350 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-07 09:18:37,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:18:37,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2019-09-07 09:18:37,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-09-07 09:18:37,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-09-07 09:18:37,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 09:18:37,659 INFO L87 Difference]: Start difference. First operand 278 states and 366 transitions. Second operand 44 states. [2019-09-07 09:18:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:18:38,282 INFO L93 Difference]: Finished difference Result 302 states and 398 transitions. [2019-09-07 09:18:38,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-07 09:18:38,282 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 226 [2019-09-07 09:18:38,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:18:38,284 INFO L225 Difference]: With dead ends: 302 [2019-09-07 09:18:38,284 INFO L226 Difference]: Without dead ends: 285 [2019-09-07 09:18:38,285 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-09-07 09:18:38,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-09-07 09:18:38,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2019-09-07 09:18:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-09-07 09:18:38,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 372 transitions. [2019-09-07 09:18:38,292 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 372 transitions. Word has length 226 [2019-09-07 09:18:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:18:38,293 INFO L475 AbstractCegarLoop]: Abstraction has 282 states and 372 transitions. [2019-09-07 09:18:38,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-09-07 09:18:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 372 transitions. [2019-09-07 09:18:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-09-07 09:18:38,295 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:18:38,295 INFO L399 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:18:38,295 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:18:38,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:18:38,296 INFO L82 PathProgramCache]: Analyzing trace with hash -237740550, now seen corresponding path program 42 times [2019-09-07 09:18:38,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:18:38,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:18:38,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:38,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:18:38,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4474 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 1849 trivial. 0 not checked. [2019-09-07 09:18:39,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:18:39,088 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:18:39,098 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:18:56,421 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 44 check-sat command(s) [2019-09-07 09:18:56,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:18:56,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 47 conjunts are in the unsatisfiable core [2019-09-07 09:18:56,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:18:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4474 backedges. 85 proven. 2625 refuted. 0 times theorem prover too weak. 1764 trivial. 0 not checked. [2019-09-07 09:18:56,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:18:56,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 47] total 47 [2019-09-07 09:18:56,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-09-07 09:18:56,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-09-07 09:18:56,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:18:56,580 INFO L87 Difference]: Start difference. First operand 282 states and 372 transitions. Second operand 47 states. [2019-09-07 09:18:57,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:18:57,225 INFO L93 Difference]: Finished difference Result 481 states and 667 transitions. [2019-09-07 09:18:57,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-09-07 09:18:57,225 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 229 [2019-09-07 09:18:57,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:18:57,228 INFO L225 Difference]: With dead ends: 481 [2019-09-07 09:18:57,228 INFO L226 Difference]: Without dead ends: 292 [2019-09-07 09:18:57,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-09-07 09:18:57,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-09-07 09:18:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2019-09-07 09:18:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-09-07 09:18:57,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 386 transitions. [2019-09-07 09:18:57,236 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 386 transitions. Word has length 229 [2019-09-07 09:18:57,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:18:57,236 INFO L475 AbstractCegarLoop]: Abstraction has 292 states and 386 transitions. [2019-09-07 09:18:57,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-09-07 09:18:57,236 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 386 transitions. [2019-09-07 09:18:57,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-07 09:18:57,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:18:57,238 INFO L399 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:18:57,238 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:18:57,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:18:57,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1635887624, now seen corresponding path program 43 times [2019-09-07 09:18:57,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:18:57,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:18:57,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:57,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:18:57,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:58,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2019-09-07 09:18:58,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:18:58,130 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:18:58,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:18:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:58,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 46 conjunts are in the unsatisfiable core [2019-09-07 09:18:58,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:18:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4818 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 2882 trivial. 0 not checked. [2019-09-07 09:18:58,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:18:58,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 49 [2019-09-07 09:18:58,347 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 09:18:58,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 09:18:58,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:18:58,349 INFO L87 Difference]: Start difference. First operand 292 states and 386 transitions. Second operand 49 states. [2019-09-07 09:18:58,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:18:58,958 INFO L93 Difference]: Finished difference Result 503 states and 698 transitions. [2019-09-07 09:18:58,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 09:18:58,959 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 237 [2019-09-07 09:18:58,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:18:58,961 INFO L225 Difference]: With dead ends: 503 [2019-09-07 09:18:58,961 INFO L226 Difference]: Without dead ends: 306 [2019-09-07 09:18:58,962 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:18:58,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-09-07 09:18:58,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 302. [2019-09-07 09:18:58,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-09-07 09:18:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 398 transitions. [2019-09-07 09:18:58,969 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 398 transitions. Word has length 237 [2019-09-07 09:18:58,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:18:58,970 INFO L475 AbstractCegarLoop]: Abstraction has 302 states and 398 transitions. [2019-09-07 09:18:58,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 09:18:58,970 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 398 transitions. [2019-09-07 09:18:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-07 09:18:58,971 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:18:58,972 INFO L399 BasicCegarLoop]: trace histogram [47, 47, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:18:58,972 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:18:58,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:18:58,972 INFO L82 PathProgramCache]: Analyzing trace with hash 697251993, now seen corresponding path program 44 times [2019-09-07 09:18:58,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:18:58,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:18:58,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:58,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:18:58,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:18:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:18:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5224 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2019-09-07 09:18:59,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:18:59,872 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:18:59,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:19:00,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:19:00,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:00,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 798 conjuncts, 49 conjunts are in the unsatisfiable core [2019-09-07 09:19:00,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:00,074 INFO L134 CoverageAnalysis]: Checked inductivity of 5224 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2019-09-07 09:19:00,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:00,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 50] total 50 [2019-09-07 09:19:00,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-09-07 09:19:00,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-09-07 09:19:00,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 09:19:00,081 INFO L87 Difference]: Start difference. First operand 302 states and 398 transitions. Second operand 50 states. [2019-09-07 09:19:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:00,727 INFO L93 Difference]: Finished difference Result 513 states and 710 transitions. [2019-09-07 09:19:00,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-07 09:19:00,728 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 246 [2019-09-07 09:19:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:00,730 INFO L225 Difference]: With dead ends: 513 [2019-09-07 09:19:00,730 INFO L226 Difference]: Without dead ends: 312 [2019-09-07 09:19:00,731 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-09-07 09:19:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-09-07 09:19:00,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2019-09-07 09:19:00,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-09-07 09:19:00,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 406 transitions. [2019-09-07 09:19:00,738 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 406 transitions. Word has length 246 [2019-09-07 09:19:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:00,740 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 406 transitions. [2019-09-07 09:19:00,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-09-07 09:19:00,740 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 406 transitions. [2019-09-07 09:19:00,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-09-07 09:19:00,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:00,742 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:00,742 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:00,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:00,742 INFO L82 PathProgramCache]: Analyzing trace with hash -212256624, now seen corresponding path program 45 times [2019-09-07 09:19:00,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:00,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:00,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:00,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:00,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:01,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5455 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2019-09-07 09:19:01,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:01,677 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:19:01,686 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:19:46,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-09-07 09:19:46,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:46,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-07 09:19:46,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5455 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2019-09-07 09:19:46,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:46,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2019-09-07 09:19:46,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-09-07 09:19:46,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-09-07 09:19:46,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:19:46,111 INFO L87 Difference]: Start difference. First operand 308 states and 406 transitions. Second operand 49 states. [2019-09-07 09:19:46,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:46,856 INFO L93 Difference]: Finished difference Result 332 states and 438 transitions. [2019-09-07 09:19:46,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-07 09:19:46,856 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 251 [2019-09-07 09:19:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:46,859 INFO L225 Difference]: With dead ends: 332 [2019-09-07 09:19:46,859 INFO L226 Difference]: Without dead ends: 315 [2019-09-07 09:19:46,860 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-09-07 09:19:46,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-09-07 09:19:46,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 312. [2019-09-07 09:19:46,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-07 09:19:46,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 412 transitions. [2019-09-07 09:19:46,868 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 412 transitions. Word has length 251 [2019-09-07 09:19:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:46,868 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 412 transitions. [2019-09-07 09:19:46,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-09-07 09:19:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 412 transitions. [2019-09-07 09:19:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-09-07 09:19:46,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:46,870 INFO L399 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:46,870 INFO L418 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:46,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:46,871 INFO L82 PathProgramCache]: Analyzing trace with hash -495430053, now seen corresponding path program 46 times [2019-09-07 09:19:46,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:46,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:46,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:46,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:46,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5594 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 2304 trivial. 0 not checked. [2019-09-07 09:19:47,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:47,886 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:19:47,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:19:48,027 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:19:48,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:19:48,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 824 conjuncts, 50 conjunts are in the unsatisfiable core [2019-09-07 09:19:48,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:19:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5594 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 3290 trivial. 0 not checked. [2019-09-07 09:19:48,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:19:48,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 51] total 52 [2019-09-07 09:19:48,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-09-07 09:19:48,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-09-07 09:19:48,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 09:19:48,087 INFO L87 Difference]: Start difference. First operand 312 states and 412 transitions. Second operand 52 states. [2019-09-07 09:19:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:19:48,728 INFO L93 Difference]: Finished difference Result 533 states and 739 transitions. [2019-09-07 09:19:48,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-07 09:19:48,728 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 254 [2019-09-07 09:19:48,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:19:48,731 INFO L225 Difference]: With dead ends: 533 [2019-09-07 09:19:48,731 INFO L226 Difference]: Without dead ends: 324 [2019-09-07 09:19:48,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-09-07 09:19:48,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-09-07 09:19:48,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 320. [2019-09-07 09:19:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-09-07 09:19:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 422 transitions. [2019-09-07 09:19:48,740 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 422 transitions. Word has length 254 [2019-09-07 09:19:48,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:19:48,741 INFO L475 AbstractCegarLoop]: Abstraction has 320 states and 422 transitions. [2019-09-07 09:19:48,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-09-07 09:19:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 422 transitions. [2019-09-07 09:19:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-09-07 09:19:48,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:19:48,743 INFO L399 BasicCegarLoop]: trace histogram [50, 50, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:19:48,743 INFO L418 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:19:48,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:19:48,743 INFO L82 PathProgramCache]: Analyzing trace with hash 66501356, now seen corresponding path program 47 times [2019-09-07 09:19:48,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:19:48,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:19:48,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:48,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:19:48,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:19:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:19:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 5932 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2019-09-07 09:19:49,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:19:49,771 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:19:49,780 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:20:12,075 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 51 check-sat command(s) [2019-09-07 09:20:12,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:20:12,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 52 conjunts are in the unsatisfiable core [2019-09-07 09:20:12,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:20:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5932 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 3432 trivial. 0 not checked. [2019-09-07 09:20:12,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:20:12,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 53] total 53 [2019-09-07 09:20:12,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-09-07 09:20:12,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-09-07 09:20:12,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:20:12,181 INFO L87 Difference]: Start difference. First operand 320 states and 422 transitions. Second operand 53 states. [2019-09-07 09:20:12,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:20:12,797 INFO L93 Difference]: Finished difference Result 543 states and 752 transitions. [2019-09-07 09:20:12,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-07 09:20:12,797 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 261 [2019-09-07 09:20:12,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:20:12,799 INFO L225 Difference]: With dead ends: 543 [2019-09-07 09:20:12,800 INFO L226 Difference]: Without dead ends: 330 [2019-09-07 09:20:12,800 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-09-07 09:20:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-09-07 09:20:12,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 326. [2019-09-07 09:20:12,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-09-07 09:20:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 430 transitions. [2019-09-07 09:20:12,808 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 430 transitions. Word has length 261 [2019-09-07 09:20:12,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:20:12,808 INFO L475 AbstractCegarLoop]: Abstraction has 326 states and 430 transitions. [2019-09-07 09:20:12,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-09-07 09:20:12,808 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 430 transitions. [2019-09-07 09:20:12,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-09-07 09:20:12,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:20:12,810 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:20:12,810 INFO L418 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:20:12,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:20:12,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1752941537, now seen corresponding path program 48 times [2019-09-07 09:20:12,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:20:12,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:20:12,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:12,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:20:12,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:20:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:20:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6178 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 2601 trivial. 0 not checked. [2019-09-07 09:20:14,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:20:14,033 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:20:14,044 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:21:08,618 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 52 check-sat command(s) [2019-09-07 09:21:08,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:21:08,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 862 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-07 09:21:08,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:21:08,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6178 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 3577 trivial. 0 not checked. [2019-09-07 09:21:08,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:21:08,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 54] total 54 [2019-09-07 09:21:08,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-09-07 09:21:08,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-09-07 09:21:08,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 09:21:08,700 INFO L87 Difference]: Start difference. First operand 326 states and 430 transitions. Second operand 54 states. [2019-09-07 09:21:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:21:09,342 INFO L93 Difference]: Finished difference Result 553 states and 766 transitions. [2019-09-07 09:21:09,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-07 09:21:09,342 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 266 [2019-09-07 09:21:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:21:09,344 INFO L225 Difference]: With dead ends: 553 [2019-09-07 09:21:09,344 INFO L226 Difference]: Without dead ends: 336 [2019-09-07 09:21:09,345 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-09-07 09:21:09,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-09-07 09:21:09,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 332. [2019-09-07 09:21:09,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-09-07 09:21:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 438 transitions. [2019-09-07 09:21:09,352 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 438 transitions. Word has length 266 [2019-09-07 09:21:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:21:09,353 INFO L475 AbstractCegarLoop]: Abstraction has 332 states and 438 transitions. [2019-09-07 09:21:09,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-09-07 09:21:09,353 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 438 transitions. [2019-09-07 09:21:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-09-07 09:21:09,355 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:21:09,355 INFO L399 BasicCegarLoop]: trace histogram [52, 52, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:21:09,355 INFO L418 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:21:09,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:21:09,356 INFO L82 PathProgramCache]: Analyzing trace with hash 2107206984, now seen corresponding path program 49 times [2019-09-07 09:21:09,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:21:09,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:21:09,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:09,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:21:09,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:09,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:21:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6429 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 2704 trivial. 0 not checked. [2019-09-07 09:21:10,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:21:10,415 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:21:10,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:21:10,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:21:10,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 09:21:10,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:21:10,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6429 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 3725 trivial. 0 not checked. [2019-09-07 09:21:10,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:21:10,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 55] total 55 [2019-09-07 09:21:10,610 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 09:21:10,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 09:21:10,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 09:21:10,611 INFO L87 Difference]: Start difference. First operand 332 states and 438 transitions. Second operand 55 states. [2019-09-07 09:21:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:21:11,343 INFO L93 Difference]: Finished difference Result 563 states and 780 transitions. [2019-09-07 09:21:11,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 09:21:11,349 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 271 [2019-09-07 09:21:11,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:21:11,351 INFO L225 Difference]: With dead ends: 563 [2019-09-07 09:21:11,351 INFO L226 Difference]: Without dead ends: 342 [2019-09-07 09:21:11,352 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 09:21:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-09-07 09:21:11,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 338. [2019-09-07 09:21:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2019-09-07 09:21:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 446 transitions. [2019-09-07 09:21:11,359 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 446 transitions. Word has length 271 [2019-09-07 09:21:11,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:21:11,360 INFO L475 AbstractCegarLoop]: Abstraction has 338 states and 446 transitions. [2019-09-07 09:21:11,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 09:21:11,360 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 446 transitions. [2019-09-07 09:21:11,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-07 09:21:11,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:21:11,362 INFO L399 BasicCegarLoop]: trace histogram [53, 53, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:21:11,362 INFO L418 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:21:11,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:21:11,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1403638149, now seen corresponding path program 50 times [2019-09-07 09:21:11,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:21:11,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:21:11,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:11,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:21:11,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:21:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6685 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2019-09-07 09:21:12,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:21:12,462 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:21:12,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:21:12,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:21:12,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:21:12,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 09:21:12,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:21:12,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6685 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 3876 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (51)] Exception during sending of exit command (exit): Broken pipe [2019-09-07 09:21:12,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:21:12,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 56] total 56 [2019-09-07 09:21:12,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 09:21:12,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 09:21:12,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 09:21:12,683 INFO L87 Difference]: Start difference. First operand 338 states and 446 transitions. Second operand 56 states. [2019-09-07 09:21:13,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:21:13,457 INFO L93 Difference]: Finished difference Result 573 states and 794 transitions. [2019-09-07 09:21:13,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 09:21:13,458 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 276 [2019-09-07 09:21:13,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:21:13,459 INFO L225 Difference]: With dead ends: 573 [2019-09-07 09:21:13,459 INFO L226 Difference]: Without dead ends: 348 [2019-09-07 09:21:13,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 09:21:13,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2019-09-07 09:21:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 344. [2019-09-07 09:21:13,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-09-07 09:21:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 454 transitions. [2019-09-07 09:21:13,467 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 454 transitions. Word has length 276 [2019-09-07 09:21:13,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:21:13,467 INFO L475 AbstractCegarLoop]: Abstraction has 344 states and 454 transitions. [2019-09-07 09:21:13,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 09:21:13,467 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 454 transitions. [2019-09-07 09:21:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-09-07 09:21:13,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:21:13,469 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:21:13,470 INFO L418 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:21:13,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:21:13,470 INFO L82 PathProgramCache]: Analyzing trace with hash 887295908, now seen corresponding path program 51 times [2019-09-07 09:21:13,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:21:13,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:21:13,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:13,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:21:13,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:21:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:21:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6946 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 2916 trivial. 0 not checked. [2019-09-07 09:21:14,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:21:14,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 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:21:14,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:22:41,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-09-07 09:22:41,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:22:41,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 54 conjunts are in the unsatisfiable core [2019-09-07 09:22:41,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:22:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6946 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 2916 trivial. 0 not checked. [2019-09-07 09:22:41,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:22:41,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2019-09-07 09:22:41,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-09-07 09:22:41,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-09-07 09:22:41,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 09:22:41,501 INFO L87 Difference]: Start difference. First operand 344 states and 454 transitions. Second operand 55 states. [2019-09-07 09:22:42,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:22:42,279 INFO L93 Difference]: Finished difference Result 368 states and 486 transitions. [2019-09-07 09:22:42,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-07 09:22:42,279 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 281 [2019-09-07 09:22:42,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:22:42,281 INFO L225 Difference]: With dead ends: 368 [2019-09-07 09:22:42,281 INFO L226 Difference]: Without dead ends: 351 [2019-09-07 09:22:42,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-09-07 09:22:42,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-09-07 09:22:42,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 348. [2019-09-07 09:22:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-09-07 09:22:42,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 460 transitions. [2019-09-07 09:22:42,289 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 460 transitions. Word has length 281 [2019-09-07 09:22:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:22:42,290 INFO L475 AbstractCegarLoop]: Abstraction has 348 states and 460 transitions. [2019-09-07 09:22:42,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-09-07 09:22:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 460 transitions. [2019-09-07 09:22:42,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2019-09-07 09:22:42,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:22:42,292 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:22:42,292 INFO L418 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:22:42,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:22:42,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1441515833, now seen corresponding path program 52 times [2019-09-07 09:22:42,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:22:42,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:22:42,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:22:42,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:22:42,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:22:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:22:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7103 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 2916 trivial. 0 not checked. [2019-09-07 09:22:43,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:22:43,487 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:22:43,498 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:22:43,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:22:43,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:22:43,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 55 conjunts are in the unsatisfiable core [2019-09-07 09:22:43,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:22:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7103 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 2916 trivial. 0 not checked. [2019-09-07 09:22:43,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:22:43,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2019-09-07 09:22:43,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-09-07 09:22:43,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-09-07 09:22:43,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 09:22:43,729 INFO L87 Difference]: Start difference. First operand 348 states and 460 transitions. Second operand 56 states. [2019-09-07 09:22:44,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:22:44,476 INFO L93 Difference]: Finished difference Result 373 states and 493 transitions. [2019-09-07 09:22:44,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-07 09:22:44,477 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 284 [2019-09-07 09:22:44,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:22:44,479 INFO L225 Difference]: With dead ends: 373 [2019-09-07 09:22:44,479 INFO L226 Difference]: Without dead ends: 356 [2019-09-07 09:22:44,480 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-09-07 09:22:44,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-09-07 09:22:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 352. [2019-09-07 09:22:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-09-07 09:22:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 466 transitions. [2019-09-07 09:22:44,486 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 466 transitions. Word has length 284 [2019-09-07 09:22:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:22:44,486 INFO L475 AbstractCegarLoop]: Abstraction has 352 states and 466 transitions. [2019-09-07 09:22:44,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-09-07 09:22:44,487 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 466 transitions. [2019-09-07 09:22:44,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2019-09-07 09:22:44,488 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:22:44,488 INFO L399 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:22:44,489 INFO L418 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:22:44,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:22:44,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1829607620, now seen corresponding path program 53 times [2019-09-07 09:22:44,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:22:44,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:22:44,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:22:44,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:22:44,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:22:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:22:45,901 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 2916 trivial. 0 not checked. [2019-09-07 09:22:45,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:22:45,901 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:22:45,913 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:23:04,471 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 55 check-sat command(s) [2019-09-07 09:23:04,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:23:04,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 56 conjunts are in the unsatisfiable core [2019-09-07 09:23:04,493 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:23:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7263 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 4347 trivial. 0 not checked. [2019-09-07 09:23:04,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:23:04,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 59 [2019-09-07 09:23:04,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-09-07 09:23:04,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-09-07 09:23:04,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 09:23:04,559 INFO L87 Difference]: Start difference. First operand 352 states and 466 transitions. Second operand 59 states. [2019-09-07 09:23:05,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:23:05,329 INFO L93 Difference]: Finished difference Result 603 states and 838 transitions. [2019-09-07 09:23:05,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-09-07 09:23:05,330 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 287 [2019-09-07 09:23:05,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:23:05,331 INFO L225 Difference]: With dead ends: 603 [2019-09-07 09:23:05,331 INFO L226 Difference]: Without dead ends: 366 [2019-09-07 09:23:05,332 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-09-07 09:23:05,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-09-07 09:23:05,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 362. [2019-09-07 09:23:05,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-09-07 09:23:05,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 478 transitions. [2019-09-07 09:23:05,338 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 478 transitions. Word has length 287 [2019-09-07 09:23:05,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:23:05,339 INFO L475 AbstractCegarLoop]: Abstraction has 362 states and 478 transitions. [2019-09-07 09:23:05,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-09-07 09:23:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 478 transitions. [2019-09-07 09:23:05,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-09-07 09:23:05,341 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:23:05,341 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:23:05,341 INFO L418 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:23:05,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:23:05,342 INFO L82 PathProgramCache]: Analyzing trace with hash -821248819, now seen corresponding path program 54 times [2019-09-07 09:23:05,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:23:05,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:23:05,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:23:05,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:23:05,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:23:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:23:06,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7759 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-09-07 09:23:06,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:23:06,649 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:23:06,660 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-07 09:26:38,631 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 58 check-sat command(s) [2019-09-07 09:26:38,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:26:38,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 57 conjunts are in the unsatisfiable core [2019-09-07 09:26:38,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:26:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7759 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-09-07 09:26:38,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:26:38,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2019-09-07 09:26:38,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-09-07 09:26:38,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-09-07 09:26:38,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 09:26:38,759 INFO L87 Difference]: Start difference. First operand 362 states and 478 transitions. Second operand 58 states. [2019-09-07 09:26:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:26:39,736 INFO L93 Difference]: Finished difference Result 386 states and 510 transitions. [2019-09-07 09:26:39,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-09-07 09:26:39,737 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 296 [2019-09-07 09:26:39,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:26:39,738 INFO L225 Difference]: With dead ends: 386 [2019-09-07 09:26:39,738 INFO L226 Difference]: Without dead ends: 369 [2019-09-07 09:26:39,739 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-09-07 09:26:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-09-07 09:26:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-09-07 09:26:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-09-07 09:26:39,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 484 transitions. [2019-09-07 09:26:39,747 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 484 transitions. Word has length 296 [2019-09-07 09:26:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:26:39,747 INFO L475 AbstractCegarLoop]: Abstraction has 366 states and 484 transitions. [2019-09-07 09:26:39,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-09-07 09:26:39,748 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 484 transitions. [2019-09-07 09:26:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-07 09:26:39,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:26:39,750 INFO L399 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:26:39,750 INFO L418 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:26:39,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:26:39,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1040052994, now seen corresponding path program 55 times [2019-09-07 09:26:39,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:26:39,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:26:39,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:39,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:26:39,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:26:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7925 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2019-09-07 09:26:41,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:26:41,109 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:26:41,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:26:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:26:41,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 59 conjunts are in the unsatisfiable core [2019-09-07 09:26:41,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:26:41,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7925 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 4676 trivial. 0 not checked. [2019-09-07 09:26:41,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:26:41,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 60] total 61 [2019-09-07 09:26:41,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 09:26:41,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 09:26:41,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:26:41,359 INFO L87 Difference]: Start difference. First operand 366 states and 484 transitions. Second operand 61 states. [2019-09-07 09:26:42,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:26:42,177 INFO L93 Difference]: Finished difference Result 623 states and 865 transitions. [2019-09-07 09:26:42,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 09:26:42,178 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 299 [2019-09-07 09:26:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:26:42,180 INFO L225 Difference]: With dead ends: 623 [2019-09-07 09:26:42,181 INFO L226 Difference]: Without dead ends: 378 [2019-09-07 09:26:42,182 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:26:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-09-07 09:26:42,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 374. [2019-09-07 09:26:42,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-09-07 09:26:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 494 transitions. [2019-09-07 09:26:42,189 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 494 transitions. Word has length 299 [2019-09-07 09:26:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:26:42,190 INFO L475 AbstractCegarLoop]: Abstraction has 374 states and 494 transitions. [2019-09-07 09:26:42,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 09:26:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 494 transitions. [2019-09-07 09:26:42,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-09-07 09:26:42,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:26:42,192 INFO L399 BasicCegarLoop]: trace histogram [59, 59, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:26:42,192 INFO L418 AbstractCegarLoop]: === Iteration 59 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:26:42,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:26:42,193 INFO L82 PathProgramCache]: Analyzing trace with hash 956177009, now seen corresponding path program 56 times [2019-09-07 09:26:42,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:26:42,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:26:42,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:42,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-07 09:26:42,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:26:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8326 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2019-09-07 09:26:43,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:26:43,514 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:26:43,526 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-07 09:26:43,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-07 09:26:43,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:26:43,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-07 09:26:43,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:26:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8326 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 4845 trivial. 0 not checked. [2019-09-07 09:26:43,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:26:43,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 62] total 62 [2019-09-07 09:26:43,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-07 09:26:43,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-07 09:26:43,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 09:26:43,744 INFO L87 Difference]: Start difference. First operand 374 states and 494 transitions. Second operand 62 states. [2019-09-07 09:26:44,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:26:44,663 INFO L93 Difference]: Finished difference Result 633 states and 878 transitions. [2019-09-07 09:26:44,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 09:26:44,668 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 306 [2019-09-07 09:26:44,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:26:44,671 INFO L225 Difference]: With dead ends: 633 [2019-09-07 09:26:44,671 INFO L226 Difference]: Without dead ends: 384 [2019-09-07 09:26:44,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 09:26:44,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-09-07 09:26:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 380. [2019-09-07 09:26:44,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-09-07 09:26:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 502 transitions. [2019-09-07 09:26:44,696 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 502 transitions. Word has length 306 [2019-09-07 09:26:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:26:44,697 INFO L475 AbstractCegarLoop]: Abstraction has 380 states and 502 transitions. [2019-09-07 09:26:44,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-07 09:26:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 502 transitions. [2019-09-07 09:26:44,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-09-07 09:26:44,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:26:44,699 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:26:44,699 INFO L418 AbstractCegarLoop]: === Iteration 60 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:26:44,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:26:44,700 INFO L82 PathProgramCache]: Analyzing trace with hash 393942712, now seen corresponding path program 57 times [2019-09-07 09:26:44,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:26:44,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:26:44,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:44,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:26:44,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:26:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:26:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 8617 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 3600 trivial. 0 not checked. [2019-09-07 09:26:46,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:26:46,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:26:46,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-07 09:29:06,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2019-09-07 09:29:06,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:07,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 60 conjunts are in the unsatisfiable core [2019-09-07 09:29:07,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:07,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8617 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 3600 trivial. 0 not checked. [2019-09-07 09:29:07,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:07,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61] total 61 [2019-09-07 09:29:07,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-09-07 09:29:07,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-09-07 09:29:07,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:29:07,077 INFO L87 Difference]: Start difference. First operand 380 states and 502 transitions. Second operand 61 states. [2019-09-07 09:29:08,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:08,075 INFO L93 Difference]: Finished difference Result 404 states and 534 transitions. [2019-09-07 09:29:08,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-09-07 09:29:08,075 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 311 [2019-09-07 09:29:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:08,077 INFO L225 Difference]: With dead ends: 404 [2019-09-07 09:29:08,077 INFO L226 Difference]: Without dead ends: 387 [2019-09-07 09:29:08,077 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-09-07 09:29:08,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-09-07 09:29:08,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 384. [2019-09-07 09:29:08,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-09-07 09:29:08,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 508 transitions. [2019-09-07 09:29:08,082 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 508 transitions. Word has length 311 [2019-09-07 09:29:08,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:08,083 INFO L475 AbstractCegarLoop]: Abstraction has 384 states and 508 transitions. [2019-09-07 09:29:08,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-09-07 09:29:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 508 transitions. [2019-09-07 09:29:08,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-07 09:29:08,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:08,085 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:08,085 INFO L418 AbstractCegarLoop]: === Iteration 61 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:08,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:08,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1548490957, now seen corresponding path program 58 times [2019-09-07 09:29:08,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:08,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:08,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:08,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:08,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8792 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 3600 trivial. 0 not checked. [2019-09-07 09:29:09,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:09,555 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:09,566 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-07 09:29:09,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-07 09:29:09,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:09,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 61 conjunts are in the unsatisfiable core [2019-09-07 09:29:09,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:09,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8792 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 3600 trivial. 0 not checked. [2019-09-07 09:29:09,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:09,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62] total 62 [2019-09-07 09:29:09,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-09-07 09:29:09,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-09-07 09:29:09,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 09:29:09,826 INFO L87 Difference]: Start difference. First operand 384 states and 508 transitions. Second operand 62 states. [2019-09-07 09:29:10,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:10,896 INFO L93 Difference]: Finished difference Result 409 states and 541 transitions. [2019-09-07 09:29:10,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-09-07 09:29:10,896 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 314 [2019-09-07 09:29:10,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:10,898 INFO L225 Difference]: With dead ends: 409 [2019-09-07 09:29:10,898 INFO L226 Difference]: Without dead ends: 392 [2019-09-07 09:29:10,899 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-09-07 09:29:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-09-07 09:29:10,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 388. [2019-09-07 09:29:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-09-07 09:29:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 514 transitions. [2019-09-07 09:29:10,905 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 514 transitions. Word has length 314 [2019-09-07 09:29:10,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:10,905 INFO L475 AbstractCegarLoop]: Abstraction has 388 states and 514 transitions. [2019-09-07 09:29:10,905 INFO L476 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-09-07 09:29:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 514 transitions. [2019-09-07 09:29:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2019-09-07 09:29:10,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:10,907 INFO L399 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:10,907 INFO L418 AbstractCegarLoop]: === Iteration 62 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:10,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:10,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1799422168, now seen corresponding path program 59 times [2019-09-07 09:29:10,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:10,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:10,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:10,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:10,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:29:12,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 3600 trivial. 0 not checked. [2019-09-07 09:29:12,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:29:12,394 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:29:12,408 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-07 09:29:58,295 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 61 check-sat command(s) [2019-09-07 09:29:58,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-07 09:29:58,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 62 conjunts are in the unsatisfiable core [2019-09-07 09:29:58,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-07 09:29:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 8970 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 3600 trivial. 0 not checked. [2019-09-07 09:29:58,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-07 09:29:58,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 63 [2019-09-07 09:29:58,406 INFO L454 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-09-07 09:29:58,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-09-07 09:29:58,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 09:29:58,407 INFO L87 Difference]: Start difference. First operand 388 states and 514 transitions. Second operand 63 states. [2019-09-07 09:29:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-07 09:29:59,249 INFO L93 Difference]: Finished difference Result 659 states and 916 transitions. [2019-09-07 09:29:59,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-09-07 09:29:59,250 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 317 [2019-09-07 09:29:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-07 09:29:59,251 INFO L225 Difference]: With dead ends: 659 [2019-09-07 09:29:59,251 INFO L226 Difference]: Without dead ends: 398 [2019-09-07 09:29:59,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-09-07 09:29:59,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2019-09-07 09:29:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 394. [2019-09-07 09:29:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-09-07 09:29:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 522 transitions. [2019-09-07 09:29:59,258 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 522 transitions. Word has length 317 [2019-09-07 09:29:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-07 09:29:59,258 INFO L475 AbstractCegarLoop]: Abstraction has 394 states and 522 transitions. [2019-09-07 09:29:59,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-09-07 09:29:59,258 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 522 transitions. [2019-09-07 09:29:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2019-09-07 09:29:59,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-07 09:29:59,260 INFO L399 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-07 09:29:59,261 INFO L418 AbstractCegarLoop]: === Iteration 63 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-07 09:29:59,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-07 09:29:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash -55895947, now seen corresponding path program 60 times [2019-09-07 09:29:59,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-07 09:29:59,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-07 09:29:59,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:59,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-07 09:29:59,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-07 09:29:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-07 09:30:00,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9272 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 3721 trivial. 0 not checked. [2019-09-07 09:30:00,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-07 09:30:00,799 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-07 09:30:00,812 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE