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/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:05:51,587 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:05:51,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:05:51,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:05:51,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:05:51,610 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:05:51,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:05:51,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:05:51,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:05:51,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:05:51,626 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:05:51,627 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:05:51,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:05:51,629 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:05:51,630 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:05:51,631 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:05:51,632 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:05:51,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:05:51,635 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:05:51,637 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:05:51,638 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:05:51,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:05:51,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:05:51,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:05:51,643 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:05:51,643 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:05:51,643 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:05:51,644 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:05:51,645 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:05:51,645 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:05:51,646 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:05:51,646 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:05:51,647 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:05:51,648 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:05:51,649 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:05:51,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:05:51,650 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:05:51,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:05:51,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:05:51,651 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:05:51,652 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:05:51,652 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-08 11:05:51,667 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:05:51,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:05:51,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:05:51,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:05:51,669 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:05:51,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:05:51,669 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:05:51,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:05:51,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:05:51,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:05:51,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:05:51,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:05:51,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:05:51,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:05:51,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:05:51,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:05:51,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:05:51,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:05:51,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:05:51,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:05:51,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:05:51,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:05:51,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:05:51,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:05:51,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:05:51,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:05:51,673 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:05:51,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:05:51,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:05:51,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:05:51,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:05:51,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:05:51,726 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:05:51,727 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:05:51,727 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 11:05:51,802 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8376b4a55/744823a795464f05aaf6f23a5cd8b28c/FLAG537446fe2 [2019-09-08 11:05:52,301 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:05:52,302 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 11:05:52,313 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8376b4a55/744823a795464f05aaf6f23a5cd8b28c/FLAG537446fe2 [2019-09-08 11:05:52,632 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8376b4a55/744823a795464f05aaf6f23a5cd8b28c [2019-09-08 11:05:52,641 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:05:52,643 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:05:52,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:05:52,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:05:52,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:05:52,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:05:52" (1/1) ... [2019-09-08 11:05:52,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d8f11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:05:52, skipping insertion in model container [2019-09-08 11:05:52,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:05:52" (1/1) ... [2019-09-08 11:05:52,659 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:05:52,722 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:05:53,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:05:53,116 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:05:53,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:05:53,221 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:05:53,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:05:53 WrapperNode [2019-09-08 11:05:53,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:05:53,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:05:53,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:05:53,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:05:53,233 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:05:53" (1/1) ... [2019-09-08 11:05:53,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:05:53" (1/1) ... [2019-09-08 11:05:53,243 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:05:53" (1/1) ... [2019-09-08 11:05:53,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:05:53" (1/1) ... [2019-09-08 11:05:53,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:05:53" (1/1) ... [2019-09-08 11:05:53,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:05:53" (1/1) ... [2019-09-08 11:05:53,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:05:53" (1/1) ... [2019-09-08 11:05:53,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:05:53,277 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:05:53,277 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:05:53,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:05:53,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:05:53" (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-08 11:05:53,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:05:53,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:05:53,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:05:53,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:05:53,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:05:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:05:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:05:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:05:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:05:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:05:53,353 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:05:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:05:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:05:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:05:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:05:53,354 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:05:53,355 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:05:53,355 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:05:53,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:05:53,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:05:54,166 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:05:54,167 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:05:54,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:05:54 BoogieIcfgContainer [2019-09-08 11:05:54,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:05:54,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:05:54,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:05:54,173 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:05:54,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:05:52" (1/3) ... [2019-09-08 11:05:54,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce478cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:05:54, skipping insertion in model container [2019-09-08 11:05:54,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:05:53" (2/3) ... [2019-09-08 11:05:54,175 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce478cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:05:54, skipping insertion in model container [2019-09-08 11:05:54,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:05:54" (3/3) ... [2019-09-08 11:05:54,177 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.2.ufo.BOUNDED-10.pals.c.v+cfa-reducer.c [2019-09-08 11:05:54,190 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:05:54,201 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:05:54,218 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:05:54,264 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:05:54,265 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:05:54,265 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:05:54,265 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:05:54,265 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:05:54,266 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:05:54,266 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:05:54,266 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:05:54,267 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:05:54,299 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2019-09-08 11:05:54,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:05:54,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:54,313 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:05:54,315 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:54,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:54,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1692654370, now seen corresponding path program 1 times [2019-09-08 11:05:54,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:54,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:54,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:54,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:54,789 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-08 11:05:54,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:54,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:05:54,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:05:54,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:05:54,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:54,815 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2019-09-08 11:05:54,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:54,903 INFO L93 Difference]: Finished difference Result 319 states and 513 transitions. [2019-09-08 11:05:54,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:05:54,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 11:05:54,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:54,920 INFO L225 Difference]: With dead ends: 319 [2019-09-08 11:05:54,920 INFO L226 Difference]: Without dead ends: 214 [2019-09-08 11:05:54,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:54,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-09-08 11:05:55,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2019-09-08 11:05:55,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-09-08 11:05:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 315 transitions. [2019-09-08 11:05:55,013 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 315 transitions. Word has length 64 [2019-09-08 11:05:55,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:55,014 INFO L475 AbstractCegarLoop]: Abstraction has 212 states and 315 transitions. [2019-09-08 11:05:55,014 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:05:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 315 transitions. [2019-09-08 11:05:55,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-09-08 11:05:55,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:55,018 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:05:55,018 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:55,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:55,018 INFO L82 PathProgramCache]: Analyzing trace with hash 140291049, now seen corresponding path program 1 times [2019-09-08 11:05:55,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:55,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:55,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:55,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:55,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:55,187 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-08 11:05:55,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:55,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:05:55,190 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:05:55,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:05:55,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:55,191 INFO L87 Difference]: Start difference. First operand 212 states and 315 transitions. Second operand 3 states. [2019-09-08 11:05:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:55,266 INFO L93 Difference]: Finished difference Result 526 states and 815 transitions. [2019-09-08 11:05:55,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:05:55,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-09-08 11:05:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:55,274 INFO L225 Difference]: With dead ends: 526 [2019-09-08 11:05:55,275 INFO L226 Difference]: Without dead ends: 353 [2019-09-08 11:05:55,278 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:55,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2019-09-08 11:05:55,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2019-09-08 11:05:55,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-09-08 11:05:55,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 536 transitions. [2019-09-08 11:05:55,334 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 536 transitions. Word has length 64 [2019-09-08 11:05:55,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:55,334 INFO L475 AbstractCegarLoop]: Abstraction has 351 states and 536 transitions. [2019-09-08 11:05:55,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:05:55,334 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 536 transitions. [2019-09-08 11:05:55,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:05:55,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:55,337 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:05:55,337 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:55,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:55,338 INFO L82 PathProgramCache]: Analyzing trace with hash -854561524, now seen corresponding path program 1 times [2019-09-08 11:05:55,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:55,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:55,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:55,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:55,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:55,447 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-08 11:05:55,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:55,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:05:55,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:05:55,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:05:55,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:55,449 INFO L87 Difference]: Start difference. First operand 351 states and 536 transitions. Second operand 3 states. [2019-09-08 11:05:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:55,509 INFO L93 Difference]: Finished difference Result 911 states and 1426 transitions. [2019-09-08 11:05:55,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:05:55,515 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 11:05:55,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:55,520 INFO L225 Difference]: With dead ends: 911 [2019-09-08 11:05:55,520 INFO L226 Difference]: Without dead ends: 599 [2019-09-08 11:05:55,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:55,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-09-08 11:05:55,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2019-09-08 11:05:55,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-09-08 11:05:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 924 transitions. [2019-09-08 11:05:55,563 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 924 transitions. Word has length 65 [2019-09-08 11:05:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:55,564 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 924 transitions. [2019-09-08 11:05:55,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:05:55,564 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 924 transitions. [2019-09-08 11:05:55,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:05:55,566 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:55,567 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:05:55,567 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:55,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:55,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1360555230, now seen corresponding path program 1 times [2019-09-08 11:05:55,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:55,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:55,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:55,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:55,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:55,662 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-08 11:05:55,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:55,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:05:55,664 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:05:55,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:05:55,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:55,665 INFO L87 Difference]: Start difference. First operand 597 states and 924 transitions. Second operand 3 states. [2019-09-08 11:05:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:55,728 INFO L93 Difference]: Finished difference Result 1585 states and 2486 transitions. [2019-09-08 11:05:55,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:05:55,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 11:05:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:55,736 INFO L225 Difference]: With dead ends: 1585 [2019-09-08 11:05:55,736 INFO L226 Difference]: Without dead ends: 1027 [2019-09-08 11:05:55,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:55,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-09-08 11:05:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 1025. [2019-09-08 11:05:55,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1025 states. [2019-09-08 11:05:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1592 transitions. [2019-09-08 11:05:55,810 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1592 transitions. Word has length 66 [2019-09-08 11:05:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:55,811 INFO L475 AbstractCegarLoop]: Abstraction has 1025 states and 1592 transitions. [2019-09-08 11:05:55,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:05:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1592 transitions. [2019-09-08 11:05:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:05:55,814 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:55,814 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:05:55,814 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:55,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:55,815 INFO L82 PathProgramCache]: Analyzing trace with hash 689018699, now seen corresponding path program 1 times [2019-09-08 11:05:55,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:55,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:55,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:55,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:55,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:55,921 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-08 11:05:55,921 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:55,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:05:55,922 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:05:55,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:05:55,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:55,923 INFO L87 Difference]: Start difference. First operand 1025 states and 1592 transitions. Second operand 3 states. [2019-09-08 11:05:56,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:56,007 INFO L93 Difference]: Finished difference Result 2741 states and 4282 transitions. [2019-09-08 11:05:56,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:05:56,007 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 11:05:56,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:56,017 INFO L225 Difference]: With dead ends: 2741 [2019-09-08 11:05:56,017 INFO L226 Difference]: Without dead ends: 1755 [2019-09-08 11:05:56,020 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:05:56,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2019-09-08 11:05:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2019-09-08 11:05:56,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2019-09-08 11:05:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2712 transitions. [2019-09-08 11:05:56,105 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2712 transitions. Word has length 67 [2019-09-08 11:05:56,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:56,106 INFO L475 AbstractCegarLoop]: Abstraction has 1753 states and 2712 transitions. [2019-09-08 11:05:56,106 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:05:56,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2712 transitions. [2019-09-08 11:05:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:05:56,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:56,107 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:05:56,108 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:56,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash 536594407, now seen corresponding path program 1 times [2019-09-08 11:05:56,108 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:56,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:56,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:56,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:56,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:56,282 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-08 11:05:56,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:56,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:05:56,283 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:05:56,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:05:56,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:05:56,284 INFO L87 Difference]: Start difference. First operand 1753 states and 2712 transitions. Second operand 7 states. [2019-09-08 11:05:56,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:56,862 INFO L93 Difference]: Finished difference Result 9043 states and 13965 transitions. [2019-09-08 11:05:56,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:05:56,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-09-08 11:05:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:56,903 INFO L225 Difference]: With dead ends: 9043 [2019-09-08 11:05:56,904 INFO L226 Difference]: Without dead ends: 7329 [2019-09-08 11:05:56,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:05:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7329 states. [2019-09-08 11:05:57,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7329 to 7321. [2019-09-08 11:05:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2019-09-08 11:05:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 11256 transitions. [2019-09-08 11:05:57,378 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 11256 transitions. Word has length 68 [2019-09-08 11:05:57,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:57,381 INFO L475 AbstractCegarLoop]: Abstraction has 7321 states and 11256 transitions. [2019-09-08 11:05:57,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:05:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 11256 transitions. [2019-09-08 11:05:57,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:05:57,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:57,384 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:05:57,384 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:57,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:57,384 INFO L82 PathProgramCache]: Analyzing trace with hash -451828971, now seen corresponding path program 1 times [2019-09-08 11:05:57,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:57,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:57,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:57,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:57,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:57,611 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-08 11:05:57,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:57,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:05:57,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:05:57,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:05:57,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:05:57,614 INFO L87 Difference]: Start difference. First operand 7321 states and 11256 transitions. Second operand 7 states. [2019-09-08 11:05:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:59,456 INFO L93 Difference]: Finished difference Result 37253 states and 57406 transitions. [2019-09-08 11:05:59,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:05:59,456 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-09-08 11:05:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:59,573 INFO L225 Difference]: With dead ends: 37253 [2019-09-08 11:05:59,573 INFO L226 Difference]: Without dead ends: 29971 [2019-09-08 11:05:59,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-09-08 11:05:59,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29971 states. [2019-09-08 11:06:00,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29971 to 14601. [2019-09-08 11:06:00,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14601 states. [2019-09-08 11:06:00,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 22152 transitions. [2019-09-08 11:06:00,783 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 22152 transitions. Word has length 70 [2019-09-08 11:06:00,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:00,784 INFO L475 AbstractCegarLoop]: Abstraction has 14601 states and 22152 transitions. [2019-09-08 11:06:00,784 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:06:00,784 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 22152 transitions. [2019-09-08 11:06:00,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:06:00,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:00,785 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:00,786 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:00,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:00,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1140328934, now seen corresponding path program 1 times [2019-09-08 11:06:00,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:00,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:00,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:00,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:00,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:00,894 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-08 11:06:00,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:00,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:06:00,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:06:00,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:06:00,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:06:00,895 INFO L87 Difference]: Start difference. First operand 14601 states and 22152 transitions. Second operand 5 states. [2019-09-08 11:06:02,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:02,751 INFO L93 Difference]: Finished difference Result 29803 states and 44905 transitions. [2019-09-08 11:06:02,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:06:02,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:06:02,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:02,817 INFO L225 Difference]: With dead ends: 29803 [2019-09-08 11:06:02,818 INFO L226 Difference]: Without dead ends: 29801 [2019-09-08 11:06:02,828 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:06:02,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29801 states. [2019-09-08 11:06:03,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29801 to 15241. [2019-09-08 11:06:03,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15241 states. [2019-09-08 11:06:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15241 states to 15241 states and 22792 transitions. [2019-09-08 11:06:03,912 INFO L78 Accepts]: Start accepts. Automaton has 15241 states and 22792 transitions. Word has length 71 [2019-09-08 11:06:03,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:03,913 INFO L475 AbstractCegarLoop]: Abstraction has 15241 states and 22792 transitions. [2019-09-08 11:06:03,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:06:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 15241 states and 22792 transitions. [2019-09-08 11:06:03,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:06:03,914 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:03,914 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:03,915 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:03,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:03,915 INFO L82 PathProgramCache]: Analyzing trace with hash -980838812, now seen corresponding path program 1 times [2019-09-08 11:06:03,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:03,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:03,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:03,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:03,971 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-08 11:06:03,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:03,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:06:03,972 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:06:03,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:06:03,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:03,973 INFO L87 Difference]: Start difference. First operand 15241 states and 22792 transitions. Second operand 3 states. [2019-09-08 11:06:04,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:04,833 INFO L93 Difference]: Finished difference Result 37119 states and 55500 transitions. [2019-09-08 11:06:04,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:04,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-08 11:06:04,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:04,886 INFO L225 Difference]: With dead ends: 37119 [2019-09-08 11:06:04,886 INFO L226 Difference]: Without dead ends: 21917 [2019-09-08 11:06:04,917 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-08 11:06:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21917 states. [2019-09-08 11:06:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21917 to 21915. [2019-09-08 11:06:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21915 states. [2019-09-08 11:06:06,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21915 states to 21915 states and 32602 transitions. [2019-09-08 11:06:06,596 INFO L78 Accepts]: Start accepts. Automaton has 21915 states and 32602 transitions. Word has length 72 [2019-09-08 11:06:06,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:06,596 INFO L475 AbstractCegarLoop]: Abstraction has 21915 states and 32602 transitions. [2019-09-08 11:06:06,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:06:06,597 INFO L276 IsEmpty]: Start isEmpty. Operand 21915 states and 32602 transitions. [2019-09-08 11:06:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 11:06:06,609 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:06,610 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:06,610 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:06,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:06,610 INFO L82 PathProgramCache]: Analyzing trace with hash 2077189795, now seen corresponding path program 1 times [2019-09-08 11:06:06,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:06,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:06,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:06,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:06,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:06,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:06:06,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:06:06,719 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) [2019-09-08 11:06:06,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:06:06,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:06,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 11:06:06,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:06:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:06:06,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:06:06,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 5 [2019-09-08 11:06:06,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:06:06,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:06:06,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:06:06,963 INFO L87 Difference]: Start difference. First operand 21915 states and 32602 transitions. Second operand 5 states. [2019-09-08 11:06:09,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:09,753 INFO L93 Difference]: Finished difference Result 54457 states and 81284 transitions. [2019-09-08 11:06:09,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:06:09,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 11:06:09,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:09,848 INFO L225 Difference]: With dead ends: 54457 [2019-09-08 11:06:09,848 INFO L226 Difference]: Without dead ends: 39255 [2019-09-08 11:06:09,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:06:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39255 states. [2019-09-08 11:06:11,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39255 to 36411. [2019-09-08 11:06:11,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36411 states. [2019-09-08 11:06:11,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36411 states to 36411 states and 53946 transitions. [2019-09-08 11:06:11,905 INFO L78 Accepts]: Start accepts. Automaton has 36411 states and 53946 transitions. Word has length 97 [2019-09-08 11:06:11,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:11,906 INFO L475 AbstractCegarLoop]: Abstraction has 36411 states and 53946 transitions. [2019-09-08 11:06:11,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:06:11,906 INFO L276 IsEmpty]: Start isEmpty. Operand 36411 states and 53946 transitions. [2019-09-08 11:06:11,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:06:11,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:11,919 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:11,920 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:11,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:11,920 INFO L82 PathProgramCache]: Analyzing trace with hash 441654667, now seen corresponding path program 1 times [2019-09-08 11:06:11,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:11,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:11,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:11,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:11,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:11,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:11,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:06:11,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:06:11,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:06:11,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:11,990 INFO L87 Difference]: Start difference. First operand 36411 states and 53946 transitions. Second operand 3 states. [2019-09-08 11:06:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:15,939 INFO L93 Difference]: Finished difference Result 95039 states and 140796 transitions. [2019-09-08 11:06:15,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:15,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 11:06:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:16,049 INFO L225 Difference]: With dead ends: 95039 [2019-09-08 11:06:16,050 INFO L226 Difference]: Without dead ends: 64701 [2019-09-08 11:06:16,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:16,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64701 states. [2019-09-08 11:06:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64701 to 64699. [2019-09-08 11:06:19,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64699 states. [2019-09-08 11:06:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64699 states to 64699 states and 95066 transitions. [2019-09-08 11:06:19,251 INFO L78 Accepts]: Start accepts. Automaton has 64699 states and 95066 transitions. Word has length 98 [2019-09-08 11:06:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:19,251 INFO L475 AbstractCegarLoop]: Abstraction has 64699 states and 95066 transitions. [2019-09-08 11:06:19,251 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:06:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 64699 states and 95066 transitions. [2019-09-08 11:06:19,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:06:19,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:19,271 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:19,272 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:19,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1758273834, now seen corresponding path program 1 times [2019-09-08 11:06:19,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:19,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:19,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:19,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:19,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:19,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:19,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:06:19,341 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:06:19,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:06:19,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:19,342 INFO L87 Difference]: Start difference. First operand 64699 states and 95066 transitions. Second operand 3 states. [2019-09-08 11:06:23,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:23,819 INFO L93 Difference]: Finished difference Result 118569 states and 174267 transitions. [2019-09-08 11:06:23,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:23,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 11:06:23,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:24,004 INFO L225 Difference]: With dead ends: 118569 [2019-09-08 11:06:24,004 INFO L226 Difference]: Without dead ends: 87335 [2019-09-08 11:06:24,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87335 states. [2019-09-08 11:06:27,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87335 to 81285. [2019-09-08 11:06:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81285 states. [2019-09-08 11:06:27,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81285 states to 81285 states and 118201 transitions. [2019-09-08 11:06:27,833 INFO L78 Accepts]: Start accepts. Automaton has 81285 states and 118201 transitions. Word has length 98 [2019-09-08 11:06:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:27,833 INFO L475 AbstractCegarLoop]: Abstraction has 81285 states and 118201 transitions. [2019-09-08 11:06:27,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:06:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 81285 states and 118201 transitions. [2019-09-08 11:06:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:06:27,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:27,855 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:27,856 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:27,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:27,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1271438003, now seen corresponding path program 1 times [2019-09-08 11:06:27,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:27,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:27,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:27,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:27,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:27,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:27,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:06:27,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:06:27,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:06:27,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:27,925 INFO L87 Difference]: Start difference. First operand 81285 states and 118201 transitions. Second operand 3 states. [2019-09-08 11:06:33,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:33,781 INFO L93 Difference]: Finished difference Result 123023 states and 178391 transitions. [2019-09-08 11:06:33,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:33,781 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 11:06:33,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:33,915 INFO L225 Difference]: With dead ends: 123023 [2019-09-08 11:06:33,916 INFO L226 Difference]: Without dead ends: 85297 [2019-09-08 11:06:33,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85297 states. [2019-09-08 11:06:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85297 to 82175. [2019-09-08 11:06:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82175 states. [2019-09-08 11:06:37,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82175 states to 82175 states and 117613 transitions. [2019-09-08 11:06:37,769 INFO L78 Accepts]: Start accepts. Automaton has 82175 states and 117613 transitions. Word has length 98 [2019-09-08 11:06:37,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:37,769 INFO L475 AbstractCegarLoop]: Abstraction has 82175 states and 117613 transitions. [2019-09-08 11:06:37,769 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:06:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 82175 states and 117613 transitions. [2019-09-08 11:06:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:06:37,782 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:37,783 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:37,783 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:37,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:37,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1058242613, now seen corresponding path program 1 times [2019-09-08 11:06:37,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:37,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:37,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:37,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:37,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:37,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:37,856 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:37,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:37,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:06:37,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:06:37,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:06:37,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:37,858 INFO L87 Difference]: Start difference. First operand 82175 states and 117613 transitions. Second operand 3 states. [2019-09-08 11:06:44,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:06:44,830 INFO L93 Difference]: Finished difference Result 192958 states and 276236 transitions. [2019-09-08 11:06:44,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:06:44,830 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 11:06:44,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:06:44,994 INFO L225 Difference]: With dead ends: 192958 [2019-09-08 11:06:44,995 INFO L226 Difference]: Without dead ends: 128908 [2019-09-08 11:06:45,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:06:45,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128908 states. [2019-09-08 11:06:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128908 to 127037. [2019-09-08 11:06:53,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127037 states. [2019-09-08 11:06:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127037 states to 127037 states and 179873 transitions. [2019-09-08 11:06:53,212 INFO L78 Accepts]: Start accepts. Automaton has 127037 states and 179873 transitions. Word has length 98 [2019-09-08 11:06:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:53,212 INFO L475 AbstractCegarLoop]: Abstraction has 127037 states and 179873 transitions. [2019-09-08 11:06:53,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:06:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 127037 states and 179873 transitions. [2019-09-08 11:06:53,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:06:53,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:53,231 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:53,231 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:53,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:53,232 INFO L82 PathProgramCache]: Analyzing trace with hash -164057962, now seen corresponding path program 1 times [2019-09-08 11:06:53,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:53,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:53,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:53,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:53,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:53,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:06:53,331 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:06:53,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:53,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:06:53,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:06:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:53,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:06:53,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:06:53,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:06:53,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:06:53,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:06:53,644 INFO L87 Difference]: Start difference. First operand 127037 states and 179873 transitions. Second operand 11 states. [2019-09-08 11:07:09,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:09,417 INFO L93 Difference]: Finished difference Result 325142 states and 458857 transitions. [2019-09-08 11:07:09,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:07:09,418 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-08 11:07:09,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:09,712 INFO L225 Difference]: With dead ends: 325142 [2019-09-08 11:07:09,712 INFO L226 Difference]: Without dead ends: 228061 [2019-09-08 11:07:09,794 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:07:09,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228061 states. [2019-09-08 11:07:18,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228061 to 134758. [2019-09-08 11:07:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134758 states. [2019-09-08 11:07:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134758 states to 134758 states and 191174 transitions. [2019-09-08 11:07:18,338 INFO L78 Accepts]: Start accepts. Automaton has 134758 states and 191174 transitions. Word has length 98 [2019-09-08 11:07:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:18,338 INFO L475 AbstractCegarLoop]: Abstraction has 134758 states and 191174 transitions. [2019-09-08 11:07:18,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:07:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 134758 states and 191174 transitions. [2019-09-08 11:07:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:07:18,358 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:18,358 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:07:18,358 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:18,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:18,358 INFO L82 PathProgramCache]: Analyzing trace with hash 200412244, now seen corresponding path program 1 times [2019-09-08 11:07:18,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:18,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:18,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:18,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:18,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 11:07:18,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:18,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:07:18,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:07:18,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:07:18,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:07:18,437 INFO L87 Difference]: Start difference. First operand 134758 states and 191174 transitions. Second operand 5 states. [2019-09-08 11:07:33,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:33,537 INFO L93 Difference]: Finished difference Result 342585 states and 484933 transitions. [2019-09-08 11:07:33,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:07:33,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 11:07:33,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:33,819 INFO L225 Difference]: With dead ends: 342585 [2019-09-08 11:07:33,820 INFO L226 Difference]: Without dead ends: 207931 [2019-09-08 11:07:34,190 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:07:34,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207931 states. [2019-09-08 11:07:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207931 to 207073. [2019-09-08 11:07:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207073 states. [2019-09-08 11:07:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207073 states to 207073 states and 291599 transitions. [2019-09-08 11:07:51,858 INFO L78 Accepts]: Start accepts. Automaton has 207073 states and 291599 transitions. Word has length 98 [2019-09-08 11:07:51,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:51,858 INFO L475 AbstractCegarLoop]: Abstraction has 207073 states and 291599 transitions. [2019-09-08 11:07:51,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:07:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 207073 states and 291599 transitions. [2019-09-08 11:07:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:07:51,874 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:51,874 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:07:51,874 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:51,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1224846863, now seen corresponding path program 1 times [2019-09-08 11:07:51,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:51,875 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:51,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:51,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:51,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:51,972 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:07:51,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:07:51,973 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-08 11:07:51,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:07:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:52,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:07:52,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:07:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Stream closed [2019-09-08 11:07:52,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:07:52,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:07:52,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:07:52,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:07:52,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:07:52,266 INFO L87 Difference]: Start difference. First operand 207073 states and 291599 transitions. Second operand 11 states. [2019-09-08 11:08:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:08:31,077 INFO L93 Difference]: Finished difference Result 662219 states and 934593 transitions. [2019-09-08 11:08:31,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:08:31,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-08 11:08:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:08:31,828 INFO L225 Difference]: With dead ends: 662219 [2019-09-08 11:08:31,828 INFO L226 Difference]: Without dead ends: 507743 [2019-09-08 11:08:32,009 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:08:32,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507743 states. [2019-09-08 11:08:57,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507743 to 232155. [2019-09-08 11:08:57,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232155 states. [2019-09-08 11:08:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232155 states to 232155 states and 327433 transitions. [2019-09-08 11:08:57,509 INFO L78 Accepts]: Start accepts. Automaton has 232155 states and 327433 transitions. Word has length 98 [2019-09-08 11:08:57,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:57,510 INFO L475 AbstractCegarLoop]: Abstraction has 232155 states and 327433 transitions. [2019-09-08 11:08:57,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:08:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 232155 states and 327433 transitions. [2019-09-08 11:08:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:08:57,527 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:57,527 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:08:57,528 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:57,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:57,528 INFO L82 PathProgramCache]: Analyzing trace with hash 157869061, now seen corresponding path program 1 times [2019-09-08 11:08:57,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:57,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:57,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:57,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:57,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:57,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:57,606 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 11:08:57,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:57,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:08:57,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:08:57,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:08:57,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:08:57,607 INFO L87 Difference]: Start difference. First operand 232155 states and 327433 transitions. Second operand 5 states. [2019-09-08 11:09:29,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:29,322 INFO L93 Difference]: Finished difference Result 592238 states and 833539 transitions. [2019-09-08 11:09:29,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:09:29,322 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 11:09:29,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:29,829 INFO L225 Difference]: With dead ends: 592238 [2019-09-08 11:09:29,830 INFO L226 Difference]: Without dead ends: 360280 [2019-09-08 11:09:29,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:09:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360280 states. [2019-09-08 11:10:04,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360280 to 358927. [2019-09-08 11:10:04,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358927 states. [2019-09-08 11:10:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358927 states to 358927 states and 502626 transitions. [2019-09-08 11:10:05,444 INFO L78 Accepts]: Start accepts. Automaton has 358927 states and 502626 transitions. Word has length 98 [2019-09-08 11:10:05,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:05,444 INFO L475 AbstractCegarLoop]: Abstraction has 358927 states and 502626 transitions. [2019-09-08 11:10:05,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:10:05,445 INFO L276 IsEmpty]: Start isEmpty. Operand 358927 states and 502626 transitions. [2019-09-08 11:10:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:10:05,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:05,469 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:10:05,469 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:05,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:05,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1145297258, now seen corresponding path program 1 times [2019-09-08 11:10:05,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:05,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:05,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:05,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:05,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:05,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:10:05,563 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 11:10:05,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:05,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:05,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:10:05,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:10:05,791 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:05,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:10:05,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:10:05,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:10:05,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:10:05,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:10:05,799 INFO L87 Difference]: Start difference. First operand 358927 states and 502626 transitions. Second operand 11 states. [2019-09-08 11:11:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:11,257 INFO L93 Difference]: Finished difference Result 852685 states and 1187737 transitions. [2019-09-08 11:11:11,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:11:11,258 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-08 11:11:11,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:12,256 INFO L225 Difference]: With dead ends: 852685 [2019-09-08 11:11:12,257 INFO L226 Difference]: Without dead ends: 646176 [2019-09-08 11:11:12,482 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:11:12,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646176 states. [2019-09-08 11:11:59,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646176 to 376559. [2019-09-08 11:11:59,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376559 states. [2019-09-08 11:11:59,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376559 states to 376559 states and 527032 transitions. [2019-09-08 11:11:59,843 INFO L78 Accepts]: Start accepts. Automaton has 376559 states and 527032 transitions. Word has length 98 [2019-09-08 11:11:59,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:59,843 INFO L475 AbstractCegarLoop]: Abstraction has 376559 states and 527032 transitions. [2019-09-08 11:11:59,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:11:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 376559 states and 527032 transitions. [2019-09-08 11:11:59,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 11:11:59,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:59,871 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:11:59,871 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:59,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:59,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1831088311, now seen corresponding path program 1 times [2019-09-08 11:11:59,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:59,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:59,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:59,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:59,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:11:59,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:11:59,961 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-08 11:11:59,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:12:00,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:12:00,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:12:00,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:12:00,146 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream Closed [2019-09-08 11:12:00,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:12:00,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:12:00,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:12:00,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:12:00,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:12:00,160 INFO L87 Difference]: Start difference. First operand 376559 states and 527032 transitions. Second operand 11 states. [2019-09-08 11:13:24,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:13:24,262 INFO L93 Difference]: Finished difference Result 903738 states and 1255982 transitions. [2019-09-08 11:13:24,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:13:24,262 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2019-09-08 11:13:24,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:13:25,412 INFO L225 Difference]: With dead ends: 903738 [2019-09-08 11:13:25,412 INFO L226 Difference]: Without dead ends: 740068 [2019-09-08 11:13:25,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:13:26,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740068 states. [2019-09-08 11:14:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740068 to 404661. [2019-09-08 11:14:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404661 states. [2019-09-08 11:14:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404661 states to 404661 states and 565157 transitions. [2019-09-08 11:14:17,596 INFO L78 Accepts]: Start accepts. Automaton has 404661 states and 565157 transitions. Word has length 98 [2019-09-08 11:14:17,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:14:17,596 INFO L475 AbstractCegarLoop]: Abstraction has 404661 states and 565157 transitions. [2019-09-08 11:14:17,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:14:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 404661 states and 565157 transitions. [2019-09-08 11:14:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:14:17,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:14:17,623 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:14:17,623 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:14:17,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:14:17,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1345133303, now seen corresponding path program 1 times [2019-09-08 11:14:17,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:14:17,624 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:14:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:17,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:14:17,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:14:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:14:17,695 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 11:14:17,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:14:17,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:14:17,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:14:17,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:14:17,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:14:17,697 INFO L87 Difference]: Start difference. First operand 404661 states and 565157 transitions. Second operand 5 states. [2019-09-08 11:15:21,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:21,701 INFO L93 Difference]: Finished difference Result 947800 states and 1317965 transitions. [2019-09-08 11:15:21,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:15:21,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-09-08 11:15:21,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:22,551 INFO L225 Difference]: With dead ends: 947800 [2019-09-08 11:15:22,552 INFO L226 Difference]: Without dead ends: 543321 [2019-09-08 11:15:22,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:15:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543321 states. [2019-09-08 11:16:18,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543321 to 404661. [2019-09-08 11:16:18,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404661 states. [2019-09-08 11:16:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404661 states to 404661 states and 561798 transitions. [2019-09-08 11:16:18,632 INFO L78 Accepts]: Start accepts. Automaton has 404661 states and 561798 transitions. Word has length 99 [2019-09-08 11:16:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:18,632 INFO L475 AbstractCegarLoop]: Abstraction has 404661 states and 561798 transitions. [2019-09-08 11:16:18,633 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:16:18,633 INFO L276 IsEmpty]: Start isEmpty. Operand 404661 states and 561798 transitions. [2019-09-08 11:16:18,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 11:16:18,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:18,659 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:16:18,659 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:18,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:18,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1576406770, now seen corresponding path program 1 times [2019-09-08 11:16:18,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:18,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:18,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:18,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:18,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:18,743 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:16:18,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:16:18,744 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:16:18,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:18,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:16:18,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:16:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:16:18,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:16:18,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:16:18,930 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:16:18,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:16:18,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:16:18,931 INFO L87 Difference]: Start difference. First operand 404661 states and 561798 transitions. Second operand 11 states.