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.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:01:58,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:01:58,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:01:58,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:01:58,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:01:58,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:01:58,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:01:58,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:01:58,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:01:58,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:01:58,909 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:01:58,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:01:58,910 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:01:58,911 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:01:58,912 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:01:58,913 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:01:58,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:01:58,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:01:58,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:01:58,918 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:01:58,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:01:58,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:01:58,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:01:58,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:01:58,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:01:58,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:01:58,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:01:58,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:01:58,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:01:58,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:01:58,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:01:58,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:01:58,929 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:01:58,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:01:58,931 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:01:58,931 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:01:58,932 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:01:58,932 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:01:58,933 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:01:58,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:01:58,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:01:58,935 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:01:58,949 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:01:58,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:01:58,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:01:58,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:01:58,951 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:01:58,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:01:58,952 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:01:58,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:01:58,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:01:58,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:01:58,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:01:58,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:01:58,953 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:01:58,953 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:01:58,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:01:58,953 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:01:58,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:01:58,954 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:01:58,954 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:01:58,954 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:01:58,954 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:01:58,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:01:58,955 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:01:58,955 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:01:58,955 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:01:58,955 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:01:58,956 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:01:58,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:01:58,956 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:01:58,985 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:01:58,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:01:59,002 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:01:59,004 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:01:59,004 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:01:59,005 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.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:01:59,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00fd438a6/e17b5d98273743df972b29456b19c55b/FLAGd27f93f00 [2019-09-08 11:01:59,588 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:01:59,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:01:59,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00fd438a6/e17b5d98273743df972b29456b19c55b/FLAGd27f93f00 [2019-09-08 11:01:59,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00fd438a6/e17b5d98273743df972b29456b19c55b [2019-09-08 11:01:59,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:01:59,943 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:01:59,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:01:59,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:01:59,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:01:59,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:01:59" (1/1) ... [2019-09-08 11:01:59,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e83ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:01:59, skipping insertion in model container [2019-09-08 11:01:59,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:01:59" (1/1) ... [2019-09-08 11:01:59,961 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:02:00,038 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:02:00,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:02:00,526 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:02:00,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:02:00,636 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:02:00,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:00 WrapperNode [2019-09-08 11:02:00,637 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:02:00,638 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:02:00,638 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:02:00,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:02:00,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:00" (1/1) ... [2019-09-08 11:02:00,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:00" (1/1) ... [2019-09-08 11:02:00,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:00" (1/1) ... [2019-09-08 11:02:00,659 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:00" (1/1) ... [2019-09-08 11:02:00,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:00" (1/1) ... [2019-09-08 11:02:00,681 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:00" (1/1) ... [2019-09-08 11:02:00,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:00" (1/1) ... [2019-09-08 11:02:00,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:02:00,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:02:00,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:02:00,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:02:00,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:00" (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:02:00,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:02:00,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:02:00,762 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:02:00,762 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:02:00,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:02:00,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:02:00,763 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:02:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:02:00,764 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:02:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:02:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:02:00,765 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:02:00,766 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:02:00,766 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:02:00,767 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:02:00,767 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:02:00,769 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:02:00,769 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:02:00,770 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:02:00,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:02:00,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:02:01,546 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:02:01,547 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:02:01,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:02:01 BoogieIcfgContainer [2019-09-08 11:02:01,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:02:01,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:02:01,550 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:02:01,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:02:01,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:01:59" (1/3) ... [2019-09-08 11:02:01,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d16d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:02:01, skipping insertion in model container [2019-09-08 11:02:01,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:02:00" (2/3) ... [2019-09-08 11:02:01,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20d16d9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:02:01, skipping insertion in model container [2019-09-08 11:02:01,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:02:01" (3/3) ... [2019-09-08 11:02:01,560 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:02:01,570 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:02:01,589 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:02:01,605 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:02:01,634 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:02:01,635 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:02:01,635 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:02:01,635 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:02:01,636 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:02:01,637 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:02:01,637 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:02:01,637 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:02:01,637 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:02:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-09-08 11:02:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 11:02:01,677 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:01,678 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:02:01,680 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:01,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:01,685 INFO L82 PathProgramCache]: Analyzing trace with hash -34788824, now seen corresponding path program 1 times [2019-09-08 11:02:01,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:01,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:01,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:01,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:01,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:02,132 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:02:02,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:02,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:02,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:02,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:02,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:02,158 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 3 states. [2019-09-08 11:02:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:02,265 INFO L93 Difference]: Finished difference Result 335 states and 535 transitions. [2019-09-08 11:02:02,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:02,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 11:02:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:02,283 INFO L225 Difference]: With dead ends: 335 [2019-09-08 11:02:02,283 INFO L226 Difference]: Without dead ends: 223 [2019-09-08 11:02:02,288 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:02:02,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-09-08 11:02:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2019-09-08 11:02:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-09-08 11:02:02,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 329 transitions. [2019-09-08 11:02:02,379 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 329 transitions. Word has length 65 [2019-09-08 11:02:02,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:02,380 INFO L475 AbstractCegarLoop]: Abstraction has 221 states and 329 transitions. [2019-09-08 11:02:02,380 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:02,380 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 329 transitions. [2019-09-08 11:02:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-09-08 11:02:02,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:02,383 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:02:02,383 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1987070288, now seen corresponding path program 1 times [2019-09-08 11:02:02,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:02,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:02,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:02,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:02,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:02,494 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:02:02,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:02,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:02,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:02,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:02,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:02,498 INFO L87 Difference]: Start difference. First operand 221 states and 329 transitions. Second operand 3 states. [2019-09-08 11:02:02,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:02,611 INFO L93 Difference]: Finished difference Result 553 states and 857 transitions. [2019-09-08 11:02:02,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:02,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-09-08 11:02:02,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:02,619 INFO L225 Difference]: With dead ends: 553 [2019-09-08 11:02:02,619 INFO L226 Difference]: Without dead ends: 371 [2019-09-08 11:02:02,624 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:02:02,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-09-08 11:02:02,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2019-09-08 11:02:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2019-09-08 11:02:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 564 transitions. [2019-09-08 11:02:02,695 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 564 transitions. Word has length 66 [2019-09-08 11:02:02,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:02,696 INFO L475 AbstractCegarLoop]: Abstraction has 369 states and 564 transitions. [2019-09-08 11:02:02,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:02,696 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 564 transitions. [2019-09-08 11:02:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 11:02:02,699 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:02,699 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:02:02,700 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:02,700 INFO L82 PathProgramCache]: Analyzing trace with hash 612521917, now seen corresponding path program 1 times [2019-09-08 11:02:02,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:02,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:02,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:02,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:02,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:02,802 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:02:02,804 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:02,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:02,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:02,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:02,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:02,806 INFO L87 Difference]: Start difference. First operand 369 states and 564 transitions. Second operand 3 states. [2019-09-08 11:02:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:02,859 INFO L93 Difference]: Finished difference Result 965 states and 1510 transitions. [2019-09-08 11:02:02,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:02,862 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-09-08 11:02:02,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:02,869 INFO L225 Difference]: With dead ends: 965 [2019-09-08 11:02:02,879 INFO L226 Difference]: Without dead ends: 635 [2019-09-08 11:02:02,883 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:02:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-08 11:02:02,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2019-09-08 11:02:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 11:02:02,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 980 transitions. [2019-09-08 11:02:02,938 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 980 transitions. Word has length 67 [2019-09-08 11:02:02,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:02,939 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 980 transitions. [2019-09-08 11:02:02,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:02,939 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 980 transitions. [2019-09-08 11:02:02,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 11:02:02,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:02,941 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:02:02,942 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:02,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:02,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1025177521, now seen corresponding path program 1 times [2019-09-08 11:02:02,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:02,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:02,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:02,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:02,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:03,050 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:02:03,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:03,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:03,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:03,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:03,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:03,053 INFO L87 Difference]: Start difference. First operand 633 states and 980 transitions. Second operand 3 states. [2019-09-08 11:02:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:03,123 INFO L93 Difference]: Finished difference Result 1693 states and 2654 transitions. [2019-09-08 11:02:03,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:03,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 11:02:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:03,131 INFO L225 Difference]: With dead ends: 1693 [2019-09-08 11:02:03,131 INFO L226 Difference]: Without dead ends: 1099 [2019-09-08 11:02:03,133 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:02:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2019-09-08 11:02:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1097. [2019-09-08 11:02:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2019-09-08 11:02:03,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1704 transitions. [2019-09-08 11:02:03,194 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1704 transitions. Word has length 68 [2019-09-08 11:02:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:03,195 INFO L475 AbstractCegarLoop]: Abstraction has 1097 states and 1704 transitions. [2019-09-08 11:02:03,195 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:03,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1704 transitions. [2019-09-08 11:02:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 11:02:03,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:03,197 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] [2019-09-08 11:02:03,197 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:03,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:03,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1063880858, now seen corresponding path program 1 times [2019-09-08 11:02:03,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:03,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:03,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:03,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:03,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:03,449 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:02:03,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:03,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:02:03,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:02:03,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:02:03,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:03,451 INFO L87 Difference]: Start difference. First operand 1097 states and 1704 transitions. Second operand 7 states. [2019-09-08 11:02:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:03,843 INFO L93 Difference]: Finished difference Result 5667 states and 8845 transitions. [2019-09-08 11:02:03,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:02:03,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-09-08 11:02:03,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:03,869 INFO L225 Difference]: With dead ends: 5667 [2019-09-08 11:02:03,869 INFO L226 Difference]: Without dead ends: 4609 [2019-09-08 11:02:03,874 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:02:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4609 states. [2019-09-08 11:02:04,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4609 to 4601. [2019-09-08 11:02:04,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4601 states. [2019-09-08 11:02:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 7160 transitions. [2019-09-08 11:02:04,168 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 7160 transitions. Word has length 69 [2019-09-08 11:02:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:04,168 INFO L475 AbstractCegarLoop]: Abstraction has 4601 states and 7160 transitions. [2019-09-08 11:02:04,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:02:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 7160 transitions. [2019-09-08 11:02:04,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 11:02:04,170 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:04,170 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:02:04,171 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:04,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:04,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1707189843, now seen corresponding path program 1 times [2019-09-08 11:02:04,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:04,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:04,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:04,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:04,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:04,227 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:02:04,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:04,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:04,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:04,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:04,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:04,229 INFO L87 Difference]: Start difference. First operand 4601 states and 7160 transitions. Second operand 3 states. [2019-09-08 11:02:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:04,723 INFO L93 Difference]: Finished difference Result 12365 states and 19210 transitions. [2019-09-08 11:02:04,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:04,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-09-08 11:02:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:04,779 INFO L225 Difference]: With dead ends: 12365 [2019-09-08 11:02:04,779 INFO L226 Difference]: Without dead ends: 7803 [2019-09-08 11:02:04,793 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:02:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7803 states. [2019-09-08 11:02:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7803 to 7801. [2019-09-08 11:02:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7801 states. [2019-09-08 11:02:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7801 states to 7801 states and 12008 transitions. [2019-09-08 11:02:05,319 INFO L78 Accepts]: Start accepts. Automaton has 7801 states and 12008 transitions. Word has length 70 [2019-09-08 11:02:05,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:05,320 INFO L475 AbstractCegarLoop]: Abstraction has 7801 states and 12008 transitions. [2019-09-08 11:02:05,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 7801 states and 12008 transitions. [2019-09-08 11:02:05,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:02:05,321 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:05,322 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:02:05,322 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:05,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:05,322 INFO L82 PathProgramCache]: Analyzing trace with hash -453623555, now seen corresponding path program 1 times [2019-09-08 11:02:05,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:05,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:05,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:05,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:05,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:05,412 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:02:05,412 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:05,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:02:05,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:02:05,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:02:05,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:02:05,414 INFO L87 Difference]: Start difference. First operand 7801 states and 12008 transitions. Second operand 5 states. [2019-09-08 11:02:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:06,743 INFO L93 Difference]: Finished difference Result 23325 states and 35946 transitions. [2019-09-08 11:02:06,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:02:06,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-09-08 11:02:06,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:06,838 INFO L225 Difference]: With dead ends: 23325 [2019-09-08 11:02:06,838 INFO L226 Difference]: Without dead ends: 15563 [2019-09-08 11:02:06,856 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:02:06,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15563 states. [2019-09-08 11:02:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15563 to 15561. [2019-09-08 11:02:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15561 states. [2019-09-08 11:02:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15561 states to 15561 states and 23832 transitions. [2019-09-08 11:02:07,868 INFO L78 Accepts]: Start accepts. Automaton has 15561 states and 23832 transitions. Word has length 71 [2019-09-08 11:02:07,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:07,868 INFO L475 AbstractCegarLoop]: Abstraction has 15561 states and 23832 transitions. [2019-09-08 11:02:07,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:02:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 15561 states and 23832 transitions. [2019-09-08 11:02:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:02:07,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:07,870 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:02:07,871 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:07,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:07,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1163881336, now seen corresponding path program 1 times [2019-09-08 11:02:07,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:07,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:07,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:07,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:07,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:08,069 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:02:08,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:08,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:02:08,071 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:02:08,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:02:08,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:02:08,071 INFO L87 Difference]: Start difference. First operand 15561 states and 23832 transitions. Second operand 7 states. [2019-09-08 11:02:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:11,183 INFO L93 Difference]: Finished difference Result 79573 states and 122046 transitions. [2019-09-08 11:02:11,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 11:02:11,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-09-08 11:02:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:11,370 INFO L225 Difference]: With dead ends: 79573 [2019-09-08 11:02:11,370 INFO L226 Difference]: Without dead ends: 64051 [2019-09-08 11:02:11,422 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:02:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64051 states. [2019-09-08 11:02:13,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64051 to 31081. [2019-09-08 11:02:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31081 states. [2019-09-08 11:02:13,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31081 states to 31081 states and 46984 transitions. [2019-09-08 11:02:13,421 INFO L78 Accepts]: Start accepts. Automaton has 31081 states and 46984 transitions. Word has length 71 [2019-09-08 11:02:13,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:13,422 INFO L475 AbstractCegarLoop]: Abstraction has 31081 states and 46984 transitions. [2019-09-08 11:02:13,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:02:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 31081 states and 46984 transitions. [2019-09-08 11:02:13,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:02:13,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:13,423 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:02:13,423 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:13,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:13,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1702050330, now seen corresponding path program 1 times [2019-09-08 11:02:13,424 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:13,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:13,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:13,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:13,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:13,532 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:02:13,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:13,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:02:13,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:02:13,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:02:13,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:02:13,534 INFO L87 Difference]: Start difference. First operand 31081 states and 46984 transitions. Second operand 5 states. [2019-09-08 11:02:16,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:16,685 INFO L93 Difference]: Finished difference Result 63403 states and 95209 transitions. [2019-09-08 11:02:16,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:02:16,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 11:02:16,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:16,803 INFO L225 Difference]: With dead ends: 63403 [2019-09-08 11:02:16,804 INFO L226 Difference]: Without dead ends: 63401 [2019-09-08 11:02:16,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:02:16,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63401 states. [2019-09-08 11:02:18,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63401 to 32361. [2019-09-08 11:02:18,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32361 states. [2019-09-08 11:02:18,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32361 states to 32361 states and 48264 transitions. [2019-09-08 11:02:18,851 INFO L78 Accepts]: Start accepts. Automaton has 32361 states and 48264 transitions. Word has length 72 [2019-09-08 11:02:18,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:18,851 INFO L475 AbstractCegarLoop]: Abstraction has 32361 states and 48264 transitions. [2019-09-08 11:02:18,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:02:18,852 INFO L276 IsEmpty]: Start isEmpty. Operand 32361 states and 48264 transitions. [2019-09-08 11:02:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:02:18,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:18,853 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, 1] [2019-09-08 11:02:18,853 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:18,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:18,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1233572455, now seen corresponding path program 1 times [2019-09-08 11:02:18,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:18,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:18,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:18,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:18,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:18,915 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:02:18,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:18,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:18,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:18,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:18,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:18,917 INFO L87 Difference]: Start difference. First operand 32361 states and 48264 transitions. Second operand 3 states. [2019-09-08 11:02:21,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:21,611 INFO L93 Difference]: Finished difference Result 72287 states and 107628 transitions. [2019-09-08 11:02:21,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:21,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 11:02:21,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:21,684 INFO L225 Difference]: With dead ends: 72287 [2019-09-08 11:02:21,689 INFO L226 Difference]: Without dead ends: 39965 [2019-09-08 11:02:21,757 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:02:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39965 states. [2019-09-08 11:02:23,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39965 to 39819. [2019-09-08 11:02:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39819 states. [2019-09-08 11:02:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39819 states to 39819 states and 58970 transitions. [2019-09-08 11:02:23,776 INFO L78 Accepts]: Start accepts. Automaton has 39819 states and 58970 transitions. Word has length 73 [2019-09-08 11:02:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:23,776 INFO L475 AbstractCegarLoop]: Abstraction has 39819 states and 58970 transitions. [2019-09-08 11:02:23,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 39819 states and 58970 transitions. [2019-09-08 11:02:23,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:02:23,794 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:23,795 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 1] [2019-09-08 11:02:23,795 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:23,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:23,796 INFO L82 PathProgramCache]: Analyzing trace with hash -959843441, now seen corresponding path program 1 times [2019-09-08 11:02:23,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:23,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:23,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:23,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:23,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:02:23,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:23,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:23,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:23,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:23,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:23,867 INFO L87 Difference]: Start difference. First operand 39819 states and 58970 transitions. Second operand 3 states. [2019-09-08 11:02:28,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:28,202 INFO L93 Difference]: Finished difference Result 102672 states and 152222 transitions. [2019-09-08 11:02:28,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:28,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 11:02:28,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:28,297 INFO L225 Difference]: With dead ends: 102672 [2019-09-08 11:02:28,298 INFO L226 Difference]: Without dead ends: 69262 [2019-09-08 11:02:28,339 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:02:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69262 states. [2019-09-08 11:02:31,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69262 to 69260. [2019-09-08 11:02:31,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69260 states. [2019-09-08 11:02:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69260 states to 69260 states and 101868 transitions. [2019-09-08 11:02:31,759 INFO L78 Accepts]: Start accepts. Automaton has 69260 states and 101868 transitions. Word has length 100 [2019-09-08 11:02:31,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:31,759 INFO L475 AbstractCegarLoop]: Abstraction has 69260 states and 101868 transitions. [2019-09-08 11:02:31,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 69260 states and 101868 transitions. [2019-09-08 11:02:31,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:02:31,786 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:31,786 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, 1, 1, 1] [2019-09-08 11:02:31,786 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:31,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:31,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1995645960, now seen corresponding path program 1 times [2019-09-08 11:02:31,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:31,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:31,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:31,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:31,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:02:32,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:02:32,035 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:02:32,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:32,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:32,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 776 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 11:02:32,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:02:32,335 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:02:32,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:02:32,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2019-09-08 11:02:32,345 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:02:32,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:02:32,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:02:32,346 INFO L87 Difference]: Start difference. First operand 69260 states and 101868 transitions. Second operand 12 states. [2019-09-08 11:03:10,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:10,526 INFO L93 Difference]: Finished difference Result 517028 states and 751564 transitions. [2019-09-08 11:03:10,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-09-08 11:03:10,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 100 [2019-09-08 11:03:10,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:11,516 INFO L225 Difference]: With dead ends: 517028 [2019-09-08 11:03:11,516 INFO L226 Difference]: Without dead ends: 454082 [2019-09-08 11:03:11,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2770 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1359, Invalid=5951, Unknown=0, NotChecked=0, Total=7310 [2019-09-08 11:03:12,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454082 states. [2019-09-08 11:03:31,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454082 to 184868. [2019-09-08 11:03:31,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184868 states. [2019-09-08 11:03:31,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184868 states to 184868 states and 268192 transitions. [2019-09-08 11:03:31,314 INFO L78 Accepts]: Start accepts. Automaton has 184868 states and 268192 transitions. Word has length 100 [2019-09-08 11:03:31,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:31,314 INFO L475 AbstractCegarLoop]: Abstraction has 184868 states and 268192 transitions. [2019-09-08 11:03:31,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:03:31,314 INFO L276 IsEmpty]: Start isEmpty. Operand 184868 states and 268192 transitions. [2019-09-08 11:03:31,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:03:31,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:31,377 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2019-09-08 11:03:31,378 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:31,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:31,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1839484968, now seen corresponding path program 1 times [2019-09-08 11:03:31,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:31,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:31,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:31,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:31,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:31,485 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 11:03:31,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:31,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:03:31,486 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:03:31,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:03:31,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:03:31,487 INFO L87 Difference]: Start difference. First operand 184868 states and 268192 transitions. Second operand 6 states. [2019-09-08 11:04:14,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:14,159 INFO L93 Difference]: Finished difference Result 711458 states and 1029055 transitions. [2019-09-08 11:04:14,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:04:14,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-09-08 11:04:14,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:15,099 INFO L225 Difference]: With dead ends: 711458 [2019-09-08 11:04:15,099 INFO L226 Difference]: Without dead ends: 526632 [2019-09-08 11:04:15,284 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:04:15,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526632 states. [2019-09-08 11:05:04,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526632 to 526628. [2019-09-08 11:05:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526628 states. [2019-09-08 11:05:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526628 states to 526628 states and 757560 transitions. [2019-09-08 11:05:06,050 INFO L78 Accepts]: Start accepts. Automaton has 526628 states and 757560 transitions. Word has length 100 [2019-09-08 11:05:06,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:06,050 INFO L475 AbstractCegarLoop]: Abstraction has 526628 states and 757560 transitions. [2019-09-08 11:05:06,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:05:06,050 INFO L276 IsEmpty]: Start isEmpty. Operand 526628 states and 757560 transitions. [2019-09-08 11:05:06,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:05:06,084 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:06,084 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2019-09-08 11:05:06,085 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:06,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:06,085 INFO L82 PathProgramCache]: Analyzing trace with hash -140781229, now seen corresponding path program 1 times [2019-09-08 11:05:06,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:06,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:06,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:06,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:06,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:06,185 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:05:06,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:05:06,185 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:05:06,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:06,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 775 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:05:06,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:05:06,420 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:05:06,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:05:06,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:05:06,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:05:06,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:05:06,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:05:06,433 INFO L87 Difference]: Start difference. First operand 526628 states and 757560 transitions. Second operand 11 states. [2019-09-08 11:07:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:02,497 INFO L93 Difference]: Finished difference Result 1614989 states and 2325592 transitions. [2019-09-08 11:07:02,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:07:02,497 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2019-09-08 11:07:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:04,527 INFO L225 Difference]: With dead ends: 1614989 [2019-09-08 11:07:04,528 INFO L226 Difference]: Without dead ends: 1152355 [2019-09-08 11:07:04,939 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 97 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:07:05,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152355 states. [2019-09-08 11:08:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152355 to 623052. [2019-09-08 11:08:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623052 states. [2019-09-08 11:08:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623052 states to 623052 states and 894840 transitions. [2019-09-08 11:08:26,603 INFO L78 Accepts]: Start accepts. Automaton has 623052 states and 894840 transitions. Word has length 100 [2019-09-08 11:08:26,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:26,604 INFO L475 AbstractCegarLoop]: Abstraction has 623052 states and 894840 transitions. [2019-09-08 11:08:26,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:08:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 623052 states and 894840 transitions. [2019-09-08 11:08:26,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:08:26,638 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:26,638 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2019-09-08 11:08:26,638 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:26,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:26,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1034965880, now seen corresponding path program 1 times [2019-09-08 11:08:26,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:26,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:26,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:26,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:26,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:26,698 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:08:26,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:26,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:08:26,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:08:26,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:08:26,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:08:26,700 INFO L87 Difference]: Start difference. First operand 623052 states and 894840 transitions. Second operand 3 states. [2019-09-08 11:10:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:03,989 INFO L93 Difference]: Finished difference Result 1415276 states and 2031643 transitions. [2019-09-08 11:10:03,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:10:03,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-08 11:10:03,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:05,802 INFO L225 Difference]: With dead ends: 1415276 [2019-09-08 11:10:05,802 INFO L226 Difference]: Without dead ends: 959226 [2019-09-08 11:10:06,210 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:10:08,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959226 states. [2019-09-08 11:11:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959226 to 916808. [2019-09-08 11:11:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 916808 states. [2019-09-08 11:11:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916808 states to 916808 states and 1305109 transitions. [2019-09-08 11:11:55,761 INFO L78 Accepts]: Start accepts. Automaton has 916808 states and 1305109 transitions. Word has length 100 [2019-09-08 11:11:55,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:55,762 INFO L475 AbstractCegarLoop]: Abstraction has 916808 states and 1305109 transitions. [2019-09-08 11:11:55,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:11:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 916808 states and 1305109 transitions. [2019-09-08 11:11:55,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-08 11:11:55,805 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:55,805 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2019-09-08 11:11:55,805 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:55,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:55,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1781550567, now seen corresponding path program 1 times [2019-09-08 11:11:55,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:55,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:55,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:55,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:11:55,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:55,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:11:55,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:11:55,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:11:55,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:11:55,868 INFO L87 Difference]: Start difference. First operand 916808 states and 1305109 transitions. Second operand 3 states.