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.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:17:26,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:17:26,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:17:26,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:17:26,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:17:26,256 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:17:26,258 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:17:26,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:17:26,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:17:26,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:17:26,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:17:26,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:17:26,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:17:26,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:17:26,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:17:26,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:17:26,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:17:26,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:17:26,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:17:26,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:17:26,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:17:26,275 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:17:26,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:17:26,277 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:17:26,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:17:26,279 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:17:26,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:17:26,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:17:26,281 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:17:26,282 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:17:26,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:17:26,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:17:26,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:17:26,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:17:26,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:17:26,286 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:17:26,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:17:26,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:17:26,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:17:26,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:17:26,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:17:26,291 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:17:26,320 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:17:26,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:17:26,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:17:26,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:17:26,322 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:17:26,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:17:26,322 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:17:26,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:17:26,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:17:26,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:17:26,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:17:26,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:17:26,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:17:26,324 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:17:26,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:17:26,324 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:17:26,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:17:26,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:17:26,325 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:17:26,325 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:17:26,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:17:26,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:17:26,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:17:26,326 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:17:26,326 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:17:26,326 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:17:26,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:17:26,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:17:26,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:17:26,363 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:17:26,374 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:17:26,378 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:17:26,379 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:17:26,379 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:17:26,380 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.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 11:17:26,453 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37872f84/c5d0b694743c402ba7c576bab12693d6/FLAG62605cfbb [2019-09-08 11:17:26,978 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:17:26,979 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 11:17:26,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37872f84/c5d0b694743c402ba7c576bab12693d6/FLAG62605cfbb [2019-09-08 11:17:27,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37872f84/c5d0b694743c402ba7c576bab12693d6 [2019-09-08 11:17:27,304 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:17:27,306 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:17:27,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:17:27,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:17:27,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:17:27,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:17:27" (1/1) ... [2019-09-08 11:17:27,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5815796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:17:27, skipping insertion in model container [2019-09-08 11:17:27,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:17:27" (1/1) ... [2019-09-08 11:17:27,320 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:17:27,385 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:17:27,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:17:27,990 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:17:28,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:17:28,141 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:17:28,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:17:28 WrapperNode [2019-09-08 11:17:28,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:17:28,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:17:28,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:17:28,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:17:28,160 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:17:28" (1/1) ... [2019-09-08 11:17:28,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:17:28" (1/1) ... [2019-09-08 11:17:28,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:17:28" (1/1) ... [2019-09-08 11:17:28,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:17:28" (1/1) ... [2019-09-08 11:17:28,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:17:28" (1/1) ... [2019-09-08 11:17:28,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:17:28" (1/1) ... [2019-09-08 11:17:28,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:17:28" (1/1) ... [2019-09-08 11:17:28,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:17:28,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:17:28,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:17:28,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:17:28,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:17:28" (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:17:28,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:17:28,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:17:28,300 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:17:28,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:17:28,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:17:28,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:17:28,301 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:17:28,301 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:17:28,301 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:17:28,301 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:17:28,301 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:17:28,302 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:17:28,302 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:17:28,302 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:17:28,302 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:17:28,302 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 11:17:28,303 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:17:28,303 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:17:28,303 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:17:28,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:17:28,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:17:29,616 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:17:29,617 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:17:29,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:17:29 BoogieIcfgContainer [2019-09-08 11:17:29,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:17:29,619 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:17:29,619 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:17:29,623 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:17:29,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:17:27" (1/3) ... [2019-09-08 11:17:29,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549b880a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:17:29, skipping insertion in model container [2019-09-08 11:17:29,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:17:28" (2/3) ... [2019-09-08 11:17:29,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@549b880a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:17:29, skipping insertion in model container [2019-09-08 11:17:29,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:17:29" (3/3) ... [2019-09-08 11:17:29,627 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+nlh-reducer.c [2019-09-08 11:17:29,638 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:17:29,647 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:17:29,666 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:17:29,700 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:17:29,701 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:17:29,701 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:17:29,701 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:17:29,702 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:17:29,702 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:17:29,702 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:17:29,702 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:17:29,702 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:17:29,728 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states. [2019-09-08 11:17:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-09-08 11:17:29,740 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:29,741 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:17:29,743 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:29,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:29,749 INFO L82 PathProgramCache]: Analyzing trace with hash -515366270, now seen corresponding path program 1 times [2019-09-08 11:17:29,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:29,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:29,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:29,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:30,300 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:17:30,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:30,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:17:30,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:17:30,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:17:30,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:17:30,327 INFO L87 Difference]: Start difference. First operand 264 states. Second operand 3 states. [2019-09-08 11:17:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:30,544 INFO L93 Difference]: Finished difference Result 529 states and 871 transitions. [2019-09-08 11:17:30,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:17:30,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-09-08 11:17:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:30,565 INFO L225 Difference]: With dead ends: 529 [2019-09-08 11:17:30,565 INFO L226 Difference]: Without dead ends: 400 [2019-09-08 11:17:30,572 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:17:30,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-09-08 11:17:30,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 398. [2019-09-08 11:17:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2019-09-08 11:17:30,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 594 transitions. [2019-09-08 11:17:30,668 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 594 transitions. Word has length 101 [2019-09-08 11:17:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:30,669 INFO L475 AbstractCegarLoop]: Abstraction has 398 states and 594 transitions. [2019-09-08 11:17:30,669 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:17:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 594 transitions. [2019-09-08 11:17:30,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 11:17:30,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:30,675 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:17:30,676 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:30,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:30,676 INFO L82 PathProgramCache]: Analyzing trace with hash 862673413, now seen corresponding path program 1 times [2019-09-08 11:17:30,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:30,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:30,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:30,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:30,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:31,183 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:17:31,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:31,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:17:31,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:17:31,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:17:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:17:31,186 INFO L87 Difference]: Start difference. First operand 398 states and 594 transitions. Second operand 8 states. [2019-09-08 11:17:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:31,743 INFO L93 Difference]: Finished difference Result 1963 states and 3040 transitions. [2019-09-08 11:17:31,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:17:31,744 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2019-09-08 11:17:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:31,756 INFO L225 Difference]: With dead ends: 1963 [2019-09-08 11:17:31,757 INFO L226 Difference]: Without dead ends: 1669 [2019-09-08 11:17:31,763 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:17:31,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-09-08 11:17:31,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1659. [2019-09-08 11:17:31,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1659 states. [2019-09-08 11:17:31,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2562 transitions. [2019-09-08 11:17:31,891 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2562 transitions. Word has length 102 [2019-09-08 11:17:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:31,892 INFO L475 AbstractCegarLoop]: Abstraction has 1659 states and 2562 transitions. [2019-09-08 11:17:31,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:17:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2562 transitions. [2019-09-08 11:17:31,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:17:31,904 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:31,904 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:17:31,905 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:31,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:31,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1435350370, now seen corresponding path program 1 times [2019-09-08 11:17:31,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:31,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:31,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:31,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:31,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:32,110 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:17:32,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:32,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 11:17:32,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 11:17:32,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 11:17:32,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:17:32,114 INFO L87 Difference]: Start difference. First operand 1659 states and 2562 transitions. Second operand 6 states. [2019-09-08 11:17:32,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:32,868 INFO L93 Difference]: Finished difference Result 5768 states and 9027 transitions. [2019-09-08 11:17:32,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:17:32,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-09-08 11:17:32,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:32,895 INFO L225 Difference]: With dead ends: 5768 [2019-09-08 11:17:32,902 INFO L226 Difference]: Without dead ends: 4181 [2019-09-08 11:17:32,907 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:17:32,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2019-09-08 11:17:33,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4177. [2019-09-08 11:17:33,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4177 states. [2019-09-08 11:17:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4177 states to 4177 states and 6523 transitions. [2019-09-08 11:17:33,158 INFO L78 Accepts]: Start accepts. Automaton has 4177 states and 6523 transitions. Word has length 103 [2019-09-08 11:17:33,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:33,158 INFO L475 AbstractCegarLoop]: Abstraction has 4177 states and 6523 transitions. [2019-09-08 11:17:33,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 11:17:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 4177 states and 6523 transitions. [2019-09-08 11:17:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:17:33,164 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:33,164 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:17:33,164 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:33,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:33,165 INFO L82 PathProgramCache]: Analyzing trace with hash -49006449, now seen corresponding path program 1 times [2019-09-08 11:17:33,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:33,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:33,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:33,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:33,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:33,306 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:17:33,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:33,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:17:33,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:17:33,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:17:33,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:17:33,309 INFO L87 Difference]: Start difference. First operand 4177 states and 6523 transitions. Second operand 5 states. [2019-09-08 11:17:34,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:34,152 INFO L93 Difference]: Finished difference Result 11534 states and 18094 transitions. [2019-09-08 11:17:34,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:17:34,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 11:17:34,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:34,201 INFO L225 Difference]: With dead ends: 11534 [2019-09-08 11:17:34,202 INFO L226 Difference]: Without dead ends: 7519 [2019-09-08 11:17:34,212 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:17:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7519 states. [2019-09-08 11:17:34,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7519 to 7517. [2019-09-08 11:17:34,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7517 states. [2019-09-08 11:17:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7517 states to 7517 states and 11731 transitions. [2019-09-08 11:17:34,686 INFO L78 Accepts]: Start accepts. Automaton has 7517 states and 11731 transitions. Word has length 103 [2019-09-08 11:17:34,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:34,687 INFO L475 AbstractCegarLoop]: Abstraction has 7517 states and 11731 transitions. [2019-09-08 11:17:34,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:17:34,687 INFO L276 IsEmpty]: Start isEmpty. Operand 7517 states and 11731 transitions. [2019-09-08 11:17:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:17:34,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:34,693 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:17:34,693 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:34,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:34,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1556143714, now seen corresponding path program 1 times [2019-09-08 11:17:34,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:34,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:34,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:34,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:34,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:34,847 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:17:34,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:34,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:17:34,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:17:34,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:17:34,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:17:34,849 INFO L87 Difference]: Start difference. First operand 7517 states and 11731 transitions. Second operand 5 states. [2019-09-08 11:17:35,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:35,888 INFO L93 Difference]: Finished difference Result 21461 states and 33621 transitions. [2019-09-08 11:17:35,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:17:35,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 11:17:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:35,952 INFO L225 Difference]: With dead ends: 21461 [2019-09-08 11:17:35,953 INFO L226 Difference]: Without dead ends: 14147 [2019-09-08 11:17:35,966 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:17:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14147 states. [2019-09-08 11:17:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14147 to 14145. [2019-09-08 11:17:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14145 states. [2019-09-08 11:17:36,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14145 states to 14145 states and 22071 transitions. [2019-09-08 11:17:36,770 INFO L78 Accepts]: Start accepts. Automaton has 14145 states and 22071 transitions. Word has length 103 [2019-09-08 11:17:36,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:36,770 INFO L475 AbstractCegarLoop]: Abstraction has 14145 states and 22071 transitions. [2019-09-08 11:17:36,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:17:36,770 INFO L276 IsEmpty]: Start isEmpty. Operand 14145 states and 22071 transitions. [2019-09-08 11:17:36,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:17:36,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:36,775 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:17:36,776 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:36,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:36,776 INFO L82 PathProgramCache]: Analyzing trace with hash 202933120, now seen corresponding path program 1 times [2019-09-08 11:17:36,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:36,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:36,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:36,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:36,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:36,873 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:17:36,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:36,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:17:36,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:17:36,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:17:36,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:17:36,874 INFO L87 Difference]: Start difference. First operand 14145 states and 22071 transitions. Second operand 5 states. [2019-09-08 11:17:38,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:38,680 INFO L93 Difference]: Finished difference Result 41597 states and 65001 transitions. [2019-09-08 11:17:38,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:17:38,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 11:17:38,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:38,744 INFO L225 Difference]: With dead ends: 41597 [2019-09-08 11:17:38,744 INFO L226 Difference]: Without dead ends: 27577 [2019-09-08 11:17:38,781 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:17:38,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27577 states. [2019-09-08 11:17:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27577 to 27575. [2019-09-08 11:17:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27575 states. [2019-09-08 11:17:40,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27575 states to 27575 states and 42888 transitions. [2019-09-08 11:17:40,010 INFO L78 Accepts]: Start accepts. Automaton has 27575 states and 42888 transitions. Word has length 103 [2019-09-08 11:17:40,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:40,010 INFO L475 AbstractCegarLoop]: Abstraction has 27575 states and 42888 transitions. [2019-09-08 11:17:40,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:17:40,010 INFO L276 IsEmpty]: Start isEmpty. Operand 27575 states and 42888 transitions. [2019-09-08 11:17:40,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:17:40,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:40,021 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:17:40,021 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:40,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:40,022 INFO L82 PathProgramCache]: Analyzing trace with hash -76299663, now seen corresponding path program 1 times [2019-09-08 11:17:40,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:40,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:40,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:40,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:40,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:40,115 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:17:40,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:40,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:17:40,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:17:40,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:17:40,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:17:40,116 INFO L87 Difference]: Start difference. First operand 27575 states and 42888 transitions. Second operand 5 states. [2019-09-08 11:17:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:42,909 INFO L93 Difference]: Finished difference Result 82021 states and 127680 transitions. [2019-09-08 11:17:42,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:17:42,909 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 11:17:42,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:43,042 INFO L225 Difference]: With dead ends: 82021 [2019-09-08 11:17:43,042 INFO L226 Difference]: Without dead ends: 54541 [2019-09-08 11:17:43,096 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:17:43,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54541 states. [2019-09-08 11:17:44,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54541 to 54539. [2019-09-08 11:17:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54539 states. [2019-09-08 11:17:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54539 states to 54539 states and 84468 transitions. [2019-09-08 11:17:44,986 INFO L78 Accepts]: Start accepts. Automaton has 54539 states and 84468 transitions. Word has length 103 [2019-09-08 11:17:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:44,987 INFO L475 AbstractCegarLoop]: Abstraction has 54539 states and 84468 transitions. [2019-09-08 11:17:44,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:17:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 54539 states and 84468 transitions. [2019-09-08 11:17:44,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-09-08 11:17:44,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:44,997 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:17:44,998 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:44,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:44,998 INFO L82 PathProgramCache]: Analyzing trace with hash -737272749, now seen corresponding path program 1 times [2019-09-08 11:17:44,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:44,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:45,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:45,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:45,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:45,107 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:17:45,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:45,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:17:45,108 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:17:45,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:17:45,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:17:45,109 INFO L87 Difference]: Start difference. First operand 54539 states and 84468 transitions. Second operand 5 states. [2019-09-08 11:17:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:17:49,522 INFO L93 Difference]: Finished difference Result 163040 states and 252621 transitions. [2019-09-08 11:17:49,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:17:49,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 103 [2019-09-08 11:17:49,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:17:49,865 INFO L225 Difference]: With dead ends: 163040 [2019-09-08 11:17:49,866 INFO L226 Difference]: Without dead ends: 108557 [2019-09-08 11:17:49,948 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:17:50,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108557 states. [2019-09-08 11:17:55,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108557 to 108555. [2019-09-08 11:17:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108555 states. [2019-09-08 11:17:55,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108555 states to 108555 states and 167154 transitions. [2019-09-08 11:17:55,780 INFO L78 Accepts]: Start accepts. Automaton has 108555 states and 167154 transitions. Word has length 103 [2019-09-08 11:17:55,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:17:55,780 INFO L475 AbstractCegarLoop]: Abstraction has 108555 states and 167154 transitions. [2019-09-08 11:17:55,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:17:55,780 INFO L276 IsEmpty]: Start isEmpty. Operand 108555 states and 167154 transitions. [2019-09-08 11:17:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 11:17:57,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:17:57,545 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:17:57,545 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:17:57,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:17:57,545 INFO L82 PathProgramCache]: Analyzing trace with hash 303097242, now seen corresponding path program 1 times [2019-09-08 11:17:57,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:17:57,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:17:57,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:57,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:17:57,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:17:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:17:57,692 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:17:57,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:17:57,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:17:57,693 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:17:57,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:17:57,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:17:57,694 INFO L87 Difference]: Start difference. First operand 108555 states and 167154 transitions. Second operand 5 states. [2019-09-08 11:18:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:04,652 INFO L93 Difference]: Finished difference Result 205869 states and 315747 transitions. [2019-09-08 11:18:04,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:18:04,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-09-08 11:18:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:05,028 INFO L225 Difference]: With dead ends: 205869 [2019-09-08 11:18:05,028 INFO L226 Difference]: Without dead ends: 205867 [2019-09-08 11:18:05,076 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:18:05,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205867 states. [2019-09-08 11:18:13,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205867 to 109707. [2019-09-08 11:18:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109707 states. [2019-09-08 11:18:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109707 states to 109707 states and 168306 transitions. [2019-09-08 11:18:13,249 INFO L78 Accepts]: Start accepts. Automaton has 109707 states and 168306 transitions. Word has length 104 [2019-09-08 11:18:13,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:13,249 INFO L475 AbstractCegarLoop]: Abstraction has 109707 states and 168306 transitions. [2019-09-08 11:18:13,249 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:18:13,249 INFO L276 IsEmpty]: Start isEmpty. Operand 109707 states and 168306 transitions. [2019-09-08 11:18:13,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-08 11:18:13,267 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:13,267 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:18:13,268 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:13,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:13,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1148405721, now seen corresponding path program 1 times [2019-09-08 11:18:13,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:13,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:13,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:13,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:13,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:13,370 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:18:13,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:13,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 11:18:13,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 11:18:13,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 11:18:13,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:18:13,372 INFO L87 Difference]: Start difference. First operand 109707 states and 168306 transitions. Second operand 4 states. [2019-09-08 11:18:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:21,787 INFO L93 Difference]: Finished difference Result 313199 states and 478980 transitions. [2019-09-08 11:18:21,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 11:18:21,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-09-08 11:18:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:22,088 INFO L225 Difference]: With dead ends: 313199 [2019-09-08 11:18:22,089 INFO L226 Difference]: Without dead ends: 205997 [2019-09-08 11:18:22,191 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 11:18:22,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205997 states. [2019-09-08 11:18:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205997 to 205995. [2019-09-08 11:18:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205995 states. [2019-09-08 11:18:34,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205995 states to 205995 states and 313826 transitions. [2019-09-08 11:18:34,976 INFO L78 Accepts]: Start accepts. Automaton has 205995 states and 313826 transitions. Word has length 105 [2019-09-08 11:18:34,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:18:34,977 INFO L475 AbstractCegarLoop]: Abstraction has 205995 states and 313826 transitions. [2019-09-08 11:18:34,977 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 11:18:34,977 INFO L276 IsEmpty]: Start isEmpty. Operand 205995 states and 313826 transitions. [2019-09-08 11:18:34,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:18:34,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:18:34,992 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:18:34,993 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:18:34,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:18:34,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1796571939, now seen corresponding path program 1 times [2019-09-08 11:18:34,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:18:34,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:18:34,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:34,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:18:34,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:18:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:18:35,061 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:18:35,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:18:35,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:18:35,062 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:18:35,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:18:35,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:18:35,063 INFO L87 Difference]: Start difference. First operand 205995 states and 313826 transitions. Second operand 3 states. [2019-09-08 11:18:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:53,041 INFO L93 Difference]: Finished difference Result 415159 states and 632342 transitions. [2019-09-08 11:18:53,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:18:53,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 11:18:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:53,412 INFO L225 Difference]: With dead ends: 415159 [2019-09-08 11:18:53,412 INFO L226 Difference]: Without dead ends: 267677 [2019-09-08 11:18:53,516 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:18:53,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267677 states. [2019-09-08 11:19:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267677 to 265968. [2019-09-08 11:19:09,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265968 states. [2019-09-08 11:19:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265968 states to 265968 states and 401027 transitions. [2019-09-08 11:19:09,684 INFO L78 Accepts]: Start accepts. Automaton has 265968 states and 401027 transitions. Word has length 106 [2019-09-08 11:19:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:09,684 INFO L475 AbstractCegarLoop]: Abstraction has 265968 states and 401027 transitions. [2019-09-08 11:19:09,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:19:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand 265968 states and 401027 transitions. [2019-09-08 11:19:09,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:19:09,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:09,703 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:19:09,703 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:09,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:09,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1528380005, now seen corresponding path program 1 times [2019-09-08 11:19:09,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:09,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:09,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:09,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:09,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:19:09,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:09,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:19:09,790 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:19:09,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:19:09,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:19:09,791 INFO L87 Difference]: Start difference. First operand 265968 states and 401027 transitions. Second operand 3 states. [2019-09-08 11:19:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:28,917 INFO L93 Difference]: Finished difference Result 478385 states and 720562 transitions. [2019-09-08 11:19:28,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:19:28,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 11:19:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:29,747 INFO L225 Difference]: With dead ends: 478385 [2019-09-08 11:19:29,748 INFO L226 Difference]: Without dead ends: 317739 [2019-09-08 11:19:29,880 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:19:30,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317739 states. [2019-09-08 11:19:51,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317739 to 315735. [2019-09-08 11:19:51,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315735 states. [2019-09-08 11:19:51,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315735 states to 315735 states and 470223 transitions. [2019-09-08 11:19:51,589 INFO L78 Accepts]: Start accepts. Automaton has 315735 states and 470223 transitions. Word has length 106 [2019-09-08 11:19:51,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:51,589 INFO L475 AbstractCegarLoop]: Abstraction has 315735 states and 470223 transitions. [2019-09-08 11:19:51,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:19:51,589 INFO L276 IsEmpty]: Start isEmpty. Operand 315735 states and 470223 transitions. [2019-09-08 11:19:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:19:51,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:51,613 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:19:51,614 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:51,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:51,614 INFO L82 PathProgramCache]: Analyzing trace with hash -449321198, now seen corresponding path program 1 times [2019-09-08 11:19:51,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:51,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:51,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:51,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:51,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:51,687 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:19:51,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:51,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:19:51,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:19:51,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:19:51,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:19:51,688 INFO L87 Difference]: Start difference. First operand 315735 states and 470223 transitions. Second operand 3 states. [2019-09-08 11:20:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:20:13,048 INFO L93 Difference]: Finished difference Result 429563 states and 638589 transitions. [2019-09-08 11:20:13,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:20:13,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 11:20:13,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:20:13,558 INFO L225 Difference]: With dead ends: 429563 [2019-09-08 11:20:13,558 INFO L226 Difference]: Without dead ends: 347985 [2019-09-08 11:20:13,657 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:20:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347985 states. [2019-09-08 11:20:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347985 to 310531. [2019-09-08 11:20:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310531 states. [2019-09-08 11:20:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310531 states to 310531 states and 456763 transitions. [2019-09-08 11:20:37,455 INFO L78 Accepts]: Start accepts. Automaton has 310531 states and 456763 transitions. Word has length 106 [2019-09-08 11:20:37,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:20:37,456 INFO L475 AbstractCegarLoop]: Abstraction has 310531 states and 456763 transitions. [2019-09-08 11:20:37,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:20:37,456 INFO L276 IsEmpty]: Start isEmpty. Operand 310531 states and 456763 transitions. [2019-09-08 11:20:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:20:37,473 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:20:37,473 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:20:37,473 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:20:37,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:20:37,474 INFO L82 PathProgramCache]: Analyzing trace with hash -237205661, now seen corresponding path program 1 times [2019-09-08 11:20:37,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:20:37,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:20:37,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:37,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:20:37,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:20:37,535 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:20:37,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:20:37,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:20:37,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:20:37,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:20:37,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:20:37,536 INFO L87 Difference]: Start difference. First operand 310531 states and 456763 transitions. Second operand 3 states. [2019-09-08 11:20:58,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:20:58,774 INFO L93 Difference]: Finished difference Result 484407 states and 712103 transitions. [2019-09-08 11:20:58,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:20:58,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 11:20:58,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:20:59,274 INFO L225 Difference]: With dead ends: 484407 [2019-09-08 11:20:59,274 INFO L226 Difference]: Without dead ends: 333597 [2019-09-08 11:20:59,406 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:20:59,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333597 states. [2019-09-08 11:21:25,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333597 to 331027. [2019-09-08 11:21:25,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331027 states. [2019-09-08 11:21:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331027 states to 331027 states and 479825 transitions. [2019-09-08 11:21:26,127 INFO L78 Accepts]: Start accepts. Automaton has 331027 states and 479825 transitions. Word has length 106 [2019-09-08 11:21:26,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:21:26,127 INFO L475 AbstractCegarLoop]: Abstraction has 331027 states and 479825 transitions. [2019-09-08 11:21:26,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:21:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 331027 states and 479825 transitions. [2019-09-08 11:21:26,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:21:26,148 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:21:26,148 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:21:26,148 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:21:26,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:21:26,149 INFO L82 PathProgramCache]: Analyzing trace with hash -121059675, now seen corresponding path program 1 times [2019-09-08 11:21:26,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:21:26,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:21:26,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:26,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:21:26,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:21:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:21:26,256 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:21:26,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:21:26,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:21:26,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:21:26,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:21:26,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:21:26,258 INFO L87 Difference]: Start difference. First operand 331027 states and 479825 transitions. Second operand 7 states. [2019-09-08 11:23:41,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:23:41,560 INFO L93 Difference]: Finished difference Result 2247159 states and 3221038 transitions. [2019-09-08 11:23:41,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:23:41,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 106 [2019-09-08 11:23:41,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:23:45,577 INFO L225 Difference]: With dead ends: 2247159 [2019-09-08 11:23:45,577 INFO L226 Difference]: Without dead ends: 1954519 [2019-09-08 11:23:45,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-08 11:23:47,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954519 states. [2019-09-08 11:24:37,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954519 to 331659. [2019-09-08 11:24:37,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331659 states. [2019-09-08 11:24:38,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331659 states to 331659 states and 480655 transitions. [2019-09-08 11:24:38,210 INFO L78 Accepts]: Start accepts. Automaton has 331659 states and 480655 transitions. Word has length 106 [2019-09-08 11:24:38,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:24:38,211 INFO L475 AbstractCegarLoop]: Abstraction has 331659 states and 480655 transitions. [2019-09-08 11:24:38,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 11:24:38,211 INFO L276 IsEmpty]: Start isEmpty. Operand 331659 states and 480655 transitions. [2019-09-08 11:24:38,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:24:38,235 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:24:38,235 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:24:38,236 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:24:38,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:24:38,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1920757475, now seen corresponding path program 1 times [2019-09-08 11:24:38,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:24:38,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:24:38,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:38,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:24:38,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:24:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:24:38,302 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:38,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:24:38,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:24:38,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:24:38,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:24:38,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:24:38,304 INFO L87 Difference]: Start difference. First operand 331659 states and 480655 transitions. Second operand 3 states. [2019-09-08 11:25:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:27,748 INFO L93 Difference]: Finished difference Result 905556 states and 1312169 transitions. [2019-09-08 11:25:27,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:25:27,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-08 11:25:27,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:28,719 INFO L225 Difference]: With dead ends: 905556 [2019-09-08 11:25:28,720 INFO L226 Difference]: Without dead ends: 599588 [2019-09-08 11:25:29,559 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:29,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599588 states. [2019-09-08 11:26:30,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599588 to 598656. [2019-09-08 11:26:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598656 states. [2019-09-08 11:26:32,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598656 states to 598656 states and 861314 transitions. [2019-09-08 11:26:32,273 INFO L78 Accepts]: Start accepts. Automaton has 598656 states and 861314 transitions. Word has length 106 [2019-09-08 11:26:32,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:26:32,273 INFO L475 AbstractCegarLoop]: Abstraction has 598656 states and 861314 transitions. [2019-09-08 11:26:32,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:26:32,273 INFO L276 IsEmpty]: Start isEmpty. Operand 598656 states and 861314 transitions. [2019-09-08 11:26:32,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-08 11:26:32,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:26:32,314 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:26:32,314 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:26:32,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:26:32,315 INFO L82 PathProgramCache]: Analyzing trace with hash -2046382973, now seen corresponding path program 1 times [2019-09-08 11:26:32,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:26:32,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:26:32,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:32,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:26:32,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:26:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:26:32,426 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:26:32,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:26:32,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 11:26:32,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 11:26:32,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 11:26:32,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:26:32,428 INFO L87 Difference]: Start difference. First operand 598656 states and 861314 transitions. Second operand 7 states.