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/loop-acceleration/phases_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:46:02,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:46:02,865 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:46:02,876 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:46:02,877 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:46:02,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:46:02,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:46:02,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:46:02,892 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:46:02,892 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:46:02,893 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:46:02,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:46:02,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:46:02,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:46:02,896 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:46:02,898 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:46:02,898 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:46:02,899 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:46:02,901 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:46:02,903 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:46:02,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:46:02,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:46:02,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:46:02,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:46:02,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:46:02,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:46:02,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:46:02,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:46:02,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:46:02,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:46:02,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:46:02,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:46:02,913 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:46:02,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:46:02,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:46:02,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:46:02,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:46:02,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:46:02,916 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:46:02,917 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:46:02,918 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:46:02,918 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-05 11:46:02,932 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:46:02,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:46:02,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:46:02,934 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:46:02,934 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:46:02,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:46:02,934 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:46:02,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:46:02,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:46:02,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:46:02,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:46:02,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:46:02,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:46:02,936 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:46:02,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:46:02,936 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:46:02,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:46:02,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:46:02,937 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:46:02,937 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:46:02,937 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:46:02,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:46:02,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:46:02,938 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:46:02,938 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:46:02,938 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:46:02,938 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:46:02,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:46:02,939 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:46:02,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:46:02,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:46:02,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:46:02,995 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:46:02,996 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:46:02,996 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2019-09-05 11:46:03,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb541dcd4/b070289012464e6585b27313275a0778/FLAG7863df61e [2019-09-05 11:46:03,433 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:46:03,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2019-09-05 11:46:03,438 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb541dcd4/b070289012464e6585b27313275a0778/FLAG7863df61e [2019-09-05 11:46:03,802 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb541dcd4/b070289012464e6585b27313275a0778 [2019-09-05 11:46:03,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:46:03,813 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:46:03,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:46:03,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:46:03,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:46:03,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:46:03" (1/1) ... [2019-09-05 11:46:03,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72af9ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:46:03, skipping insertion in model container [2019-09-05 11:46:03,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:46:03" (1/1) ... [2019-09-05 11:46:03,828 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:46:03,843 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:46:04,000 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:46:04,005 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:46:04,021 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:46:04,038 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:46:04,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:46:04 WrapperNode [2019-09-05 11:46:04,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:46:04,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:46:04,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:46:04,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:46:04,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:46:04" (1/1) ... [2019-09-05 11:46:04,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:46:04" (1/1) ... [2019-09-05 11:46:04,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:46:04" (1/1) ... [2019-09-05 11:46:04,166 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:46:04" (1/1) ... [2019-09-05 11:46:04,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:46:04" (1/1) ... [2019-09-05 11:46:04,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:46:04" (1/1) ... [2019-09-05 11:46:04,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:46:04" (1/1) ... [2019-09-05 11:46:04,183 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:46:04,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:46:04,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:46:04,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:46:04,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:46:04" (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-05 11:46:04,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:46:04,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:46:04,242 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:46:04,242 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:46:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:46:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:46:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:46:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:46:04,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:46:04,407 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:46:04,407 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 11:46:04,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:46:04 BoogieIcfgContainer [2019-09-05 11:46:04,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:46:04,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:46:04,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:46:04,413 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:46:04,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:46:03" (1/3) ... [2019-09-05 11:46:04,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5295d8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:46:04, skipping insertion in model container [2019-09-05 11:46:04,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:46:04" (2/3) ... [2019-09-05 11:46:04,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5295d8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:46:04, skipping insertion in model container [2019-09-05 11:46:04,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:46:04" (3/3) ... [2019-09-05 11:46:04,416 INFO L109 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2019-09-05 11:46:04,425 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:46:04,432 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:46:04,446 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:46:04,474 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:46:04,475 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:46:04,475 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:46:04,475 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:46:04,476 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:46:04,476 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:46:04,476 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:46:04,476 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:46:04,476 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:46:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2019-09-05 11:46:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 11:46:04,499 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:04,499 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:04,501 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:04,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:04,506 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2019-09-05 11:46:04,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:04,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:04,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:04,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:04,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:04,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:04,602 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-05 11:46:04,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:46:04,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 11:46:04,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 11:46:04,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 11:46:04,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:46:04,624 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2019-09-05 11:46:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:04,643 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-09-05 11:46:04,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 11:46:04,645 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-09-05 11:46:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:04,652 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:46:04,653 INFO L226 Difference]: Without dead ends: 12 [2019-09-05 11:46:04,656 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-05 11:46:04,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-09-05 11:46:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-09-05 11:46:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-09-05 11:46:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-09-05 11:46:04,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-09-05 11:46:04,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:04,692 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-09-05 11:46:04,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 11:46:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-09-05 11:46:04,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-09-05 11:46:04,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:04,693 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:04,693 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:04,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:04,694 INFO L82 PathProgramCache]: Analyzing trace with hash -730736584, now seen corresponding path program 1 times [2019-09-05 11:46:04,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:04,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:04,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:04,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:04,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:04,846 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-05 11:46:04,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:46:04,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-05 11:46:04,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-05 11:46:04,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-05 11:46:04,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:46:04,850 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 3 states. [2019-09-05 11:46:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:04,873 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2019-09-05 11:46:04,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-05 11:46:04,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-09-05 11:46:04,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:04,875 INFO L225 Difference]: With dead ends: 21 [2019-09-05 11:46:04,875 INFO L226 Difference]: Without dead ends: 14 [2019-09-05 11:46:04,876 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-05 11:46:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-09-05 11:46:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-09-05 11:46:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-09-05 11:46:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-09-05 11:46:04,881 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-09-05 11:46:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:04,891 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-09-05 11:46:04,891 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-05 11:46:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-09-05 11:46:04,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-05 11:46:04,892 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:04,892 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:04,893 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:04,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:04,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1082855947, now seen corresponding path program 1 times [2019-09-05 11:46:04,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:04,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:04,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:04,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:04,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:05,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:05,058 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-05 11:46:05,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:05,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:05,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-05 11:46:05,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:05,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:05,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-09-05 11:46:05,146 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:46:05,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:46:05,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:46:05,149 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-09-05 11:46:05,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:05,199 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-05 11:46:05,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:46:05,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-09-05 11:46:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:05,202 INFO L225 Difference]: With dead ends: 23 [2019-09-05 11:46:05,204 INFO L226 Difference]: Without dead ends: 16 [2019-09-05 11:46:05,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:46:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-09-05 11:46:05,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-09-05 11:46:05,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-09-05 11:46:05,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-09-05 11:46:05,212 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2019-09-05 11:46:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:05,213 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-09-05 11:46:05,213 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:46:05,213 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-09-05 11:46:05,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-05 11:46:05,214 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:05,214 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:05,215 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:05,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:05,215 INFO L82 PathProgramCache]: Analyzing trace with hash -167147406, now seen corresponding path program 2 times [2019-09-05 11:46:05,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:05,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:05,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:05,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:05,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:05,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:05,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:05,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:46:05,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:05,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:46:05,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:05,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-05 11:46:05,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:05,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:46:05,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:05,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-05 11:46:05,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:46:05,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:46:05,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:46:05,373 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 6 states. [2019-09-05 11:46:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:05,434 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2019-09-05 11:46:05,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:46:05,435 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-05 11:46:05,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:05,436 INFO L225 Difference]: With dead ends: 25 [2019-09-05 11:46:05,436 INFO L226 Difference]: Without dead ends: 18 [2019-09-05 11:46:05,437 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:46:05,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-05 11:46:05,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-05 11:46:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-05 11:46:05,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-09-05 11:46:05,445 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2019-09-05 11:46:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:05,445 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-09-05 11:46:05,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:46:05,446 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-09-05 11:46:05,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-05 11:46:05,448 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:05,448 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:05,449 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash -639535185, now seen corresponding path program 3 times [2019-09-05 11:46:05,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:05,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:05,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:05,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:05,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:05,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:05,583 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-05 11:46:05,600 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-05 11:46:05,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-05 11:46:05,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:05,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-05 11:46:05,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-05 11:46:05,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-05 11:46:05,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-09-05 11:46:05,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:46:05,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:46:05,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:46:05,656 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 7 states. [2019-09-05 11:46:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:05,737 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-09-05 11:46:05,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:46:05,742 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-09-05 11:46:05,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:05,743 INFO L225 Difference]: With dead ends: 29 [2019-09-05 11:46:05,743 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 11:46:05,743 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:46:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 11:46:05,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-09-05 11:46:05,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-05 11:46:05,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-09-05 11:46:05,750 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2019-09-05 11:46:05,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:05,751 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-09-05 11:46:05,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:46:05,751 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-09-05 11:46:05,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:46:05,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:05,752 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:05,752 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:05,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:05,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1988642215, now seen corresponding path program 1 times [2019-09-05 11:46:05,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:05,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:05,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:05,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:05,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:05,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:05,897 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:05,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:05,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:46:05,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:05,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:05,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-05 11:46:05,970 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:46:05,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:46:05,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:46:05,972 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 8 states. [2019-09-05 11:46:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:06,043 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-09-05 11:46:06,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:46:06,043 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-09-05 11:46:06,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:06,044 INFO L225 Difference]: With dead ends: 31 [2019-09-05 11:46:06,044 INFO L226 Difference]: Without dead ends: 23 [2019-09-05 11:46:06,045 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:46:06,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-05 11:46:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-05 11:46:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-05 11:46:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-09-05 11:46:06,050 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-09-05 11:46:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:06,050 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-09-05 11:46:06,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:46:06,051 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-09-05 11:46:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-09-05 11:46:06,051 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:06,051 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:06,052 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:06,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:06,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1766658852, now seen corresponding path program 2 times [2019-09-05 11:46:06,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:06,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:06,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:06,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:06,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:06,191 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:06,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:06,191 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) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:06,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:46:06,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:46:06,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:06,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-05 11:46:06,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:06,264 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:06,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:06,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2019-09-05 11:46:06,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-05 11:46:06,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-05 11:46:06,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:46:06,269 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 10 states. [2019-09-05 11:46:06,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:06,382 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-09-05 11:46:06,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:46:06,383 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-09-05 11:46:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:06,383 INFO L225 Difference]: With dead ends: 33 [2019-09-05 11:46:06,384 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 11:46:06,385 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-05 11:46:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 11:46:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-05 11:46:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 11:46:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-09-05 11:46:06,397 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-09-05 11:46:06,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:06,397 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-09-05 11:46:06,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-05 11:46:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-09-05 11:46:06,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 11:46:06,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:06,399 INFO L399 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:06,399 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:06,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:06,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1105955487, now seen corresponding path program 3 times [2019-09-05 11:46:06,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:06,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:06,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:06,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:06,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:06,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:06,562 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) [2019-09-05 11:46:06,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:06,594 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 11:46:06,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:06,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:46:06,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-09-05 11:46:06,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:06,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 11 [2019-09-05 11:46:06,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:46:06,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:46:06,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:46:06,639 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2019-09-05 11:46:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:07,296 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-09-05 11:46:07,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-05 11:46:07,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-09-05 11:46:07,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:07,298 INFO L225 Difference]: With dead ends: 40 [2019-09-05 11:46:07,298 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 11:46:07,299 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:46:07,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 11:46:07,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-09-05 11:46:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 11:46:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-09-05 11:46:07,306 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 24 [2019-09-05 11:46:07,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:07,307 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-09-05 11:46:07,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:46:07,309 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-09-05 11:46:07,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:46:07,310 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:07,310 INFO L399 BasicCegarLoop]: trace histogram [9, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:07,311 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:07,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:07,311 INFO L82 PathProgramCache]: Analyzing trace with hash -806317607, now seen corresponding path program 4 times [2019-09-05 11:46:07,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:07,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:07,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:07,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:07,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:07,509 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:46:07,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:07,510 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-05 11:46:07,523 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:07,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:46:07,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:07,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 11:46:07,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 24 proven. 56 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:46:07,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:07,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-09-05 11:46:07,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-05 11:46:07,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-05 11:46:07,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:46:07,591 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 11 states. [2019-09-05 11:46:07,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:07,712 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2019-09-05 11:46:07,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-05 11:46:07,713 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-09-05 11:46:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:07,713 INFO L225 Difference]: With dead ends: 41 [2019-09-05 11:46:07,714 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 11:46:07,714 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-05 11:46:07,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 11:46:07,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-09-05 11:46:07,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 11:46:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-09-05 11:46:07,719 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2019-09-05 11:46:07,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:07,720 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-09-05 11:46:07,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-05 11:46:07,720 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-09-05 11:46:07,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-05 11:46:07,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:07,721 INFO L399 BasicCegarLoop]: trace histogram [10, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:07,721 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:07,721 INFO L82 PathProgramCache]: Analyzing trace with hash -251489706, now seen corresponding path program 5 times [2019-09-05 11:46:07,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:07,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:07,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:07,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:07,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 72 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:46:07,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:07,889 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-05 11:46:07,905 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:40,073 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-09-05 11:46:40,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:40,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 23 conjunts are in the unsatisfiable core [2019-09-05 11:46:40,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:40,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:40,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 14 [2019-09-05 11:46:40,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:46:40,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:46:40,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:46:40,269 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 14 states. [2019-09-05 11:46:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:40,454 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2019-09-05 11:46:40,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-05 11:46:40,454 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2019-09-05 11:46:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:40,455 INFO L225 Difference]: With dead ends: 43 [2019-09-05 11:46:40,455 INFO L226 Difference]: Without dead ends: 33 [2019-09-05 11:46:40,456 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:46:40,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-05 11:46:40,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-05 11:46:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 11:46:40,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-09-05 11:46:40,466 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2019-09-05 11:46:40,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:40,466 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-09-05 11:46:40,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:46:40,471 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-09-05 11:46:40,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 11:46:40,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:40,472 INFO L399 BasicCegarLoop]: trace histogram [11, 9, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:40,472 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:40,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:40,473 INFO L82 PathProgramCache]: Analyzing trace with hash 362178451, now seen corresponding path program 6 times [2019-09-05 11:46:40,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:40,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:40,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:40,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:40,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:40,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 30 proven. 90 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:46:40,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:40,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:46:40,668 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:41,332 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2019-09-05 11:46:41,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:41,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 11:46:41,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-05 11:46:41,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:41,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-09-05 11:46:41,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-05 11:46:41,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-05 11:46:41,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:46:41,461 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 18 states. [2019-09-05 11:46:44,359 WARN L188 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 11:46:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:55,798 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2019-09-05 11:46:55,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-05 11:46:55,798 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2019-09-05 11:46:55,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:55,801 INFO L225 Difference]: With dead ends: 63 [2019-09-05 11:46:55,801 INFO L226 Difference]: Without dead ends: 53 [2019-09-05 11:46:55,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=196, Invalid=559, Unknown=1, NotChecked=0, Total=756 [2019-09-05 11:46:55,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-09-05 11:46:55,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-09-05 11:46:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 11:46:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-05 11:46:55,809 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 32 [2019-09-05 11:46:55,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:55,809 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-05 11:46:55,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-05 11:46:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-05 11:46:55,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-05 11:46:55,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:55,810 INFO L399 BasicCegarLoop]: trace histogram [14, 10, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:55,811 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:55,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:55,811 INFO L82 PathProgramCache]: Analyzing trace with hash 284766406, now seen corresponding path program 7 times [2019-09-05 11:46:55,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:55,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:55,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:55,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:55,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 11:46:56,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:56,007 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-05 11:46:56,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:56,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2019-09-05 11:46:56,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:56,087 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 77 proven. 110 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 11:46:56,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:56,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-09-05 11:46:56,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-05 11:46:56,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-05 11:46:56,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:46:56,092 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 14 states. [2019-09-05 11:46:56,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:56,300 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-09-05 11:46:56,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-05 11:46:56,300 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2019-09-05 11:46:56,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:56,301 INFO L225 Difference]: With dead ends: 55 [2019-09-05 11:46:56,301 INFO L226 Difference]: Without dead ends: 41 [2019-09-05 11:46:56,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-05 11:46:56,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-05 11:46:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-05 11:46:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 11:46:56,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-05 11:46:56,307 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 38 [2019-09-05 11:46:56,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:56,307 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-05 11:46:56,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-05 11:46:56,307 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-05 11:46:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 11:46:56,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:56,308 INFO L399 BasicCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:56,308 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:56,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:56,309 INFO L82 PathProgramCache]: Analyzing trace with hash 926316803, now seen corresponding path program 8 times [2019-09-05 11:46:56,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:56,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:56,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:56,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:46:56,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:56,505 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 11:46:56,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:56,506 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) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:46:56,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:46:56,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:46:56,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:56,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:46:56,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:46:56,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:56,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18] total 19 [2019-09-05 11:46:56,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:46:56,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:46:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:46:56,679 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 19 states. [2019-09-05 11:46:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:46:56,981 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2019-09-05 11:46:56,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-05 11:46:56,982 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2019-09-05 11:46:56,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:46:56,983 INFO L225 Difference]: With dead ends: 57 [2019-09-05 11:46:56,983 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 11:46:56,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:46:56,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 11:46:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-09-05 11:46:56,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 11:46:56,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2019-09-05 11:46:56,993 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 40 [2019-09-05 11:46:56,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:46:56,993 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2019-09-05 11:46:56,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:46:56,994 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2019-09-05 11:46:56,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-05 11:46:56,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:46:56,995 INFO L399 BasicCegarLoop]: trace histogram [16, 12, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:46:56,995 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:46:56,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:46:56,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1019042304, now seen corresponding path program 9 times [2019-09-05 11:46:56,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:46:56,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:46:56,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:56,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:46:56,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:46:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:46:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 91 proven. 156 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 11:46:57,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:46:57,232 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-05 11:46:57,242 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:46:57,884 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-09-05 11:46:57,884 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:46:57,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:46:57,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:46:58,010 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 16 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-09-05 11:46:58,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:46:58,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7] total 20 [2019-09-05 11:46:58,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:46:58,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:46:58,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:46:58,016 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 20 states. [2019-09-05 11:47:04,871 WARN L188 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 11:47:09,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:09,950 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2019-09-05 11:47:09,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:47:09,951 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-09-05 11:47:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:09,952 INFO L225 Difference]: With dead ends: 66 [2019-09-05 11:47:09,952 INFO L226 Difference]: Without dead ends: 52 [2019-09-05 11:47:09,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=151, Invalid=498, Unknown=1, NotChecked=0, Total=650 [2019-09-05 11:47:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-09-05 11:47:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2019-09-05 11:47:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-05 11:47:09,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2019-09-05 11:47:09,960 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 42 [2019-09-05 11:47:09,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:09,960 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2019-09-05 11:47:09,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:47:09,961 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2019-09-05 11:47:09,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-05 11:47:09,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:09,961 INFO L399 BasicCegarLoop]: trace histogram [18, 13, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:09,962 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:09,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1622573432, now seen corresponding path program 10 times [2019-09-05 11:47:09,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:09,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:09,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:09,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:09,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 11:47:10,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:10,190 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-05 11:47:10,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:47:10,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:47:10,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:47:10,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 30 conjunts are in the unsatisfiable core [2019-09-05 11:47:10,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:47:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 126 proven. 182 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 11:47:10,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:47:10,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-09-05 11:47:10,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-05 11:47:10,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-05 11:47:10,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:47:10,297 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 17 states. [2019-09-05 11:47:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:47:10,555 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-09-05 11:47:10,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-05 11:47:10,556 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2019-09-05 11:47:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:47:10,557 INFO L225 Difference]: With dead ends: 65 [2019-09-05 11:47:10,557 INFO L226 Difference]: Without dead ends: 49 [2019-09-05 11:47:10,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-05 11:47:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-09-05 11:47:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-09-05 11:47:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-09-05 11:47:10,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-09-05 11:47:10,565 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 46 [2019-09-05 11:47:10,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:47:10,565 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-09-05 11:47:10,565 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-05 11:47:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-09-05 11:47:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-05 11:47:10,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:47:10,566 INFO L399 BasicCegarLoop]: trace histogram [19, 14, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:47:10,566 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:47:10,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:47:10,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1921368907, now seen corresponding path program 11 times [2019-09-05 11:47:10,567 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:47:10,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:47:10,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:10,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:47:10,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:47:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:47:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 135 proven. 210 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 11:47:10,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:47:10,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 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-05 11:47:10,813 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-09-05 11:50:05,402 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2019-09-05 11:50:05,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:05,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-05 11:50:05,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 112 proven. 240 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-05 11:50:05,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:05,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 19 [2019-09-05 11:50:05,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-05 11:50:05,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-05 11:50:05,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:50:05,699 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 19 states. [2019-09-05 11:50:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:50:06,030 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2019-09-05 11:50:06,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-05 11:50:06,030 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2019-09-05 11:50:06,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:50:06,031 INFO L225 Difference]: With dead ends: 67 [2019-09-05 11:50:06,031 INFO L226 Difference]: Without dead ends: 51 [2019-09-05 11:50:06,032 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2019-09-05 11:50:06,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-09-05 11:50:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-09-05 11:50:06,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-09-05 11:50:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2019-09-05 11:50:06,037 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 48 [2019-09-05 11:50:06,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:50:06,038 INFO L475 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2019-09-05 11:50:06,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-05 11:50:06,038 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2019-09-05 11:50:06,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-05 11:50:06,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:50:06,039 INFO L399 BasicCegarLoop]: trace histogram [20, 15, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:50:06,039 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:50:06,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:50:06,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1740890958, now seen corresponding path program 12 times [2019-09-05 11:50:06,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:50:06,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:50:06,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:06,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:50:06,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:50:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:50:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 144 proven. 240 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-05 11:50:06,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:50:06,310 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-05 11:50:06,320 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-09-05 11:50:06,496 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2019-09-05 11:50:06,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:50:06,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 32 conjunts are in the unsatisfiable core [2019-09-05 11:50:06,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:50:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 174 proven. 196 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-05 11:50:06,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:50:06,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2019-09-05 11:50:06,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-05 11:50:06,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-05 11:50:06,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2019-09-05 11:50:06,936 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 33 states. [2019-09-05 11:50:22,439 WARN L188 SmtUtils]: Spent 11.05 s on a formula simplification. DAG size of input: 52 DAG size of output: 16 [2019-09-05 11:50:37,799 WARN L188 SmtUtils]: Spent 5.56 s on a formula simplification. DAG size of input: 48 DAG size of output: 12 [2019-09-05 11:50:42,444 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967290) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967282) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967278) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967276) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-05 11:50:44,509 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967290) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967282) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967278) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-05 11:50:52,129 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967282) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967276) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-05 11:51:06,330 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 11:51:12,814 WARN L188 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 11:51:14,832 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967282) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-05 11:51:29,979 WARN L188 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 11:51:44,413 WARN L188 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 56 DAG size of output: 12 [2019-09-05 11:51:48,054 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967290) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967282) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967278) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967276) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-05 11:51:52,790 WARN L188 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2019-09-05 11:51:59,241 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967290) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967282) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967278) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-05 11:52:07,842 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967290) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-05 11:52:38,388 WARN L188 SmtUtils]: Spent 8.16 s on a formula simplification. DAG size of input: 44 DAG size of output: 12 [2019-09-05 11:52:41,115 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 11:53:10,728 WARN L188 SmtUtils]: Spent 12.36 s on a formula simplification. DAG size of input: 48 DAG size of output: 16 [2019-09-05 11:53:31,667 WARN L188 SmtUtils]: Spent 10.31 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-05 11:53:41,232 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967294) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967278) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967276) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-05 11:54:06,579 WARN L188 SmtUtils]: Spent 9.57 s on a formula simplification. DAG size of input: 48 DAG size of output: 16 [2019-09-05 11:54:16,557 WARN L188 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 11:54:20,684 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967290) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967284) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967288) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967292) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967282) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967294) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967280) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967291) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-05 11:54:35,695 WARN L188 SmtUtils]: Spent 6.79 s on a formula simplification. DAG size of input: 60 DAG size of output: 12 [2019-09-05 11:54:57,073 WARN L188 SmtUtils]: Spent 2.98 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 11:55:12,328 WARN L188 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 48 DAG size of output: 12 [2019-09-05 11:55:17,645 WARN L188 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 11:55:20,951 WARN L188 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 11:55:22,546 WARN L188 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 11:55:34,862 WARN L188 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 11:55:45,171 WARN L188 SmtUtils]: Spent 3.17 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 11:56:00,024 WARN L188 SmtUtils]: Spent 6.40 s on a formula simplification. DAG size of input: 40 DAG size of output: 12 [2019-09-05 11:56:00,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:56:00,026 INFO L93 Difference]: Finished difference Result 131 states and 177 transitions. [2019-09-05 11:56:00,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-09-05 11:56:00,026 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 50 [2019-09-05 11:56:00,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:56:00,027 INFO L225 Difference]: With dead ends: 131 [2019-09-05 11:56:00,028 INFO L226 Difference]: Without dead ends: 115 [2019-09-05 11:56:00,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 66 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 298.2s TimeCoverageRelationStatistics Valid=683, Invalid=2724, Unknown=51, NotChecked=1098, Total=4556 [2019-09-05 11:56:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-09-05 11:56:00,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 80. [2019-09-05 11:56:00,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-05 11:56:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2019-09-05 11:56:00,039 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 50 [2019-09-05 11:56:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:56:00,039 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2019-09-05 11:56:00,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-05 11:56:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2019-09-05 11:56:00,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-05 11:56:00,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:56:00,041 INFO L399 BasicCegarLoop]: trace histogram [22, 16, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:56:00,041 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:56:00,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:56:00,041 INFO L82 PathProgramCache]: Analyzing trace with hash -741259606, now seen corresponding path program 13 times [2019-09-05 11:56:00,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:56:00,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:56:00,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:56:00,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:56:00,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:56:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:56:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 11:56:00,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:56:00,353 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-05 11:56:00,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:56:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:56:00,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 36 conjunts are in the unsatisfiable core [2019-09-05 11:56:00,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:56:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 187 proven. 272 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-05 11:56:00,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:56:00,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-09-05 11:56:00,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-05 11:56:00,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-05 11:56:00,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:56:00,473 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 20 states. [2019-09-05 11:56:00,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:56:00,903 INFO L93 Difference]: Finished difference Result 119 states and 155 transitions. [2019-09-05 11:56:00,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-05 11:56:00,903 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 54 [2019-09-05 11:56:00,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:56:00,905 INFO L225 Difference]: With dead ends: 119 [2019-09-05 11:56:00,905 INFO L226 Difference]: Without dead ends: 80 [2019-09-05 11:56:00,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-05 11:56:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-09-05 11:56:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-09-05 11:56:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-09-05 11:56:00,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2019-09-05 11:56:00,916 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 54 [2019-09-05 11:56:00,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:56:00,916 INFO L475 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2019-09-05 11:56:00,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-05 11:56:00,916 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2019-09-05 11:56:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-09-05 11:56:00,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:56:00,918 INFO L399 BasicCegarLoop]: trace histogram [24, 17, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:56:00,918 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:56:00,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:56:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1177603106, now seen corresponding path program 14 times [2019-09-05 11:56:00,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:56:00,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:56:00,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:56:00,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:56:00,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:56:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:56:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 306 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:56:01,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:56:01,202 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-05 11:56:01,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:56:01,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:56:01,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:56:01,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-05 11:56:01,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:56:01,447 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:56:01,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:56:01,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 27] total 28 [2019-09-05 11:56:01,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-05 11:56:01,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-05 11:56:01,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:56:01,451 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand 28 states. [2019-09-05 11:56:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:56:02,097 INFO L93 Difference]: Finished difference Result 121 states and 157 transitions. [2019-09-05 11:56:02,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:56:02,097 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 58 [2019-09-05 11:56:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:56:02,098 INFO L225 Difference]: With dead ends: 121 [2019-09-05 11:56:02,098 INFO L226 Difference]: Without dead ends: 82 [2019-09-05 11:56:02,099 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2019-09-05 11:56:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-09-05 11:56:02,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-09-05 11:56:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-05 11:56:02,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2019-09-05 11:56:02,112 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 58 [2019-09-05 11:56:02,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:56:02,112 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2019-09-05 11:56:02,112 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-05 11:56:02,112 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2019-09-05 11:56:02,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-05 11:56:02,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:56:02,116 INFO L399 BasicCegarLoop]: trace histogram [25, 18, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:56:02,116 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:56:02,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:56:02,116 INFO L82 PathProgramCache]: Analyzing trace with hash -244542497, now seen corresponding path program 15 times [2019-09-05 11:56:02,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:56:02,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:56:02,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:56:02,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:56:02,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:56:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:56:02,517 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 247 proven. 342 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-05 11:56:02,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:56:02,518 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-05 11:56:02,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:56:12,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-09-05 11:56:12,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:56:13,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 18 conjunts are in the unsatisfiable core [2019-09-05 11:56:13,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:56:13,362 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 270 proven. 49 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2019-09-05 11:56:13,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:56:13,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 10] total 29 [2019-09-05 11:56:13,367 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-05 11:56:13,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-05 11:56:13,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2019-09-05 11:56:13,368 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand 29 states. [2019-09-05 11:56:25,172 WARN L188 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 36 DAG size of output: 12 [2019-09-05 11:56:36,047 WARN L188 SmtUtils]: Spent 4.26 s on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-09-05 11:56:50,823 WARN L188 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 11:56:58,631 WARN L188 SmtUtils]: Spent 2.57 s on a formula simplification. DAG size of input: 24 DAG size of output: 12 [2019-09-05 11:57:10,679 WARN L188 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 11:57:14,198 WARN L188 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2019-09-05 11:57:18,510 WARN L838 $PredicateComparison]: unable to prove that (and (< (mod (+ c_main_~x~0 4294967283) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967281) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967285) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ c_main_~x~0 4294967293) 4294967296) 65520)) is different from false [2019-09-05 11:57:24,864 WARN L188 SmtUtils]: Spent 4.12 s on a formula simplification that was a NOOP. DAG size: 16 [2019-09-05 11:57:29,842 WARN L188 SmtUtils]: Spent 2.64 s on a formula simplification. DAG size of input: 28 DAG size of output: 12 [2019-09-05 11:57:36,874 WARN L188 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 32 DAG size of output: 12 [2019-09-05 11:57:56,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:57:56,895 INFO L93 Difference]: Finished difference Result 170 states and 231 transitions. [2019-09-05 11:57:56,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-05 11:57:56,896 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2019-09-05 11:57:56,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:57:56,897 INFO L225 Difference]: With dead ends: 170 [2019-09-05 11:57:56,897 INFO L226 Difference]: Without dead ends: 131 [2019-09-05 11:57:56,898 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 73.7s TimeCoverageRelationStatistics Valid=321, Invalid=1235, Unknown=8, NotChecked=76, Total=1640 [2019-09-05 11:57:56,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-09-05 11:57:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 109. [2019-09-05 11:57:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-09-05 11:57:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 139 transitions. [2019-09-05 11:57:56,908 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 139 transitions. Word has length 60 [2019-09-05 11:57:56,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:57:56,909 INFO L475 AbstractCegarLoop]: Abstraction has 109 states and 139 transitions. [2019-09-05 11:57:56,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-05 11:57:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 139 transitions. [2019-09-05 11:57:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-05 11:57:56,910 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:57:56,910 INFO L399 BasicCegarLoop]: trace histogram [27, 19, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:57:56,910 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:57:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:57:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash 545304151, now seen corresponding path program 16 times [2019-09-05 11:57:56,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:57:56,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:57:56,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:56,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:57:56,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:57:57,267 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 11:57:57,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:57:57,268 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) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:57:57,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:57:57,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:57:57,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:57:57,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 42 conjunts are in the unsatisfiable core [2019-09-05 11:57:57,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:57:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 11:57:57,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:57:57,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-09-05 11:57:57,403 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-05 11:57:57,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-05 11:57:57,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:57:57,404 INFO L87 Difference]: Start difference. First operand 109 states and 139 transitions. Second operand 23 states. [2019-09-05 11:57:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:57:58,010 INFO L93 Difference]: Finished difference Result 175 states and 235 transitions. [2019-09-05 11:57:58,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:57:58,014 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2019-09-05 11:57:58,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:57:58,015 INFO L225 Difference]: With dead ends: 175 [2019-09-05 11:57:58,015 INFO L226 Difference]: Without dead ends: 111 [2019-09-05 11:57:58,016 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-05 11:57:58,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-09-05 11:57:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-09-05 11:57:58,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-09-05 11:57:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 141 transitions. [2019-09-05 11:57:58,031 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 141 transitions. Word has length 64 [2019-09-05 11:57:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:57:58,031 INFO L475 AbstractCegarLoop]: Abstraction has 111 states and 141 transitions. [2019-09-05 11:57:58,031 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-05 11:57:58,031 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 141 transitions. [2019-09-05 11:57:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-05 11:57:58,033 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:57:58,033 INFO L399 BasicCegarLoop]: trace histogram [28, 20, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:57:58,033 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:57:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:57:58,034 INFO L82 PathProgramCache]: Analyzing trace with hash 965014612, now seen corresponding path program 17 times [2019-09-05 11:57:58,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:57:58,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:57:58,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:58,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:57:58,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:57:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:57:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 420 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-05 11:57:58,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:57:58,386 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-05 11:57:58,396 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1