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.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:28:49,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:28:49,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:28:49,344 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:28:49,345 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:28:49,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:28:49,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:28:49,349 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:28:49,351 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:28:49,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:28:49,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:28:49,354 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:28:49,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:28:49,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:28:49,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:28:49,357 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:28:49,357 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:28:49,358 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:28:49,360 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:28:49,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:28:49,364 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:28:49,365 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:28:49,366 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:28:49,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:28:49,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:28:49,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:28:49,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:28:49,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:28:49,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:28:49,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:28:49,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:28:49,372 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:28:49,373 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:28:49,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:28:49,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:28:49,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:28:49,375 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:28:49,375 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:28:49,376 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:28:49,377 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:28:49,377 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:28:49,378 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 12:28:49,392 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:28:49,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:28:49,394 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:28:49,394 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:28:49,394 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:28:49,394 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:28:49,395 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:28:49,395 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:28:49,395 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:28:49,395 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:28:49,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:28:49,396 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:28:49,396 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:28:49,396 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:28:49,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:28:49,396 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:28:49,397 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:28:49,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:28:49,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:28:49,397 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:28:49,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:28:49,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:28:49,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:28:49,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:28:49,398 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:28:49,398 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:28:49,399 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:28:49,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:28:49,399 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:28:49,427 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:28:49,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:28:49,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:28:49,444 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:28:49,445 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:28:49,445 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:28:49,503 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b80bd134/34142e062e4f4711b5ed0465138423e6/FLAG47d968bd0 [2019-09-08 12:28:49,983 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:28:49,984 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:28:49,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b80bd134/34142e062e4f4711b5ed0465138423e6/FLAG47d968bd0 [2019-09-08 12:28:50,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b80bd134/34142e062e4f4711b5ed0465138423e6 [2019-09-08 12:28:50,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:28:50,316 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:28:50,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:28:50,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:28:50,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:28:50,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:28:50" (1/1) ... [2019-09-08 12:28:50,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@336d481c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:50, skipping insertion in model container [2019-09-08 12:28:50,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:28:50" (1/1) ... [2019-09-08 12:28:50,332 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:28:50,393 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:28:50,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:28:50,722 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:28:50,897 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:28:50,923 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:28:50,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:50 WrapperNode [2019-09-08 12:28:50,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:28:50,925 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:28:50,925 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:28:50,925 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:28:50,941 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:50" (1/1) ... [2019-09-08 12:28:50,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:50" (1/1) ... [2019-09-08 12:28:50,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:50" (1/1) ... [2019-09-08 12:28:50,954 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:50" (1/1) ... [2019-09-08 12:28:50,968 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:50" (1/1) ... [2019-09-08 12:28:50,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:50" (1/1) ... [2019-09-08 12:28:50,982 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:50" (1/1) ... [2019-09-08 12:28:50,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:28:50,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:28:50,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:28:50,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:28:50,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:50" (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 12:28:51,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:28:51,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:28:51,052 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:28:51,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:28:51,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:28:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:28:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:28:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:28:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:28:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:28:51,053 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:28:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:28:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:28:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:28:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:28:51,054 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:28:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:28:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:28:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:28:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:28:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:28:51,055 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:28:51,823 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:28:51,824 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:28:51,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:28:51 BoogieIcfgContainer [2019-09-08 12:28:51,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:28:51,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:28:51,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:28:51,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:28:51,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:28:50" (1/3) ... [2019-09-08 12:28:51,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0d9575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:28:51, skipping insertion in model container [2019-09-08 12:28:51,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:50" (2/3) ... [2019-09-08 12:28:51,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0d9575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:28:51, skipping insertion in model container [2019-09-08 12:28:51,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:28:51" (3/3) ... [2019-09-08 12:28:51,838 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 12:28:51,849 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:28:51,870 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:28:51,887 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:28:51,918 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:28:51,918 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:28:51,919 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:28:51,919 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:28:51,919 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:28:51,919 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:28:51,919 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:28:51,919 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:28:51,920 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:28:51,938 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-09-08 12:28:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 12:28:51,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:51,949 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, 1, 1, 1, 1] [2019-09-08 12:28:51,950 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:51,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:51,955 INFO L82 PathProgramCache]: Analyzing trace with hash 690229661, now seen corresponding path program 1 times [2019-09-08 12:28:51,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:51,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:52,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:52,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:52,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:52,430 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 12:28:52,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:52,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:52,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:52,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:52,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:52,456 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2019-09-08 12:28:52,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:52,554 INFO L93 Difference]: Finished difference Result 267 states and 429 transitions. [2019-09-08 12:28:52,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:52,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 12:28:52,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:52,577 INFO L225 Difference]: With dead ends: 267 [2019-09-08 12:28:52,577 INFO L226 Difference]: Without dead ends: 183 [2019-09-08 12:28:52,581 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 12:28:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-08 12:28:52,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2019-09-08 12:28:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-09-08 12:28:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 260 transitions. [2019-09-08 12:28:52,647 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 260 transitions. Word has length 77 [2019-09-08 12:28:52,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:52,648 INFO L475 AbstractCegarLoop]: Abstraction has 181 states and 260 transitions. [2019-09-08 12:28:52,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 260 transitions. [2019-09-08 12:28:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 12:28:52,651 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:52,652 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, 1, 1, 1, 1, 1] [2019-09-08 12:28:52,652 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:52,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:52,653 INFO L82 PathProgramCache]: Analyzing trace with hash -675217057, now seen corresponding path program 1 times [2019-09-08 12:28:52,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:52,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:52,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:52,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:52,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:52,861 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 12:28:52,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:52,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:52,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:52,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:52,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:52,865 INFO L87 Difference]: Start difference. First operand 181 states and 260 transitions. Second operand 3 states. [2019-09-08 12:28:52,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:52,925 INFO L93 Difference]: Finished difference Result 433 states and 660 transitions. [2019-09-08 12:28:52,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:52,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 12:28:52,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:52,929 INFO L225 Difference]: With dead ends: 433 [2019-09-08 12:28:52,929 INFO L226 Difference]: Without dead ends: 299 [2019-09-08 12:28:52,931 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 12:28:52,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-09-08 12:28:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2019-09-08 12:28:52,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-09-08 12:28:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 444 transitions. [2019-09-08 12:28:52,966 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 444 transitions. Word has length 78 [2019-09-08 12:28:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:52,967 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 444 transitions. [2019-09-08 12:28:52,967 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:52,967 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 444 transitions. [2019-09-08 12:28:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 12:28:52,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:52,970 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, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:52,970 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:52,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:52,971 INFO L82 PathProgramCache]: Analyzing trace with hash 435331309, now seen corresponding path program 1 times [2019-09-08 12:28:52,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:52,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:52,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:52,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:52,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:53,082 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 12:28:53,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:53,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:53,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:53,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:53,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:53,083 INFO L87 Difference]: Start difference. First operand 297 states and 444 transitions. Second operand 3 states. [2019-09-08 12:28:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:53,132 INFO L93 Difference]: Finished difference Result 765 states and 1186 transitions. [2019-09-08 12:28:53,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:53,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 12:28:53,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:53,137 INFO L225 Difference]: With dead ends: 765 [2019-09-08 12:28:53,137 INFO L226 Difference]: Without dead ends: 515 [2019-09-08 12:28:53,139 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 12:28:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-09-08 12:28:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 513. [2019-09-08 12:28:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2019-09-08 12:28:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 784 transitions. [2019-09-08 12:28:53,186 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 784 transitions. Word has length 79 [2019-09-08 12:28:53,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:53,187 INFO L475 AbstractCegarLoop]: Abstraction has 513 states and 784 transitions. [2019-09-08 12:28:53,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 784 transitions. [2019-09-08 12:28:53,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 12:28:53,190 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:53,190 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:53,190 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:53,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:53,191 INFO L82 PathProgramCache]: Analyzing trace with hash -903037179, now seen corresponding path program 1 times [2019-09-08 12:28:53,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:53,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:53,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:53,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:53,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:53,298 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 12:28:53,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:53,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:53,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:53,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:53,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:53,302 INFO L87 Difference]: Start difference. First operand 513 states and 784 transitions. Second operand 3 states. [2019-09-08 12:28:53,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:53,368 INFO L93 Difference]: Finished difference Result 1381 states and 2154 transitions. [2019-09-08 12:28:53,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:53,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 12:28:53,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:53,377 INFO L225 Difference]: With dead ends: 1381 [2019-09-08 12:28:53,377 INFO L226 Difference]: Without dead ends: 915 [2019-09-08 12:28:53,384 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 12:28:53,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-09-08 12:28:53,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2019-09-08 12:28:53,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2019-09-08 12:28:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1408 transitions. [2019-09-08 12:28:53,456 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1408 transitions. Word has length 80 [2019-09-08 12:28:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:53,475 INFO L475 AbstractCegarLoop]: Abstraction has 913 states and 1408 transitions. [2019-09-08 12:28:53,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1408 transitions. [2019-09-08 12:28:53,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 12:28:53,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:53,477 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:53,477 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:53,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:53,478 INFO L82 PathProgramCache]: Analyzing trace with hash -441467371, now seen corresponding path program 1 times [2019-09-08 12:28:53,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:53,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:53,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:53,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:53,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:53,559 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 12:28:53,559 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:53,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:53,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:53,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:53,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:53,561 INFO L87 Difference]: Start difference. First operand 913 states and 1408 transitions. Second operand 3 states. [2019-09-08 12:28:53,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:53,647 INFO L93 Difference]: Finished difference Result 2517 states and 3922 transitions. [2019-09-08 12:28:53,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:53,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 12:28:53,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:53,658 INFO L225 Difference]: With dead ends: 2517 [2019-09-08 12:28:53,658 INFO L226 Difference]: Without dead ends: 1651 [2019-09-08 12:28:53,661 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 12:28:53,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-09-08 12:28:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1649. [2019-09-08 12:28:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-09-08 12:28:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2544 transitions. [2019-09-08 12:28:53,745 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2544 transitions. Word has length 81 [2019-09-08 12:28:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:53,747 INFO L475 AbstractCegarLoop]: Abstraction has 1649 states and 2544 transitions. [2019-09-08 12:28:53,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2544 transitions. [2019-09-08 12:28:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:28:53,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:53,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:53,754 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:53,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:53,755 INFO L82 PathProgramCache]: Analyzing trace with hash -22564349, now seen corresponding path program 1 times [2019-09-08 12:28:53,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:53,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:53,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:53,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:53,883 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 12:28:53,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:53,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:53,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:53,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:53,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:53,885 INFO L87 Difference]: Start difference. First operand 1649 states and 2544 transitions. Second operand 5 states. [2019-09-08 12:28:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:54,162 INFO L93 Difference]: Finished difference Result 3251 states and 5041 transitions. [2019-09-08 12:28:54,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:54,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:28:54,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:54,171 INFO L225 Difference]: With dead ends: 3251 [2019-09-08 12:28:54,171 INFO L226 Difference]: Without dead ends: 1649 [2019-09-08 12:28:54,174 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 12:28:54,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-09-08 12:28:54,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2019-09-08 12:28:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-09-08 12:28:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2512 transitions. [2019-09-08 12:28:54,262 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2512 transitions. Word has length 82 [2019-09-08 12:28:54,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:54,263 INFO L475 AbstractCegarLoop]: Abstraction has 1649 states and 2512 transitions. [2019-09-08 12:28:54,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:28:54,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2512 transitions. [2019-09-08 12:28:54,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:28:54,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:54,264 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:54,264 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:54,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:54,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1698766526, now seen corresponding path program 1 times [2019-09-08 12:28:54,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:54,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:54,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:54,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:54,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:54,401 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 12:28:54,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:54,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:54,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:54,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:54,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:54,404 INFO L87 Difference]: Start difference. First operand 1649 states and 2512 transitions. Second operand 5 states. [2019-09-08 12:28:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:54,700 INFO L93 Difference]: Finished difference Result 3251 states and 4977 transitions. [2019-09-08 12:28:54,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:54,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:28:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:54,713 INFO L225 Difference]: With dead ends: 3251 [2019-09-08 12:28:54,713 INFO L226 Difference]: Without dead ends: 1649 [2019-09-08 12:28:54,718 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 12:28:54,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-09-08 12:28:54,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2019-09-08 12:28:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-09-08 12:28:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2496 transitions. [2019-09-08 12:28:54,887 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2496 transitions. Word has length 82 [2019-09-08 12:28:54,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:54,887 INFO L475 AbstractCegarLoop]: Abstraction has 1649 states and 2496 transitions. [2019-09-08 12:28:54,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:28:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2496 transitions. [2019-09-08 12:28:54,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:28:54,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:54,889 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:54,890 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:54,890 INFO L82 PathProgramCache]: Analyzing trace with hash -143264007, now seen corresponding path program 1 times [2019-09-08 12:28:54,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:54,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:54,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:54,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:54,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:55,004 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 12:28:55,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:55,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:55,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:55,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:55,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:55,007 INFO L87 Difference]: Start difference. First operand 1649 states and 2496 transitions. Second operand 5 states. [2019-09-08 12:28:55,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:55,237 INFO L93 Difference]: Finished difference Result 3251 states and 4945 transitions. [2019-09-08 12:28:55,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:55,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-09-08 12:28:55,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:55,246 INFO L225 Difference]: With dead ends: 3251 [2019-09-08 12:28:55,246 INFO L226 Difference]: Without dead ends: 1649 [2019-09-08 12:28:55,250 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 12:28:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2019-09-08 12:28:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2019-09-08 12:28:55,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1649 states. [2019-09-08 12:28:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2480 transitions. [2019-09-08 12:28:55,360 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2480 transitions. Word has length 82 [2019-09-08 12:28:55,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:55,360 INFO L475 AbstractCegarLoop]: Abstraction has 1649 states and 2480 transitions. [2019-09-08 12:28:55,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:28:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2480 transitions. [2019-09-08 12:28:55,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 12:28:55,362 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:55,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:55,362 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:55,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:55,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1607335564, now seen corresponding path program 1 times [2019-09-08 12:28:55,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:55,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:55,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:55,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:55,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:55,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:55,650 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 12:28:55,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:55,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:28:55,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:28:55,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:28:55,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:28:55,654 INFO L87 Difference]: Start difference. First operand 1649 states and 2480 transitions. Second operand 8 states. [2019-09-08 12:28:56,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:56,950 INFO L93 Difference]: Finished difference Result 17669 states and 26810 transitions. [2019-09-08 12:28:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:28:56,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-08 12:28:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:57,038 INFO L225 Difference]: With dead ends: 17669 [2019-09-08 12:28:57,038 INFO L226 Difference]: Without dead ends: 16067 [2019-09-08 12:28:57,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:28:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16067 states. [2019-09-08 12:28:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16067 to 4849. [2019-09-08 12:28:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4849 states. [2019-09-08 12:28:57,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4849 states to 4849 states and 7280 transitions. [2019-09-08 12:28:57,581 INFO L78 Accepts]: Start accepts. Automaton has 4849 states and 7280 transitions. Word has length 82 [2019-09-08 12:28:57,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:57,581 INFO L475 AbstractCegarLoop]: Abstraction has 4849 states and 7280 transitions. [2019-09-08 12:28:57,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:28:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4849 states and 7280 transitions. [2019-09-08 12:28:57,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:28:57,582 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:57,582 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:57,583 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:57,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:57,583 INFO L82 PathProgramCache]: Analyzing trace with hash 645559087, now seen corresponding path program 1 times [2019-09-08 12:28:57,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:57,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:57,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:57,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:57,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:57,670 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 12:28:57,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:57,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:57,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:57,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:57,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:57,671 INFO L87 Difference]: Start difference. First operand 4849 states and 7280 transitions. Second operand 3 states. [2019-09-08 12:28:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:58,558 INFO L93 Difference]: Finished difference Result 13941 states and 20850 transitions. [2019-09-08 12:28:58,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:58,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 12:28:58,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:58,584 INFO L225 Difference]: With dead ends: 13941 [2019-09-08 12:28:58,585 INFO L226 Difference]: Without dead ends: 9139 [2019-09-08 12:28:58,600 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 12:28:58,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9139 states. [2019-09-08 12:28:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9139 to 9041. [2019-09-08 12:28:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9041 states. [2019-09-08 12:28:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9041 states to 9041 states and 13264 transitions. [2019-09-08 12:28:59,363 INFO L78 Accepts]: Start accepts. Automaton has 9041 states and 13264 transitions. Word has length 84 [2019-09-08 12:28:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:59,364 INFO L475 AbstractCegarLoop]: Abstraction has 9041 states and 13264 transitions. [2019-09-08 12:28:59,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 9041 states and 13264 transitions. [2019-09-08 12:28:59,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 12:28:59,365 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:59,365 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:28:59,366 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:59,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 665608430, now seen corresponding path program 1 times [2019-09-08 12:28:59,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:59,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:59,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:59,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:59,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:59,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:59,826 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 12:28:59,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:59,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:28:59,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:28:59,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:28:59,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:28:59,829 INFO L87 Difference]: Start difference. First operand 9041 states and 13264 transitions. Second operand 8 states. [2019-09-08 12:29:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:00,828 INFO L93 Difference]: Finished difference Result 19641 states and 28916 transitions. [2019-09-08 12:29:00,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:29:00,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-09-08 12:29:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:00,853 INFO L225 Difference]: With dead ends: 19641 [2019-09-08 12:29:00,853 INFO L226 Difference]: Without dead ends: 10647 [2019-09-08 12:29:00,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:29:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10647 states. [2019-09-08 12:29:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10647 to 9041. [2019-09-08 12:29:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9041 states. [2019-09-08 12:29:01,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9041 states to 9041 states and 13200 transitions. [2019-09-08 12:29:01,550 INFO L78 Accepts]: Start accepts. Automaton has 9041 states and 13200 transitions. Word has length 84 [2019-09-08 12:29:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:01,551 INFO L475 AbstractCegarLoop]: Abstraction has 9041 states and 13200 transitions. [2019-09-08 12:29:01,551 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:29:01,551 INFO L276 IsEmpty]: Start isEmpty. Operand 9041 states and 13200 transitions. [2019-09-08 12:29:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:29:01,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:01,552 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:01,553 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:01,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:01,553 INFO L82 PathProgramCache]: Analyzing trace with hash 851756344, now seen corresponding path program 1 times [2019-09-08 12:29:01,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:01,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:01,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:01,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:01,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:01,615 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 12:29:01,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:01,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:29:01,616 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:29:01,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:29:01,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:29:01,617 INFO L87 Difference]: Start difference. First operand 9041 states and 13200 transitions. Second operand 3 states. [2019-09-08 12:29:02,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:02,229 INFO L93 Difference]: Finished difference Result 17688 states and 26166 transitions. [2019-09-08 12:29:02,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:29:02,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-09-08 12:29:02,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:02,262 INFO L225 Difference]: With dead ends: 17688 [2019-09-08 12:29:02,262 INFO L226 Difference]: Without dead ends: 12885 [2019-09-08 12:29:02,276 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 12:29:02,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12885 states. [2019-09-08 12:29:03,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12885 to 12883. [2019-09-08 12:29:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12883 states. [2019-09-08 12:29:03,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12883 states to 12883 states and 18866 transitions. [2019-09-08 12:29:03,109 INFO L78 Accepts]: Start accepts. Automaton has 12883 states and 18866 transitions. Word has length 85 [2019-09-08 12:29:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:03,110 INFO L475 AbstractCegarLoop]: Abstraction has 12883 states and 18866 transitions. [2019-09-08 12:29:03,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:29:03,110 INFO L276 IsEmpty]: Start isEmpty. Operand 12883 states and 18866 transitions. [2019-09-08 12:29:03,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 12:29:03,110 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:03,111 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:03,111 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:03,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:03,111 INFO L82 PathProgramCache]: Analyzing trace with hash -842884464, now seen corresponding path program 1 times [2019-09-08 12:29:03,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:03,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:03,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:03,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:03,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:03,217 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 12:29:03,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:03,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:29:03,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:29:03,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:29:03,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:29:03,219 INFO L87 Difference]: Start difference. First operand 12883 states and 18866 transitions. Second operand 5 states. [2019-09-08 12:29:04,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:04,478 INFO L93 Difference]: Finished difference Result 24071 states and 35146 transitions. [2019-09-08 12:29:04,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 12:29:04,479 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 12:29:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:04,531 INFO L225 Difference]: With dead ends: 24071 [2019-09-08 12:29:04,531 INFO L226 Difference]: Without dead ends: 24069 [2019-09-08 12:29:04,541 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 12:29:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24069 states. [2019-09-08 12:29:06,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24069 to 13331. [2019-09-08 12:29:06,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13331 states. [2019-09-08 12:29:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13331 states to 13331 states and 19282 transitions. [2019-09-08 12:29:06,124 INFO L78 Accepts]: Start accepts. Automaton has 13331 states and 19282 transitions. Word has length 85 [2019-09-08 12:29:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:06,124 INFO L475 AbstractCegarLoop]: Abstraction has 13331 states and 19282 transitions. [2019-09-08 12:29:06,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:29:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 13331 states and 19282 transitions. [2019-09-08 12:29:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 12:29:06,131 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:06,132 INFO L399 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:06,132 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:06,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:06,132 INFO L82 PathProgramCache]: Analyzing trace with hash 897657587, now seen corresponding path program 1 times [2019-09-08 12:29:06,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:06,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:06,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:06,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:06,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:06,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:29:06,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:29:06,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:29:06,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:29:06,217 INFO L87 Difference]: Start difference. First operand 13331 states and 19282 transitions. Second operand 3 states. [2019-09-08 12:29:06,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:06,980 INFO L93 Difference]: Finished difference Result 22403 states and 32586 transitions. [2019-09-08 12:29:06,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:29:06,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 12:29:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:06,997 INFO L225 Difference]: With dead ends: 22403 [2019-09-08 12:29:06,997 INFO L226 Difference]: Without dead ends: 9121 [2019-09-08 12:29:07,018 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 12:29:07,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9121 states. [2019-09-08 12:29:07,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9121 to 9119. [2019-09-08 12:29:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9119 states. [2019-09-08 12:29:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9119 states to 9119 states and 13255 transitions. [2019-09-08 12:29:07,636 INFO L78 Accepts]: Start accepts. Automaton has 9119 states and 13255 transitions. Word has length 116 [2019-09-08 12:29:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:07,636 INFO L475 AbstractCegarLoop]: Abstraction has 9119 states and 13255 transitions. [2019-09-08 12:29:07,636 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:29:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 9119 states and 13255 transitions. [2019-09-08 12:29:07,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:29:07,640 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:07,640 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:07,641 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:07,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash 521539718, now seen corresponding path program 1 times [2019-09-08 12:29:07,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:07,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:07,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:07,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:07,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:29:07,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:07,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:29:07,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:29:07,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:29:07,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:29:07,830 INFO L87 Difference]: Start difference. First operand 9119 states and 13255 transitions. Second operand 8 states. [2019-09-08 12:29:10,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:10,539 INFO L93 Difference]: Finished difference Result 48237 states and 70318 transitions. [2019-09-08 12:29:10,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:29:10,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-08 12:29:10,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:10,597 INFO L225 Difference]: With dead ends: 48237 [2019-09-08 12:29:10,597 INFO L226 Difference]: Without dead ends: 45227 [2019-09-08 12:29:10,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:29:10,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45227 states. [2019-09-08 12:29:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45227 to 15135. [2019-09-08 12:29:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15135 states. [2019-09-08 12:29:12,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15135 states to 15135 states and 21895 transitions. [2019-09-08 12:29:12,511 INFO L78 Accepts]: Start accepts. Automaton has 15135 states and 21895 transitions. Word has length 117 [2019-09-08 12:29:12,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:12,511 INFO L475 AbstractCegarLoop]: Abstraction has 15135 states and 21895 transitions. [2019-09-08 12:29:12,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:29:12,511 INFO L276 IsEmpty]: Start isEmpty. Operand 15135 states and 21895 transitions. [2019-09-08 12:29:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:29:12,517 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:12,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:12,518 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:12,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:12,518 INFO L82 PathProgramCache]: Analyzing trace with hash -48478900, now seen corresponding path program 1 times [2019-09-08 12:29:12,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:12,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:12,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:12,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:12,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 12:29:12,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:12,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:29:12,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:29:12,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:29:12,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:29:12,700 INFO L87 Difference]: Start difference. First operand 15135 states and 21895 transitions. Second operand 8 states. [2019-09-08 12:29:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:15,737 INFO L93 Difference]: Finished difference Result 51245 states and 74702 transitions. [2019-09-08 12:29:15,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:29:15,737 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-08 12:29:15,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:15,808 INFO L225 Difference]: With dead ends: 51245 [2019-09-08 12:29:15,808 INFO L226 Difference]: Without dead ends: 48235 [2019-09-08 12:29:15,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:29:15,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48235 states. [2019-09-08 12:29:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48235 to 18143. [2019-09-08 12:29:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18143 states. [2019-09-08 12:29:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18143 states to 18143 states and 26279 transitions. [2019-09-08 12:29:17,325 INFO L78 Accepts]: Start accepts. Automaton has 18143 states and 26279 transitions. Word has length 117 [2019-09-08 12:29:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:17,325 INFO L475 AbstractCegarLoop]: Abstraction has 18143 states and 26279 transitions. [2019-09-08 12:29:17,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:29:17,325 INFO L276 IsEmpty]: Start isEmpty. Operand 18143 states and 26279 transitions. [2019-09-08 12:29:17,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:29:17,330 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:17,331 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:17,331 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:17,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:17,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1639874962, now seen corresponding path program 1 times [2019-09-08 12:29:17,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:17,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:17,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:17,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:17,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:17,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:17,507 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 12:29:17,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:17,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:29:17,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:29:17,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:29:17,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:29:17,509 INFO L87 Difference]: Start difference. First operand 18143 states and 26279 transitions. Second operand 8 states. [2019-09-08 12:29:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:20,303 INFO L93 Difference]: Finished difference Result 48237 states and 69998 transitions. [2019-09-08 12:29:20,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:29:20,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-08 12:29:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:20,345 INFO L225 Difference]: With dead ends: 48237 [2019-09-08 12:29:20,346 INFO L226 Difference]: Without dead ends: 39211 [2019-09-08 12:29:20,363 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:29:20,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39211 states. [2019-09-08 12:29:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39211 to 24159. [2019-09-08 12:29:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24159 states. [2019-09-08 12:29:22,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24159 states to 24159 states and 34919 transitions. [2019-09-08 12:29:22,811 INFO L78 Accepts]: Start accepts. Automaton has 24159 states and 34919 transitions. Word has length 117 [2019-09-08 12:29:22,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:22,812 INFO L475 AbstractCegarLoop]: Abstraction has 24159 states and 34919 transitions. [2019-09-08 12:29:22,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:29:22,812 INFO L276 IsEmpty]: Start isEmpty. Operand 24159 states and 34919 transitions. [2019-09-08 12:29:22,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:29:22,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:22,817 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:22,818 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:22,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:22,818 INFO L82 PathProgramCache]: Analyzing trace with hash -346463388, now seen corresponding path program 1 times [2019-09-08 12:29:22,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:22,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:22,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:22,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:22,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 12:29:22,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:22,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:29:22,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:29:22,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:29:22,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:29:22,992 INFO L87 Difference]: Start difference. First operand 24159 states and 34919 transitions. Second operand 8 states. [2019-09-08 12:29:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:26,307 INFO L93 Difference]: Finished difference Result 54253 states and 78638 transitions. [2019-09-08 12:29:26,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:29:26,307 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-08 12:29:26,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:26,367 INFO L225 Difference]: With dead ends: 54253 [2019-09-08 12:29:26,367 INFO L226 Difference]: Without dead ends: 45227 [2019-09-08 12:29:26,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:29:26,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45227 states. [2019-09-08 12:29:28,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45227 to 30175. [2019-09-08 12:29:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30175 states. [2019-09-08 12:29:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30175 states to 30175 states and 43559 transitions. [2019-09-08 12:29:28,662 INFO L78 Accepts]: Start accepts. Automaton has 30175 states and 43559 transitions. Word has length 117 [2019-09-08 12:29:28,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:28,663 INFO L475 AbstractCegarLoop]: Abstraction has 30175 states and 43559 transitions. [2019-09-08 12:29:28,663 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:29:28,663 INFO L276 IsEmpty]: Start isEmpty. Operand 30175 states and 43559 transitions. [2019-09-08 12:29:28,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:29:28,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:28,668 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:28,668 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:28,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:28,669 INFO L82 PathProgramCache]: Analyzing trace with hash -370208610, now seen corresponding path program 1 times [2019-09-08 12:29:28,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:28,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:28,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:28,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:29:28,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:28,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:29:28,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:29:28,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:29:28,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:29:28,846 INFO L87 Difference]: Start difference. First operand 30175 states and 43559 transitions. Second operand 8 states. [2019-09-08 12:29:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:33,503 INFO L93 Difference]: Finished difference Result 60269 states and 87278 transitions. [2019-09-08 12:29:33,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:29:33,503 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-08 12:29:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:33,556 INFO L225 Difference]: With dead ends: 60269 [2019-09-08 12:29:33,556 INFO L226 Difference]: Without dead ends: 51243 [2019-09-08 12:29:33,570 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:29:33,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51243 states. [2019-09-08 12:29:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51243 to 36191. [2019-09-08 12:29:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36191 states. [2019-09-08 12:29:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36191 states to 36191 states and 52199 transitions. [2019-09-08 12:29:36,266 INFO L78 Accepts]: Start accepts. Automaton has 36191 states and 52199 transitions. Word has length 117 [2019-09-08 12:29:36,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:36,266 INFO L475 AbstractCegarLoop]: Abstraction has 36191 states and 52199 transitions. [2019-09-08 12:29:36,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:29:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 36191 states and 52199 transitions. [2019-09-08 12:29:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 12:29:36,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:36,272 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:36,272 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:36,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:36,272 INFO L82 PathProgramCache]: Analyzing trace with hash -742734504, now seen corresponding path program 1 times [2019-09-08 12:29:36,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:36,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:36,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:36,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:36,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:36,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 12:29:36,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:36,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:29:36,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:29:36,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:29:36,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:29:36,506 INFO L87 Difference]: Start difference. First operand 36191 states and 52199 transitions. Second operand 8 states. [2019-09-08 12:29:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:40,952 INFO L93 Difference]: Finished difference Result 66285 states and 95918 transitions. [2019-09-08 12:29:40,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:29:40,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2019-09-08 12:29:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:41,017 INFO L225 Difference]: With dead ends: 66285 [2019-09-08 12:29:41,017 INFO L226 Difference]: Without dead ends: 57259 [2019-09-08 12:29:41,038 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-09-08 12:29:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57259 states. [2019-09-08 12:29:44,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57259 to 42207. [2019-09-08 12:29:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42207 states. [2019-09-08 12:29:44,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42207 states to 42207 states and 60839 transitions. [2019-09-08 12:29:44,422 INFO L78 Accepts]: Start accepts. Automaton has 42207 states and 60839 transitions. Word has length 117 [2019-09-08 12:29:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:44,423 INFO L475 AbstractCegarLoop]: Abstraction has 42207 states and 60839 transitions. [2019-09-08 12:29:44,423 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:29:44,423 INFO L276 IsEmpty]: Start isEmpty. Operand 42207 states and 60839 transitions. [2019-09-08 12:29:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 12:29:44,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:44,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:44,428 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:44,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:44,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1924244045, now seen corresponding path program 1 times [2019-09-08 12:29:44,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:44,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:44,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:44,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:44,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:29:44,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:29:44,690 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 12:29:44,723 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 12:29:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:44,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 12:29:44,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:29:45,070 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 12:29:45,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:29:45,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2019-09-08 12:29:45,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:29:45,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:29:45,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:29:45,090 INFO L87 Difference]: Start difference. First operand 42207 states and 60839 transitions. Second operand 12 states. [2019-09-08 12:30:20,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:20,950 INFO L93 Difference]: Finished difference Result 366559 states and 521675 transitions. [2019-09-08 12:30:20,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-09-08 12:30:20,950 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2019-09-08 12:30:20,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:21,857 INFO L225 Difference]: With dead ends: 366559 [2019-09-08 12:30:21,857 INFO L226 Difference]: Without dead ends: 324433 [2019-09-08 12:30:22,007 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1354 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=768, Invalid=3264, Unknown=0, NotChecked=0, Total=4032 [2019-09-08 12:30:22,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324433 states. [2019-09-08 12:30:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324433 to 118729. [2019-09-08 12:30:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118729 states. [2019-09-08 12:30:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118729 states to 118729 states and 165575 transitions. [2019-09-08 12:30:38,560 INFO L78 Accepts]: Start accepts. Automaton has 118729 states and 165575 transitions. Word has length 118 [2019-09-08 12:30:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:38,561 INFO L475 AbstractCegarLoop]: Abstraction has 118729 states and 165575 transitions. [2019-09-08 12:30:38,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:30:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 118729 states and 165575 transitions. [2019-09-08 12:30:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:30:38,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:38,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:30:38,569 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:38,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:38,569 INFO L82 PathProgramCache]: Analyzing trace with hash 178915903, now seen corresponding path program 1 times [2019-09-08 12:30:38,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:38,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:38,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:38,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:38,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:38,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:38,825 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:38,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:30:38,826 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 12:30:38,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:39,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 12:30:39,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:30:39,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:30:39,421 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:39,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:30:39,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-08 12:30:39,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:30:39,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:30:39,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:30:39,437 INFO L87 Difference]: Start difference. First operand 118729 states and 165575 transitions. Second operand 17 states. [2019-09-08 12:31:59,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:59,491 INFO L93 Difference]: Finished difference Result 736776 states and 1020111 transitions. [2019-09-08 12:31:59,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 12:31:59,494 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 119 [2019-09-08 12:31:59,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:00,445 INFO L225 Difference]: With dead ends: 736776 [2019-09-08 12:32:00,445 INFO L226 Difference]: Without dead ends: 629914 [2019-09-08 12:32:00,610 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=667, Invalid=1985, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 12:32:01,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629914 states. [2019-09-08 12:32:40,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629914 to 268204. [2019-09-08 12:32:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268204 states. [2019-09-08 12:32:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268204 states to 268204 states and 373463 transitions. [2019-09-08 12:32:40,765 INFO L78 Accepts]: Start accepts. Automaton has 268204 states and 373463 transitions. Word has length 119 [2019-09-08 12:32:40,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:40,766 INFO L475 AbstractCegarLoop]: Abstraction has 268204 states and 373463 transitions. [2019-09-08 12:32:40,766 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:32:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 268204 states and 373463 transitions. [2019-09-08 12:32:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 12:32:40,773 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:40,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:32:40,774 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:40,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash -515339701, now seen corresponding path program 1 times [2019-09-08 12:32:40,774 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:40,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:40,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:40,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:40,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:40,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:40,997 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:40,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 12:32:40,998 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 12:32:41,013 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 12:32:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:41,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-08 12:32:41,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 12:32:41,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 12:32:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:32:41,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 12:32:41,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2019-09-08 12:32:41,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 12:32:41,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 12:32:41,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-09-08 12:32:41,490 INFO L87 Difference]: Start difference. First operand 268204 states and 373463 transitions. Second operand 17 states. [2019-09-08 12:35:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:50,336 INFO L93 Difference]: Finished difference Result 1452792 states and 2014454 transitions. [2019-09-08 12:35:50,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 12:35:50,336 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 119 [2019-09-08 12:35:50,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:52,158 INFO L225 Difference]: With dead ends: 1452792 [2019-09-08 12:35:52,159 INFO L226 Difference]: Without dead ends: 1218590 [2019-09-08 12:35:52,460 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=425, Invalid=1381, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 12:35:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218590 states. [2019-09-08 12:37:44,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218590 to 620226. [2019-09-08 12:37:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620226 states. [2019-09-08 12:37:45,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620226 states to 620226 states and 861345 transitions. [2019-09-08 12:37:45,869 INFO L78 Accepts]: Start accepts. Automaton has 620226 states and 861345 transitions. Word has length 119 [2019-09-08 12:37:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:37:45,870 INFO L475 AbstractCegarLoop]: Abstraction has 620226 states and 861345 transitions. [2019-09-08 12:37:45,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 12:37:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 620226 states and 861345 transitions. [2019-09-08 12:37:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 12:37:45,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:37:45,882 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:37:45,882 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:37:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:37:45,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1117029783, now seen corresponding path program 1 times [2019-09-08 12:37:45,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:37:45,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:37:45,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:45,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:37:45,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:37:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:37:45,933 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 12:37:45,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:37:45,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:37:45,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:37:45,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:37:45,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:37:45,935 INFO L87 Difference]: Start difference. First operand 620226 states and 861345 transitions. Second operand 3 states. [2019-09-08 12:39:15,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:15,205 INFO L93 Difference]: Finished difference Result 1152908 states and 1602722 transitions. [2019-09-08 12:39:15,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:39:15,205 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-09-08 12:39:15,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:16,010 INFO L225 Difference]: With dead ends: 1152908 [2019-09-08 12:39:16,011 INFO L226 Difference]: Without dead ends: 533082 [2019-09-08 12:39:16,366 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 12:39:16,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533082 states.