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/pals_lcr.5.1.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:52:48,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:52:48,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:52:48,365 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:52:48,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:52:48,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:52:48,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:52:48,374 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:52:48,375 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:52:48,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:52:48,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:52:48,386 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:52:48,386 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:52:48,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:52:48,391 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:52:48,392 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:52:48,393 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:52:48,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:52:48,401 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:52:48,403 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:52:48,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:52:48,411 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:52:48,413 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:52:48,416 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:52:48,418 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:52:48,418 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:52:48,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:52:48,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:52:48,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:52:48,422 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:52:48,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:52:48,423 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:52:48,425 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:52:48,425 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:52:48,428 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:52:48,428 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:52:48,429 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:52:48,429 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:52:48,429 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:52:48,430 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:52:48,431 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:52:48,432 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 07:52:48,456 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:52:48,457 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:52:48,459 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:52:48,459 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:52:48,460 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:52:48,460 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:52:48,460 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:52:48,460 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:52:48,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:52:48,461 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:52:48,462 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:52:48,462 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:52:48,462 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:52:48,463 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:52:48,463 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:52:48,463 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:52:48,463 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:52:48,463 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:52:48,464 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:52:48,464 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:52:48,464 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:52:48,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:52:48,464 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:52:48,465 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:52:48,465 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:52:48,465 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:52:48,465 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:52:48,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:52:48,466 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:52:48,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:52:48,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:52:48,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:52:48,529 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:52:48,529 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:52:48,535 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c [2019-09-08 07:52:48,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0895f143b/36dbfef77b5f4f26a7761b350d1a2a8e/FLAGf2c5c8942 [2019-09-08 07:52:49,138 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:52:49,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.5.1.ufo.UNBOUNDED.pals.c [2019-09-08 07:52:49,153 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0895f143b/36dbfef77b5f4f26a7761b350d1a2a8e/FLAGf2c5c8942 [2019-09-08 07:52:49,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0895f143b/36dbfef77b5f4f26a7761b350d1a2a8e [2019-09-08 07:52:49,533 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:52:49,535 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:52:49,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:52:49,536 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:52:49,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:52:49,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:52:49" (1/1) ... [2019-09-08 07:52:49,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9af6bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:52:49, skipping insertion in model container [2019-09-08 07:52:49,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:52:49" (1/1) ... [2019-09-08 07:52:49,549 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:52:49,603 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:52:49,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:52:49,975 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:52:50,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:52:50,056 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:52:50,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:52:50 WrapperNode [2019-09-08 07:52:50,057 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:52:50,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:52:50,058 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:52:50,058 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:52:50,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:52:50" (1/1) ... [2019-09-08 07:52:50,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:52:50" (1/1) ... [2019-09-08 07:52:50,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:52:50" (1/1) ... [2019-09-08 07:52:50,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:52:50" (1/1) ... [2019-09-08 07:52:50,098 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:52:50" (1/1) ... [2019-09-08 07:52:50,110 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:52:50" (1/1) ... [2019-09-08 07:52:50,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:52:50" (1/1) ... [2019-09-08 07:52:50,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:52:50,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:52:50,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:52:50,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:52:50,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:52: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 07:52:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:52:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:52:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:52:50,193 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:52:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:52:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 07:52:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-08 07:52:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:52:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:52:50,194 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:52:50,195 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:52:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:52:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:52:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:52:50,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 07:52:50,196 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:52:50,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:52:50,197 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:52:50,197 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:52:50,197 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:52:50,198 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:52:50,198 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:52:50,198 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 07:52:50,198 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 07:52:50,198 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:52:50,200 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:52:50,200 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:52:50,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:52:50,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:52:50,856 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:52:50,856 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:52:50,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:52:50 BoogieIcfgContainer [2019-09-08 07:52:50,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:52:50,860 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:52:50,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:52:50,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:52:50,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:52:49" (1/3) ... [2019-09-08 07:52:50,866 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2884fe53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:52:50, skipping insertion in model container [2019-09-08 07:52:50,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:52:50" (2/3) ... [2019-09-08 07:52:50,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2884fe53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:52:50, skipping insertion in model container [2019-09-08 07:52:50,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:52:50" (3/3) ... [2019-09-08 07:52:50,871 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.1.ufo.UNBOUNDED.pals.c [2019-09-08 07:52:50,882 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:52:50,891 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:52:50,909 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:52:50,943 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:52:50,944 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:52:50,944 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:52:50,944 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:52:50,945 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:52:50,945 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:52:50,945 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:52:50,945 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:52:50,946 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:52:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2019-09-08 07:52:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 07:52:50,980 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:52:50,981 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] [2019-09-08 07:52:50,983 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:52:50,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:52:50,988 INFO L82 PathProgramCache]: Analyzing trace with hash -2065801778, now seen corresponding path program 1 times [2019-09-08 07:52:50,990 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:52:50,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:52:51,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:52:51,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:52:51,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:52:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:52:51,420 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 07:52:51,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:52:51,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:52:51,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:52:51,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:52:51,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:52:51,445 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 5 states. [2019-09-08 07:52:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:52:51,590 INFO L93 Difference]: Finished difference Result 206 states and 305 transitions. [2019-09-08 07:52:51,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:52:51,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-09-08 07:52:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:52:51,605 INFO L225 Difference]: With dead ends: 206 [2019-09-08 07:52:51,605 INFO L226 Difference]: Without dead ends: 120 [2019-09-08 07:52:51,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 07:52:51,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-09-08 07:52:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-09-08 07:52:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-09-08 07:52:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2019-09-08 07:52:51,667 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 61 [2019-09-08 07:52:51,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:52:51,667 INFO L475 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2019-09-08 07:52:51,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:52:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2019-09-08 07:52:51,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 07:52:51,672 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:52:51,672 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, 1, 1, 1, 1, 1, 1] [2019-09-08 07:52:51,673 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:52:51,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:52:51,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1744678469, now seen corresponding path program 1 times [2019-09-08 07:52:51,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:52:51,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:52:51,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:52:51,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:52:51,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:52:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:52:52,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 07:52:52,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:52:52,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:52:52,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:52:52,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:52:52,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:52:52,086 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand 13 states. [2019-09-08 07:52:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:52:56,455 INFO L93 Difference]: Finished difference Result 1177 states and 1690 transitions. [2019-09-08 07:52:56,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 07:52:56,456 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 91 [2019-09-08 07:52:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:52:56,481 INFO L225 Difference]: With dead ends: 1177 [2019-09-08 07:52:56,481 INFO L226 Difference]: Without dead ends: 1100 [2019-09-08 07:52:56,486 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 07:52:56,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2019-09-08 07:52:56,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 518. [2019-09-08 07:52:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-09-08 07:52:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 722 transitions. [2019-09-08 07:52:56,593 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 722 transitions. Word has length 91 [2019-09-08 07:52:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:52:56,594 INFO L475 AbstractCegarLoop]: Abstraction has 518 states and 722 transitions. [2019-09-08 07:52:56,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:52:56,594 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 722 transitions. [2019-09-08 07:52:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:52:56,599 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:52:56,600 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:52:56,600 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:52:56,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:52:56,600 INFO L82 PathProgramCache]: Analyzing trace with hash 386367637, now seen corresponding path program 1 times [2019-09-08 07:52:56,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:52:56,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:52:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:52:56,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:52:56,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:52:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:52:56,679 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 07:52:56,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:52:56,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 07:52:56,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 07:52:56,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 07:52:56,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 07:52:56,681 INFO L87 Difference]: Start difference. First operand 518 states and 722 transitions. Second operand 3 states. [2019-09-08 07:52:56,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:52:56,754 INFO L93 Difference]: Finished difference Result 1427 states and 2035 transitions. [2019-09-08 07:52:56,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 07:52:56,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-08 07:52:56,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:52:56,761 INFO L225 Difference]: With dead ends: 1427 [2019-09-08 07:52:56,762 INFO L226 Difference]: Without dead ends: 952 [2019-09-08 07:52:56,765 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 07:52:56,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-09-08 07:52:56,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 938. [2019-09-08 07:52:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 938 states. [2019-09-08 07:52:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1316 transitions. [2019-09-08 07:52:56,834 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1316 transitions. Word has length 93 [2019-09-08 07:52:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:52:56,834 INFO L475 AbstractCegarLoop]: Abstraction has 938 states and 1316 transitions. [2019-09-08 07:52:56,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 07:52:56,835 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1316 transitions. [2019-09-08 07:52:56,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:52:56,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:52:56,839 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:52:56,839 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:52:56,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:52:56,840 INFO L82 PathProgramCache]: Analyzing trace with hash -901334819, now seen corresponding path program 1 times [2019-09-08 07:52:56,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:52:56,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:52:56,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:52:56,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:52:56,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:52:56,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:52:56,995 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 07:52:56,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:52:56,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:52:56,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:52:56,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:52:56,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:52:56,999 INFO L87 Difference]: Start difference. First operand 938 states and 1316 transitions. Second operand 5 states. [2019-09-08 07:52:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:52:57,527 INFO L93 Difference]: Finished difference Result 2650 states and 3762 transitions. [2019-09-08 07:52:57,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:52:57,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 07:52:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:52:57,538 INFO L225 Difference]: With dead ends: 2650 [2019-09-08 07:52:57,538 INFO L226 Difference]: Without dead ends: 1755 [2019-09-08 07:52:57,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:52:57,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1755 states. [2019-09-08 07:52:57,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1755 to 1753. [2019-09-08 07:52:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2019-09-08 07:52:57,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 2454 transitions. [2019-09-08 07:52:57,647 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 2454 transitions. Word has length 93 [2019-09-08 07:52:57,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:52:57,648 INFO L475 AbstractCegarLoop]: Abstraction has 1753 states and 2454 transitions. [2019-09-08 07:52:57,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:52:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 2454 transitions. [2019-09-08 07:52:57,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:52:57,650 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:52:57,650 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:52:57,650 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:52:57,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:52:57,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2087989593, now seen corresponding path program 1 times [2019-09-08 07:52:57,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:52:57,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:52:57,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:52:57,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:52:57,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:52:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:52:57,778 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 07:52:57,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:52:57,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:52:57,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:52:57,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:52:57,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:52:57,781 INFO L87 Difference]: Start difference. First operand 1753 states and 2454 transitions. Second operand 5 states. [2019-09-08 07:52:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:52:58,532 INFO L93 Difference]: Finished difference Result 5005 states and 7068 transitions. [2019-09-08 07:52:58,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:52:58,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 07:52:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:52:58,566 INFO L225 Difference]: With dead ends: 5005 [2019-09-08 07:52:58,566 INFO L226 Difference]: Without dead ends: 3295 [2019-09-08 07:52:58,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:52:58,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2019-09-08 07:52:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3293. [2019-09-08 07:52:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2019-09-08 07:52:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 4588 transitions. [2019-09-08 07:52:58,915 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 4588 transitions. Word has length 93 [2019-09-08 07:52:58,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:52:58,916 INFO L475 AbstractCegarLoop]: Abstraction has 3293 states and 4588 transitions. [2019-09-08 07:52:58,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:52:58,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 4588 transitions. [2019-09-08 07:52:58,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:52:58,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:52:58,919 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:52:58,919 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:52:58,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:52:58,920 INFO L82 PathProgramCache]: Analyzing trace with hash -565721125, now seen corresponding path program 1 times [2019-09-08 07:52:58,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:52:58,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:52:58,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:52:58,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:52:58,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:52:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:52:59,075 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 07:52:59,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:52:59,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:52:59,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:52:59,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:52:59,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:52:59,077 INFO L87 Difference]: Start difference. First operand 3293 states and 4588 transitions. Second operand 5 states. [2019-09-08 07:52:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:52:59,847 INFO L93 Difference]: Finished difference Result 9457 states and 13262 transitions. [2019-09-08 07:52:59,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:52:59,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 07:52:59,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:52:59,891 INFO L225 Difference]: With dead ends: 9457 [2019-09-08 07:52:59,891 INFO L226 Difference]: Without dead ends: 6207 [2019-09-08 07:52:59,903 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:52:59,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6207 states. [2019-09-08 07:53:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6207 to 6205. [2019-09-08 07:53:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6205 states. [2019-09-08 07:53:00,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6205 states to 6205 states and 8580 transitions. [2019-09-08 07:53:00,301 INFO L78 Accepts]: Start accepts. Automaton has 6205 states and 8580 transitions. Word has length 93 [2019-09-08 07:53:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:53:00,305 INFO L475 AbstractCegarLoop]: Abstraction has 6205 states and 8580 transitions. [2019-09-08 07:53:00,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:53:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6205 states and 8580 transitions. [2019-09-08 07:53:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:53:00,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:53:00,314 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:53:00,314 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:53:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:53:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2091018021, now seen corresponding path program 1 times [2019-09-08 07:53:00,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:53:00,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:53:00,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:00,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:53:00,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:53:00,460 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 07:53:00,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:53:00,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:53:00,461 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:53:00,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:53:00,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:53:00,462 INFO L87 Difference]: Start difference. First operand 6205 states and 8580 transitions. Second operand 5 states. [2019-09-08 07:53:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:53:01,405 INFO L93 Difference]: Finished difference Result 17857 states and 24822 transitions. [2019-09-08 07:53:01,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:53:01,406 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 07:53:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:53:01,480 INFO L225 Difference]: With dead ends: 17857 [2019-09-08 07:53:01,480 INFO L226 Difference]: Without dead ends: 11695 [2019-09-08 07:53:01,505 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:53:01,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11695 states. [2019-09-08 07:53:02,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11695 to 11693. [2019-09-08 07:53:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11693 states. [2019-09-08 07:53:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11693 states to 11693 states and 16012 transitions. [2019-09-08 07:53:02,348 INFO L78 Accepts]: Start accepts. Automaton has 11693 states and 16012 transitions. Word has length 93 [2019-09-08 07:53:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:53:02,348 INFO L475 AbstractCegarLoop]: Abstraction has 11693 states and 16012 transitions. [2019-09-08 07:53:02,348 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:53:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 11693 states and 16012 transitions. [2019-09-08 07:53:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 07:53:02,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:53:02,350 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:53:02,350 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:53:02,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:53:02,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1008204005, now seen corresponding path program 1 times [2019-09-08 07:53:02,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:53:02,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:53:02,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:02,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:53:02,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:53:02,621 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 07:53:02,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:53:02,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 07:53:02,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 07:53:02,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 07:53:02,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-09-08 07:53:02,623 INFO L87 Difference]: Start difference. First operand 11693 states and 16012 transitions. Second operand 13 states. [2019-09-08 07:53:08,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:53:08,548 INFO L93 Difference]: Finished difference Result 42629 states and 59704 transitions. [2019-09-08 07:53:08,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-09-08 07:53:08,549 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2019-09-08 07:53:08,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:53:08,783 INFO L225 Difference]: With dead ends: 42629 [2019-09-08 07:53:08,783 INFO L226 Difference]: Without dead ends: 30979 [2019-09-08 07:53:08,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=634, Invalid=2122, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 07:53:08,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30979 states. [2019-09-08 07:53:11,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30979 to 26349. [2019-09-08 07:53:11,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26349 states. [2019-09-08 07:53:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26349 states to 26349 states and 36332 transitions. [2019-09-08 07:53:11,767 INFO L78 Accepts]: Start accepts. Automaton has 26349 states and 36332 transitions. Word has length 93 [2019-09-08 07:53:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:53:11,767 INFO L475 AbstractCegarLoop]: Abstraction has 26349 states and 36332 transitions. [2019-09-08 07:53:11,767 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 07:53:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 26349 states and 36332 transitions. [2019-09-08 07:53:11,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 07:53:11,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:53:11,769 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:53:11,769 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:53:11,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:53:11,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1314378554, now seen corresponding path program 1 times [2019-09-08 07:53:11,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:53:11,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:53:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:11,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:53:11,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:53:11,903 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 07:53:11,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:53:11,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:53:11,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:53:11,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:53:11,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:53:11,905 INFO L87 Difference]: Start difference. First operand 26349 states and 36332 transitions. Second operand 5 states. [2019-09-08 07:53:13,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:53:13,955 INFO L93 Difference]: Finished difference Result 64335 states and 89111 transitions. [2019-09-08 07:53:13,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:53:13,955 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-09-08 07:53:13,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:53:14,109 INFO L225 Difference]: With dead ends: 64335 [2019-09-08 07:53:14,110 INFO L226 Difference]: Without dead ends: 38029 [2019-09-08 07:53:14,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:53:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38029 states. [2019-09-08 07:53:17,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38029 to 37241. [2019-09-08 07:53:17,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37241 states. [2019-09-08 07:53:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37241 states to 37241 states and 50876 transitions. [2019-09-08 07:53:17,195 INFO L78 Accepts]: Start accepts. Automaton has 37241 states and 50876 transitions. Word has length 94 [2019-09-08 07:53:17,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:53:17,195 INFO L475 AbstractCegarLoop]: Abstraction has 37241 states and 50876 transitions. [2019-09-08 07:53:17,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:53:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 37241 states and 50876 transitions. [2019-09-08 07:53:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 07:53:17,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:53:17,197 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:53:17,198 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:53:17,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:53:17,198 INFO L82 PathProgramCache]: Analyzing trace with hash 333046407, now seen corresponding path program 1 times [2019-09-08 07:53:17,198 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:53:17,198 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:53:17,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:17,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:53:17,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:53:17,343 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 07:53:17,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:53:17,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:53:17,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:53:17,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:53:17,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:53:17,349 INFO L87 Difference]: Start difference. First operand 37241 states and 50876 transitions. Second operand 11 states. [2019-09-08 07:53:18,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:53:18,693 INFO L93 Difference]: Finished difference Result 41844 states and 59806 transitions. [2019-09-08 07:53:18,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 07:53:18,694 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-09-08 07:53:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:53:18,849 INFO L225 Difference]: With dead ends: 41844 [2019-09-08 07:53:18,849 INFO L226 Difference]: Without dead ends: 41842 [2019-09-08 07:53:18,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-08 07:53:18,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41842 states. [2019-09-08 07:53:20,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41842 to 38825. [2019-09-08 07:53:20,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38825 states. [2019-09-08 07:53:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38825 states to 38825 states and 52460 transitions. [2019-09-08 07:53:20,814 INFO L78 Accepts]: Start accepts. Automaton has 38825 states and 52460 transitions. Word has length 94 [2019-09-08 07:53:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:53:20,814 INFO L475 AbstractCegarLoop]: Abstraction has 38825 states and 52460 transitions. [2019-09-08 07:53:20,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:53:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 38825 states and 52460 transitions. [2019-09-08 07:53:20,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 07:53:20,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:53:20,816 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:53:20,816 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:53:20,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:53:20,817 INFO L82 PathProgramCache]: Analyzing trace with hash -552187502, now seen corresponding path program 1 times [2019-09-08 07:53:20,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:53:20,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:53:20,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:20,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:53:20,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:53:20,943 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 07:53:20,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:53:20,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 07:53:20,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 07:53:20,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 07:53:20,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:53:20,946 INFO L87 Difference]: Start difference. First operand 38825 states and 52460 transitions. Second operand 9 states. [2019-09-08 07:53:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:53:23,802 INFO L93 Difference]: Finished difference Result 74396 states and 101097 transitions. [2019-09-08 07:53:23,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 07:53:23,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-09-08 07:53:23,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:53:23,973 INFO L225 Difference]: With dead ends: 74396 [2019-09-08 07:53:23,973 INFO L226 Difference]: Without dead ends: 46410 [2019-09-08 07:53:24,037 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:53:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46410 states. [2019-09-08 07:53:25,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46410 to 42670. [2019-09-08 07:53:25,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42670 states. [2019-09-08 07:53:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42670 states to 42670 states and 57882 transitions. [2019-09-08 07:53:26,052 INFO L78 Accepts]: Start accepts. Automaton has 42670 states and 57882 transitions. Word has length 95 [2019-09-08 07:53:26,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:53:26,052 INFO L475 AbstractCegarLoop]: Abstraction has 42670 states and 57882 transitions. [2019-09-08 07:53:26,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 07:53:26,053 INFO L276 IsEmpty]: Start isEmpty. Operand 42670 states and 57882 transitions. [2019-09-08 07:53:26,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 07:53:26,054 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:53:26,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 07:53:26,054 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:53:26,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:53:26,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2068419263, now seen corresponding path program 1 times [2019-09-08 07:53:26,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:53:26,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:53:26,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:26,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:53:26,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:53:26,157 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 07:53:26,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:53:26,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:53:26,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:53:26,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:53:26,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:53:26,159 INFO L87 Difference]: Start difference. First operand 42670 states and 57882 transitions. Second operand 5 states. [2019-09-08 07:53:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:53:28,566 INFO L93 Difference]: Finished difference Result 85058 states and 115531 transitions. [2019-09-08 07:53:28,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:53:28,567 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-08 07:53:28,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:53:28,757 INFO L225 Difference]: With dead ends: 85058 [2019-09-08 07:53:28,757 INFO L226 Difference]: Without dead ends: 53262 [2019-09-08 07:53:28,819 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:53:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53262 states. [2019-09-08 07:53:32,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53262 to 53257. [2019-09-08 07:53:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53257 states. [2019-09-08 07:53:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53257 states to 53257 states and 71021 transitions. [2019-09-08 07:53:33,079 INFO L78 Accepts]: Start accepts. Automaton has 53257 states and 71021 transitions. Word has length 96 [2019-09-08 07:53:33,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:53:33,079 INFO L475 AbstractCegarLoop]: Abstraction has 53257 states and 71021 transitions. [2019-09-08 07:53:33,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:53:33,079 INFO L276 IsEmpty]: Start isEmpty. Operand 53257 states and 71021 transitions. [2019-09-08 07:53:33,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 07:53:33,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:53:33,093 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:53:33,093 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:53:33,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:53:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1103762732, now seen corresponding path program 1 times [2019-09-08 07:53:33,094 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:53:33,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:53:33,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:33,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:53:33,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:53:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 07:53:33,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:53:33,178 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 07:53:33,200 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 07:53:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:53:33,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 07:53:33,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:53:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 07:53:33,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:53:33,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [5] total 14 [2019-09-08 07:53:33,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 07:53:33,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 07:53:33,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-09-08 07:53:33,689 INFO L87 Difference]: Start difference. First operand 53257 states and 71021 transitions. Second operand 14 states. [2019-09-08 07:53:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:53:39,360 INFO L93 Difference]: Finished difference Result 91790 states and 122312 transitions. [2019-09-08 07:53:39,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 07:53:39,361 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2019-09-08 07:53:39,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:53:39,515 INFO L225 Difference]: With dead ends: 91790 [2019-09-08 07:53:39,516 INFO L226 Difference]: Without dead ends: 38612 [2019-09-08 07:53:39,703 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 152 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=352, Invalid=980, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 07:53:39,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38612 states. [2019-09-08 07:53:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38612 to 36834. [2019-09-08 07:53:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36834 states. [2019-09-08 07:53:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36834 states to 36834 states and 48260 transitions. [2019-09-08 07:53:43,801 INFO L78 Accepts]: Start accepts. Automaton has 36834 states and 48260 transitions. Word has length 145 [2019-09-08 07:53:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:53:43,802 INFO L475 AbstractCegarLoop]: Abstraction has 36834 states and 48260 transitions. [2019-09-08 07:53:43,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 07:53:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 36834 states and 48260 transitions. [2019-09-08 07:53:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 07:53:43,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:53:43,811 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:53:43,812 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:53:43,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:53:43,812 INFO L82 PathProgramCache]: Analyzing trace with hash -884920315, now seen corresponding path program 1 times [2019-09-08 07:53:43,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:53:43,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:53:43,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:43,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:53:43,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:53:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:53:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 07:53:44,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:53:44,096 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:53:44,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:53:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:53:44,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 07:53:44,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:53:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 07:53:44,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:53:44,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [15] total 25 [2019-09-08 07:53:44,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 07:53:44,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 07:53:44,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:53:44,602 INFO L87 Difference]: Start difference. First operand 36834 states and 48260 transitions. Second operand 25 states. [2019-09-08 07:54:09,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:54:09,609 INFO L93 Difference]: Finished difference Result 180404 states and 240908 transitions. [2019-09-08 07:54:09,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-09-08 07:54:09,610 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 147 [2019-09-08 07:54:09,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:54:10,048 INFO L225 Difference]: With dead ends: 180404 [2019-09-08 07:54:10,048 INFO L226 Difference]: Without dead ends: 149830 [2019-09-08 07:54:10,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 226 SyntacticMatches, 3 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9696 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3235, Invalid=21257, Unknown=0, NotChecked=0, Total=24492 [2019-09-08 07:54:10,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149830 states. [2019-09-08 07:54:20,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149830 to 126604. [2019-09-08 07:54:20,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126604 states. [2019-09-08 07:54:20,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126604 states to 126604 states and 166908 transitions. [2019-09-08 07:54:20,281 INFO L78 Accepts]: Start accepts. Automaton has 126604 states and 166908 transitions. Word has length 147 [2019-09-08 07:54:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:54:20,281 INFO L475 AbstractCegarLoop]: Abstraction has 126604 states and 166908 transitions. [2019-09-08 07:54:20,281 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 07:54:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 126604 states and 166908 transitions. [2019-09-08 07:54:20,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 07:54:20,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:54:20,294 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:54:20,294 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:54:20,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:54:20,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1447000953, now seen corresponding path program 1 times [2019-09-08 07:54:20,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:54:20,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:54:20,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:54:20,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:54:20,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:54:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:54:20,549 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 07:54:20,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:54:20,551 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 07:54:20,576 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 07:54:20,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:54:20,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 07:54:20,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:54:21,026 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 07:54:21,030 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:54:21,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 24 [2019-09-08 07:54:21,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 07:54:21,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 07:54:21,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-09-08 07:54:21,032 INFO L87 Difference]: Start difference. First operand 126604 states and 166908 transitions. Second operand 24 states. [2019-09-08 07:54:45,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:54:45,042 INFO L93 Difference]: Finished difference Result 367686 states and 486174 transitions. [2019-09-08 07:54:45,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-09-08 07:54:45,043 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 147 [2019-09-08 07:54:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:54:45,641 INFO L225 Difference]: With dead ends: 367686 [2019-09-08 07:54:45,641 INFO L226 Difference]: Without dead ends: 284038 [2019-09-08 07:54:45,761 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2605 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1353, Invalid=6657, Unknown=0, NotChecked=0, Total=8010 [2019-09-08 07:54:45,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284038 states. [2019-09-08 07:55:03,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284038 to 278144. [2019-09-08 07:55:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278144 states. [2019-09-08 07:55:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278144 states to 278144 states and 367322 transitions. [2019-09-08 07:55:04,444 INFO L78 Accepts]: Start accepts. Automaton has 278144 states and 367322 transitions. Word has length 147 [2019-09-08 07:55:04,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:55:04,444 INFO L475 AbstractCegarLoop]: Abstraction has 278144 states and 367322 transitions. [2019-09-08 07:55:04,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 07:55:04,445 INFO L276 IsEmpty]: Start isEmpty. Operand 278144 states and 367322 transitions. [2019-09-08 07:55:04,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 07:55:04,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:55:04,458 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:55:04,458 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:55:04,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:55:04,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1543267195, now seen corresponding path program 1 times [2019-09-08 07:55:04,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:55:04,459 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:55:04,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:55:04,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:55:04,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:55:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:55:04,652 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 07:55:04,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:55:04,653 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:55:05,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:55:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:55:05,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 07:55:05,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:55:06,074 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 07:55:06,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:55:06,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 25 [2019-09-08 07:55:06,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 07:55:06,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 07:55:06,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-09-08 07:55:06,091 INFO L87 Difference]: Start difference. First operand 278144 states and 367322 transitions. Second operand 25 states. [2019-09-08 07:55:33,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:55:33,233 INFO L93 Difference]: Finished difference Result 434284 states and 579957 transitions. [2019-09-08 07:55:33,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-09-08 07:55:33,233 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 147 [2019-09-08 07:55:33,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:55:34,013 INFO L225 Difference]: With dead ends: 434284 [2019-09-08 07:55:34,013 INFO L226 Difference]: Without dead ends: 329010 [2019-09-08 07:55:34,170 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3161 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1332, Invalid=7980, Unknown=0, NotChecked=0, Total=9312 [2019-09-08 07:55:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329010 states. [2019-09-08 07:56:01,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329010 to 327342. [2019-09-08 07:56:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327342 states. [2019-09-08 07:56:02,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327342 states to 327342 states and 433672 transitions. [2019-09-08 07:56:02,512 INFO L78 Accepts]: Start accepts. Automaton has 327342 states and 433672 transitions. Word has length 147 [2019-09-08 07:56:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:56:02,512 INFO L475 AbstractCegarLoop]: Abstraction has 327342 states and 433672 transitions. [2019-09-08 07:56:02,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 07:56:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 327342 states and 433672 transitions. [2019-09-08 07:56:02,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 07:56:02,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:56:02,525 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:56:02,525 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:56:02,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:56:02,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1485572615, now seen corresponding path program 1 times [2019-09-08 07:56:02,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:56:02,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:56:02,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:56:02,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:56:02,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:56:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:56:02,749 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 07:56:02,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:56:02,749 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:56:03,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:56:03,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:56:03,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 974 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 07:56:03,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:56:03,954 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 07:56:03,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:56:03,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [14] total 27 [2019-09-08 07:56:03,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 07:56:03,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 07:56:03,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-09-08 07:56:03,960 INFO L87 Difference]: Start difference. First operand 327342 states and 433672 transitions. Second operand 27 states. [2019-09-08 07:56:39,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:56:39,871 INFO L93 Difference]: Finished difference Result 569607 states and 759030 transitions. [2019-09-08 07:56:39,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-09-08 07:56:39,872 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 147 [2019-09-08 07:56:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:56:41,583 INFO L225 Difference]: With dead ends: 569607 [2019-09-08 07:56:41,583 INFO L226 Difference]: Without dead ends: 427096 [2019-09-08 07:56:41,802 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 166 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2679 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1403, Invalid=6787, Unknown=0, NotChecked=0, Total=8190 [2019-09-08 07:56:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427096 states. [2019-09-08 07:57:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427096 to 410766. [2019-09-08 07:57:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410766 states. [2019-09-08 07:57:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410766 states to 410766 states and 545404 transitions. [2019-09-08 07:57:11,898 INFO L78 Accepts]: Start accepts. Automaton has 410766 states and 545404 transitions. Word has length 147 [2019-09-08 07:57:11,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:57:11,899 INFO L475 AbstractCegarLoop]: Abstraction has 410766 states and 545404 transitions. [2019-09-08 07:57:11,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 07:57:11,899 INFO L276 IsEmpty]: Start isEmpty. Operand 410766 states and 545404 transitions. [2019-09-08 07:57:11,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 07:57:11,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:57:11,911 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 07:57:11,912 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:57:11,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:57:11,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1401079354, now seen corresponding path program 1 times [2019-09-08 07:57:11,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:57:11,913 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:57:11,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:57:11,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:57:11,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:57:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:57:12,275 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 07:57:12,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 07:57:12,275 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 07:57:12,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 07:57:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:57:12,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 07:57:12,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 07:57:12,664 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 07:57:12,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 07:57:12,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [21] total 27 [2019-09-08 07:57:12,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 07:57:12,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 07:57:12,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2019-09-08 07:57:12,671 INFO L87 Difference]: Start difference. First operand 410766 states and 545404 transitions. Second operand 27 states. [2019-09-08 07:58:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:58:42,426 INFO L93 Difference]: Finished difference Result 1538504 states and 2029503 transitions. [2019-09-08 07:58:42,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-09-08 07:58:42,427 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 148 [2019-09-08 07:58:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:58:45,544 INFO L225 Difference]: With dead ends: 1538504 [2019-09-08 07:58:45,545 INFO L226 Difference]: Without dead ends: 1127800 [2019-09-08 07:58:46,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4991 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=2822, Invalid=12928, Unknown=0, NotChecked=0, Total=15750 [2019-09-08 07:58:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127800 states. [2019-09-08 08:00:34,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127800 to 1021183. [2019-09-08 08:00:34,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1021183 states. [2019-09-08 08:00:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1021183 states to 1021183 states and 1341991 transitions. [2019-09-08 08:00:38,033 INFO L78 Accepts]: Start accepts. Automaton has 1021183 states and 1341991 transitions. Word has length 148 [2019-09-08 08:00:38,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:00:38,034 INFO L475 AbstractCegarLoop]: Abstraction has 1021183 states and 1341991 transitions. [2019-09-08 08:00:38,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 08:00:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1021183 states and 1341991 transitions. [2019-09-08 08:00:38,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 08:00:38,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:00:38,062 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 08:00:38,062 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:00:38,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:00:38,062 INFO L82 PathProgramCache]: Analyzing trace with hash 76313018, now seen corresponding path program 1 times [2019-09-08 08:00:38,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:00:38,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:00:38,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:38,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:38,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:00:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 08:00:38,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 08:00:38,411 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 08:00:38,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:00:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:00:38,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 08:00:38,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 08:00:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 08:00:38,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 08:00:38,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2019-09-08 08:00:38,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 08:00:38,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 08:00:38,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2019-09-08 08:00:38,780 INFO L87 Difference]: Start difference. First operand 1021183 states and 1341991 transitions. Second operand 26 states. [2019-09-08 08:00:41,001 WARN L188 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-09-08 08:00:51,897 WARN L188 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 34