java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:23:53,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:23:53,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:23:53,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:23:53,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:23:53,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:23:53,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:23:53,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:23:53,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:23:53,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:23:53,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:23:53,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:23:53,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:23:53,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:23:53,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:23:53,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:23:53,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:23:53,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:23:53,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:23:53,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:23:53,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:23:53,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:23:53,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:23:53,381 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:23:53,383 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:23:53,383 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:23:53,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:23:53,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:23:53,385 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:23:53,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:23:53,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:23:53,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:23:53,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:23:53,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:23:53,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:23:53,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:23:53,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:23:53,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:23:53,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:23:53,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:23:53,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:23:53,393 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 11:23:53,417 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:23:53,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:23:53,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:23:53,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:23:53,419 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:23:53,419 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:23:53,420 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:23:53,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:23:53,420 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:23:53,420 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:23:53,420 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:23:53,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:23:53,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:23:53,421 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:23:53,421 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:23:53,421 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:23:53,421 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:23:53,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:23:53,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:23:53,422 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:23:53,422 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:23:53,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:23:53,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:23:53,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:23:53,423 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:23:53,423 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:23:53,423 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:23:53,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:23:53,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:23:53,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:23:53,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:23:53,488 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:23:53,491 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:23:53,491 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:23:53,492 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:23:53,551 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f73c67c1/f53eaa11831d4d03a4d723dea8c96cc2/FLAGf9e075373 [2019-09-08 11:23:54,072 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:23:54,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:23:54,084 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f73c67c1/f53eaa11831d4d03a4d723dea8c96cc2/FLAGf9e075373 [2019-09-08 11:23:54,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f73c67c1/f53eaa11831d4d03a4d723dea8c96cc2 [2019-09-08 11:23:54,408 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:23:54,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:23:54,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:23:54,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:23:54,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:23:54,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:23:54" (1/1) ... [2019-09-08 11:23:54,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b08670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:54, skipping insertion in model container [2019-09-08 11:23:54,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:23:54" (1/1) ... [2019-09-08 11:23:54,424 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:23:54,481 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:23:54,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:23:54,854 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:23:54,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:23:54,973 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:23:54,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:54 WrapperNode [2019-09-08 11:23:54,974 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:23:54,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:23:54,975 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:23:54,975 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:23:54,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:54" (1/1) ... [2019-09-08 11:23:54,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:54" (1/1) ... [2019-09-08 11:23:55,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:54" (1/1) ... [2019-09-08 11:23:55,007 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:54" (1/1) ... [2019-09-08 11:23:55,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:54" (1/1) ... [2019-09-08 11:23:55,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:54" (1/1) ... [2019-09-08 11:23:55,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:54" (1/1) ... [2019-09-08 11:23:55,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:23:55,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:23:55,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:23:55,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:23:55,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:23:55,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:23:55,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:23:55,133 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:23:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:23:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:23:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:23:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 11:23:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:23:55,134 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:23:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:23:55,135 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:23:55,137 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:23:55,138 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:23:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:23:55,139 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:23:55,140 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:23:55,142 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 11:23:55,142 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:23:55,142 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:23:55,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:23:55,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:23:55,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:23:55,931 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:23:55,931 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:23:55,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:23:55 BoogieIcfgContainer [2019-09-08 11:23:55,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:23:55,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:23:55,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:23:55,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:23:55,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:23:54" (1/3) ... [2019-09-08 11:23:55,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a82058a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:23:55, skipping insertion in model container [2019-09-08 11:23:55,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:23:54" (2/3) ... [2019-09-08 11:23:55,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a82058a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:23:55, skipping insertion in model container [2019-09-08 11:23:55,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:23:55" (3/3) ... [2019-09-08 11:23:55,941 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.2.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-08 11:23:55,952 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:23:55,960 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:23:55,978 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:23:56,006 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:23:56,007 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:23:56,007 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:23:56,007 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:23:56,007 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:23:56,007 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:23:56,007 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:23:56,008 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:23:56,008 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:23:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states. [2019-09-08 11:23:56,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:23:56,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:56,044 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:56,046 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:56,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:56,052 INFO L82 PathProgramCache]: Analyzing trace with hash -826086369, now seen corresponding path program 1 times [2019-09-08 11:23:56,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:56,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:56,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:56,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:56,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:56,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:56,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:23:56,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:23:56,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:23:56,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:56,599 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 3 states. [2019-09-08 11:23:56,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:56,721 INFO L93 Difference]: Finished difference Result 383 states and 616 transitions. [2019-09-08 11:23:56,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:23:56,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 11:23:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:56,749 INFO L225 Difference]: With dead ends: 383 [2019-09-08 11:23:56,750 INFO L226 Difference]: Without dead ends: 258 [2019-09-08 11:23:56,758 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-09-08 11:23:56,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2019-09-08 11:23:56,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-09-08 11:23:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2019-09-08 11:23:56,874 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 77 [2019-09-08 11:23:56,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:56,875 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2019-09-08 11:23:56,875 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:23:56,875 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2019-09-08 11:23:56,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:23:56,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:56,879 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:56,879 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:56,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:56,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1869373593, now seen corresponding path program 1 times [2019-09-08 11:23:56,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:56,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:56,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:56,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:56,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:57,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:57,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:23:57,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:23:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:23:57,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:57,127 INFO L87 Difference]: Start difference. First operand 256 states and 380 transitions. Second operand 3 states. [2019-09-08 11:23:57,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:57,199 INFO L93 Difference]: Finished difference Result 640 states and 992 transitions. [2019-09-08 11:23:57,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:23:57,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 11:23:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:57,205 INFO L225 Difference]: With dead ends: 640 [2019-09-08 11:23:57,205 INFO L226 Difference]: Without dead ends: 432 [2019-09-08 11:23:57,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:57,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-08 11:23:57,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 430. [2019-09-08 11:23:57,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-08 11:23:57,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 657 transitions. [2019-09-08 11:23:57,248 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 657 transitions. Word has length 78 [2019-09-08 11:23:57,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:57,249 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 657 transitions. [2019-09-08 11:23:57,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:23:57,251 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 657 transitions. [2019-09-08 11:23:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:23:57,253 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:57,254 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:57,254 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:57,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:57,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1207389834, now seen corresponding path program 1 times [2019-09-08 11:23:57,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:57,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:57,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:57,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:57,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:57,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:57,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:23:57,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:23:57,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:23:57,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:57,406 INFO L87 Difference]: Start difference. First operand 430 states and 657 transitions. Second operand 3 states. [2019-09-08 11:23:57,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:57,501 INFO L93 Difference]: Finished difference Result 1130 states and 1771 transitions. [2019-09-08 11:23:57,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:23:57,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 11:23:57,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:57,511 INFO L225 Difference]: With dead ends: 1130 [2019-09-08 11:23:57,511 INFO L226 Difference]: Without dead ends: 748 [2019-09-08 11:23:57,517 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:57,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-09-08 11:23:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 746. [2019-09-08 11:23:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 746 states. [2019-09-08 11:23:57,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1157 transitions. [2019-09-08 11:23:57,593 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1157 transitions. Word has length 79 [2019-09-08 11:23:57,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:57,596 INFO L475 AbstractCegarLoop]: Abstraction has 746 states and 1157 transitions. [2019-09-08 11:23:57,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:23:57,596 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1157 transitions. [2019-09-08 11:23:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:23:57,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:57,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:57,607 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:57,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:57,607 INFO L82 PathProgramCache]: Analyzing trace with hash 856537934, now seen corresponding path program 1 times [2019-09-08 11:23:57,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:57,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:57,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:57,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:57,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:57,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:57,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:57,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:23:57,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:23:57,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:23:57,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:57,759 INFO L87 Difference]: Start difference. First operand 746 states and 1157 transitions. Second operand 3 states. [2019-09-08 11:23:57,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:57,850 INFO L93 Difference]: Finished difference Result 2014 states and 3167 transitions. [2019-09-08 11:23:57,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:23:57,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 11:23:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:57,859 INFO L225 Difference]: With dead ends: 2014 [2019-09-08 11:23:57,859 INFO L226 Difference]: Without dead ends: 1316 [2019-09-08 11:23:57,862 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:57,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2019-09-08 11:23:57,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1314. [2019-09-08 11:23:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-09-08 11:23:57,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 2049 transitions. [2019-09-08 11:23:57,927 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 2049 transitions. Word has length 80 [2019-09-08 11:23:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:57,927 INFO L475 AbstractCegarLoop]: Abstraction has 1314 states and 2049 transitions. [2019-09-08 11:23:57,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:23:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 2049 transitions. [2019-09-08 11:23:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:23:57,929 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:57,929 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:57,930 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:57,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:57,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2050615543, now seen corresponding path program 1 times [2019-09-08 11:23:57,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:57,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:57,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:57,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:57,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:58,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:58,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:23:58,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:23:58,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:23:58,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:58,017 INFO L87 Difference]: Start difference. First operand 1314 states and 2049 transitions. Second operand 3 states. [2019-09-08 11:23:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:58,130 INFO L93 Difference]: Finished difference Result 3590 states and 5635 transitions. [2019-09-08 11:23:58,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:23:58,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:23:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:58,143 INFO L225 Difference]: With dead ends: 3590 [2019-09-08 11:23:58,144 INFO L226 Difference]: Without dead ends: 2324 [2019-09-08 11:23:58,147 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:23:58,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2324 states. [2019-09-08 11:23:58,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2324 to 2322. [2019-09-08 11:23:58,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2019-09-08 11:23:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3617 transitions. [2019-09-08 11:23:58,262 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3617 transitions. Word has length 81 [2019-09-08 11:23:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:58,264 INFO L475 AbstractCegarLoop]: Abstraction has 2322 states and 3617 transitions. [2019-09-08 11:23:58,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:23:58,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3617 transitions. [2019-09-08 11:23:58,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:23:58,265 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:58,265 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:23:58,266 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:58,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:58,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1507278871, now seen corresponding path program 1 times [2019-09-08 11:23:58,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:58,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:58,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:58,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:58,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:58,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:23:58,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:23:58,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:23:58,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:23:58,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:23:58,598 INFO L87 Difference]: Start difference. First operand 2322 states and 3617 transitions. Second operand 8 states. [2019-09-08 11:23:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:59,526 INFO L93 Difference]: Finished difference Result 14126 states and 21991 transitions. [2019-09-08 11:23:59,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:23:59,527 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-09-08 11:23:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:59,614 INFO L225 Difference]: With dead ends: 14126 [2019-09-08 11:23:59,614 INFO L226 Difference]: Without dead ends: 11852 [2019-09-08 11:23:59,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:23:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11852 states. [2019-09-08 11:24:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11852 to 11842. [2019-09-08 11:24:00,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11842 states. [2019-09-08 11:24:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11842 states to 11842 states and 18385 transitions. [2019-09-08 11:24:00,730 INFO L78 Accepts]: Start accepts. Automaton has 11842 states and 18385 transitions. Word has length 82 [2019-09-08 11:24:00,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:00,731 INFO L475 AbstractCegarLoop]: Abstraction has 11842 states and 18385 transitions. [2019-09-08 11:24:00,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:24:00,732 INFO L276 IsEmpty]: Start isEmpty. Operand 11842 states and 18385 transitions. [2019-09-08 11:24:00,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:24:00,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:00,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:00,735 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:00,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:00,740 INFO L82 PathProgramCache]: Analyzing trace with hash 308811751, now seen corresponding path program 1 times [2019-09-08 11:24:00,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:00,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:00,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:00,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:00,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:00,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:00,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:24:00,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:24:00,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:24:00,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:24:00,829 INFO L87 Difference]: Start difference. First operand 11842 states and 18385 transitions. Second operand 3 states. [2019-09-08 11:24:01,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:01,871 INFO L93 Difference]: Finished difference Result 32934 states and 51027 transitions. [2019-09-08 11:24:01,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:24:01,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-08 11:24:01,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:01,966 INFO L225 Difference]: With dead ends: 32934 [2019-09-08 11:24:01,966 INFO L226 Difference]: Without dead ends: 21140 [2019-09-08 11:24:01,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:24:02,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21140 states. [2019-09-08 11:24:03,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21140 to 21138. [2019-09-08 11:24:03,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21138 states. [2019-09-08 11:24:03,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21138 states to 21138 states and 32497 transitions. [2019-09-08 11:24:03,938 INFO L78 Accepts]: Start accepts. Automaton has 21138 states and 32497 transitions. Word has length 84 [2019-09-08 11:24:03,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:03,938 INFO L475 AbstractCegarLoop]: Abstraction has 21138 states and 32497 transitions. [2019-09-08 11:24:03,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:24:03,939 INFO L276 IsEmpty]: Start isEmpty. Operand 21138 states and 32497 transitions. [2019-09-08 11:24:03,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:24:03,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:03,941 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:03,941 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:03,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:03,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1160585458, now seen corresponding path program 1 times [2019-09-08 11:24:03,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:03,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:03,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:03,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:03,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:04,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:04,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:24:04,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:24:04,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:24:04,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:24:04,057 INFO L87 Difference]: Start difference. First operand 21138 states and 32497 transitions. Second operand 6 states. [2019-09-08 11:24:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:06,808 INFO L93 Difference]: Finished difference Result 83288 states and 127924 transitions. [2019-09-08 11:24:06,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:24:06,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-09-08 11:24:06,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:06,977 INFO L225 Difference]: With dead ends: 83288 [2019-09-08 11:24:06,977 INFO L226 Difference]: Without dead ends: 62198 [2019-09-08 11:24:07,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:24:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62198 states. [2019-09-08 11:24:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62198 to 62194. [2019-09-08 11:24:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62194 states. [2019-09-08 11:24:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62194 states to 62194 states and 95153 transitions. [2019-09-08 11:24:10,762 INFO L78 Accepts]: Start accepts. Automaton has 62194 states and 95153 transitions. Word has length 84 [2019-09-08 11:24:10,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:10,762 INFO L475 AbstractCegarLoop]: Abstraction has 62194 states and 95153 transitions. [2019-09-08 11:24:10,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:24:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 62194 states and 95153 transitions. [2019-09-08 11:24:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-08 11:24:10,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:10,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:10,765 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:10,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:10,765 INFO L82 PathProgramCache]: Analyzing trace with hash 456919433, now seen corresponding path program 1 times [2019-09-08 11:24:10,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:10,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:10,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:10,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:10,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:10,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:10,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:24:10,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:24:10,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:24:10,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:24:10,999 INFO L87 Difference]: Start difference. First operand 62194 states and 95153 transitions. Second operand 8 states. [2019-09-08 11:24:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:23,330 INFO L93 Difference]: Finished difference Result 350336 states and 536696 transitions. [2019-09-08 11:24:23,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:24:23,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-09-08 11:24:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:24,530 INFO L225 Difference]: With dead ends: 350336 [2019-09-08 11:24:24,530 INFO L226 Difference]: Without dead ends: 288190 [2019-09-08 11:24:24,670 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:24:24,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288190 states. [2019-09-08 11:24:33,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288190 to 124338. [2019-09-08 11:24:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124338 states. [2019-09-08 11:24:34,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124338 states to 124338 states and 187953 transitions. [2019-09-08 11:24:34,634 INFO L78 Accepts]: Start accepts. Automaton has 124338 states and 187953 transitions. Word has length 84 [2019-09-08 11:24:34,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:34,634 INFO L475 AbstractCegarLoop]: Abstraction has 124338 states and 187953 transitions. [2019-09-08 11:24:34,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:24:34,635 INFO L276 IsEmpty]: Start isEmpty. Operand 124338 states and 187953 transitions. [2019-09-08 11:24:34,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:24:34,636 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:34,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:34,637 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:34,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:34,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1261067860, now seen corresponding path program 1 times [2019-09-08 11:24:34,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:34,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:34,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:34,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:34,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:34,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:24:34,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:24:34,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:24:34,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:24:34,738 INFO L87 Difference]: Start difference. First operand 124338 states and 187953 transitions. Second operand 5 states. [2019-09-08 11:24:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:24:47,336 INFO L93 Difference]: Finished difference Result 253236 states and 380466 transitions. [2019-09-08 11:24:47,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:24:47,337 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 11:24:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:24:47,701 INFO L225 Difference]: With dead ends: 253236 [2019-09-08 11:24:47,701 INFO L226 Difference]: Without dead ends: 253234 [2019-09-08 11:24:47,750 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:24:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253234 states. [2019-09-08 11:24:58,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253234 to 128946. [2019-09-08 11:24:58,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128946 states. [2019-09-08 11:24:58,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128946 states to 128946 states and 192561 transitions. [2019-09-08 11:24:58,432 INFO L78 Accepts]: Start accepts. Automaton has 128946 states and 192561 transitions. Word has length 85 [2019-09-08 11:24:58,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:58,433 INFO L475 AbstractCegarLoop]: Abstraction has 128946 states and 192561 transitions. [2019-09-08 11:24:58,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:24:58,433 INFO L276 IsEmpty]: Start isEmpty. Operand 128946 states and 192561 transitions. [2019-09-08 11:24:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:24:58,434 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:58,434 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] [2019-09-08 11:24:58,435 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:58,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:58,435 INFO L82 PathProgramCache]: Analyzing trace with hash 448017816, now seen corresponding path program 1 times [2019-09-08 11:24:58,435 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:58,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:58,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:58,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:58,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:58,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:24:58,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:58,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:24:58,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:24:58,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:24:58,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:24:58,514 INFO L87 Difference]: Start difference. First operand 128946 states and 192561 transitions. Second operand 3 states. [2019-09-08 11:25:08,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:08,875 INFO L93 Difference]: Finished difference Result 316808 states and 472885 transitions. [2019-09-08 11:25:08,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:08,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-08 11:25:08,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:09,138 INFO L225 Difference]: With dead ends: 316808 [2019-09-08 11:25:09,138 INFO L226 Difference]: Without dead ends: 187910 [2019-09-08 11:25:09,239 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:25:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187910 states. [2019-09-08 11:25:23,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187910 to 186852. [2019-09-08 11:25:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186852 states. [2019-09-08 11:25:23,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186852 states to 186852 states and 277203 transitions. [2019-09-08 11:25:23,849 INFO L78 Accepts]: Start accepts. Automaton has 186852 states and 277203 transitions. Word has length 86 [2019-09-08 11:25:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:25:23,849 INFO L475 AbstractCegarLoop]: Abstraction has 186852 states and 277203 transitions. [2019-09-08 11:25:23,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:25:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 186852 states and 277203 transitions. [2019-09-08 11:25:23,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:25:23,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:25:23,907 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:25:23,907 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:25:23,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:25:23,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1810123221, now seen corresponding path program 1 times [2019-09-08 11:25:23,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:25:23,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:25:23,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:23,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:23,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:25:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:24,048 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:24,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:25:24,048 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:25:24,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:25:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:25:24,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:25:24,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:25:24,406 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:25:24,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:25:24,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:25:24,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:25:24,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:25:24,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:25:24,424 INFO L87 Difference]: Start difference. First operand 186852 states and 277203 transitions. Second operand 11 states. [2019-09-08 11:26:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:26:03,333 INFO L93 Difference]: Finished difference Result 716576 states and 1061585 transitions. [2019-09-08 11:26:03,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:26:03,333 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 116 [2019-09-08 11:26:03,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:04,536 INFO L225 Difference]: With dead ends: 716576 [2019-09-08 11:26:04,536 INFO L226 Difference]: Without dead ends: 558718 [2019-09-08 11:26:04,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:26:05,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558718 states. [2019-09-08 11:26:32,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558718 to 261732. [2019-09-08 11:26:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261732 states. [2019-09-08 11:26:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261732 states to 261732 states and 386195 transitions. [2019-09-08 11:26:32,724 INFO L78 Accepts]: Start accepts. Automaton has 261732 states and 386195 transitions. Word has length 116 [2019-09-08 11:26:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:32,725 INFO L475 AbstractCegarLoop]: Abstraction has 261732 states and 386195 transitions. [2019-09-08 11:26:32,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:26:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 261732 states and 386195 transitions. [2019-09-08 11:26:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:26:32,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:32,812 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:26:32,812 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:32,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:32,813 INFO L82 PathProgramCache]: Analyzing trace with hash -493504054, now seen corresponding path program 1 times [2019-09-08 11:26:32,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:32,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:32,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:32,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:32,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:32,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:26:32,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:32,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:26:32,906 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:26:32,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:26:32,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:26:32,907 INFO L87 Difference]: Start difference. First operand 261732 states and 386195 transitions. Second operand 3 states. [2019-09-08 11:26:58,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:26:58,464 INFO L93 Difference]: Finished difference Result 437304 states and 645700 transitions. [2019-09-08 11:26:58,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:26:58,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 11:26:58,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:26:58,950 INFO L225 Difference]: With dead ends: 437304 [2019-09-08 11:26:58,950 INFO L226 Difference]: Without dead ends: 335862 [2019-09-08 11:26:59,054 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:26:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335862 states. [2019-09-08 11:27:27,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335862 to 314724. [2019-09-08 11:27:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314724 states. [2019-09-08 11:27:27,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314724 states to 314724 states and 460594 transitions. [2019-09-08 11:27:27,713 INFO L78 Accepts]: Start accepts. Automaton has 314724 states and 460594 transitions. Word has length 116 [2019-09-08 11:27:27,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:27:27,713 INFO L475 AbstractCegarLoop]: Abstraction has 314724 states and 460594 transitions. [2019-09-08 11:27:27,714 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:27:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 314724 states and 460594 transitions. [2019-09-08 11:27:27,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:27:27,758 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:27:27,758 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:27:27,759 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:27:27,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:27:27,759 INFO L82 PathProgramCache]: Analyzing trace with hash -980339885, now seen corresponding path program 1 times [2019-09-08 11:27:27,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:27:27,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:27:27,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:27,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:27:27,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:27:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:27:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:27:27,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:27:27,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:27:27,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:27:27,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:27:27,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:27,841 INFO L87 Difference]: Start difference. First operand 314724 states and 460594 transitions. Second operand 3 states. [2019-09-08 11:27:57,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:27:57,089 INFO L93 Difference]: Finished difference Result 451224 states and 659546 transitions. [2019-09-08 11:27:57,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:27:57,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 11:27:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:27:57,593 INFO L225 Difference]: With dead ends: 451224 [2019-09-08 11:27:57,593 INFO L226 Difference]: Without dead ends: 328723 [2019-09-08 11:27:57,724 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:27:58,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328723 states. [2019-09-08 11:28:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328723 to 315661. [2019-09-08 11:28:27,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315661 states. [2019-09-08 11:28:28,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315661 states to 315661 states and 456975 transitions. [2019-09-08 11:28:28,417 INFO L78 Accepts]: Start accepts. Automaton has 315661 states and 456975 transitions. Word has length 116 [2019-09-08 11:28:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:28:28,417 INFO L475 AbstractCegarLoop]: Abstraction has 315661 states and 456975 transitions. [2019-09-08 11:28:28,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:28:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 315661 states and 456975 transitions. [2019-09-08 11:28:28,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:28:28,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:28:28,447 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:28:28,447 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:28:28,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:28:28,448 INFO L82 PathProgramCache]: Analyzing trace with hash 984946795, now seen corresponding path program 1 times [2019-09-08 11:28:28,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:28:28,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:28:28,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:28,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:28:28,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:28:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:28:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:28:28,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:28:28,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:28:28,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:28:28,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:28:28,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:28:28,525 INFO L87 Difference]: Start difference. First operand 315661 states and 456975 transitions. Second operand 3 states. [2019-09-08 11:29:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:29:06,751 INFO L93 Difference]: Finished difference Result 679673 states and 985439 transitions. [2019-09-08 11:29:06,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:29:06,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 11:29:06,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:29:07,560 INFO L225 Difference]: With dead ends: 679673 [2019-09-08 11:29:07,560 INFO L226 Difference]: Without dead ends: 473035 [2019-09-08 11:29:07,754 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:29:08,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473035 states. [2019-09-08 11:29:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473035 to 465495. [2019-09-08 11:29:50,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465495 states. [2019-09-08 11:29:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465495 states to 465495 states and 668887 transitions. [2019-09-08 11:29:51,057 INFO L78 Accepts]: Start accepts. Automaton has 465495 states and 668887 transitions. Word has length 116 [2019-09-08 11:29:51,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:29:51,058 INFO L475 AbstractCegarLoop]: Abstraction has 465495 states and 668887 transitions. [2019-09-08 11:29:51,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:29:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 465495 states and 668887 transitions. [2019-09-08 11:29:51,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:29:51,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:29:51,106 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:29:51,106 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:29:51,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:29:51,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1879131446, now seen corresponding path program 1 times [2019-09-08 11:29:51,106 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:29:51,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:29:51,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:51,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:29:51,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:29:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:29:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:29:51,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:29:51,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:29:51,186 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:29:51,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:29:51,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:29:51,187 INFO L87 Difference]: Start difference. First operand 465495 states and 668887 transitions. Second operand 3 states. [2019-09-08 11:31:02,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:31:02,568 INFO L93 Difference]: Finished difference Result 1190777 states and 1709561 transitions. [2019-09-08 11:31:02,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:31:02,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-09-08 11:31:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:31:04,045 INFO L225 Difference]: With dead ends: 1190777 [2019-09-08 11:31:04,045 INFO L226 Difference]: Without dead ends: 792112 [2019-09-08 11:31:04,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:31:05,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792112 states. [2019-09-08 11:32:24,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792112 to 785535. [2019-09-08 11:32:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785535 states. [2019-09-08 11:32:26,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785535 states to 785535 states and 1118547 transitions. [2019-09-08 11:32:26,938 INFO L78 Accepts]: Start accepts. Automaton has 785535 states and 1118547 transitions. Word has length 116 [2019-09-08 11:32:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:32:26,939 INFO L475 AbstractCegarLoop]: Abstraction has 785535 states and 1118547 transitions. [2019-09-08 11:32:26,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:32:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 785535 states and 1118547 transitions. [2019-09-08 11:32:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:32:27,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:32:27,023 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:32:27,023 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:32:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:32:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1068302349, now seen corresponding path program 1 times [2019-09-08 11:32:27,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:32:27,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:32:27,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:27,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:32:27,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:32:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:32:27,116 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 11:32:27,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:32:27,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:32:27,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:32:27,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:32:27,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:32:27,118 INFO L87 Difference]: Start difference. First operand 785535 states and 1118547 transitions. Second operand 5 states. [2019-09-08 11:34:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:34:26,400 INFO L93 Difference]: Finished difference Result 1984248 states and 2820797 transitions. [2019-09-08 11:34:26,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:34:26,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-09-08 11:34:26,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:34:28,588 INFO L225 Difference]: With dead ends: 1984248 [2019-09-08 11:34:28,588 INFO L226 Difference]: Without dead ends: 1198826 [2019-09-08 11:34:29,145 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:34:30,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198826 states.