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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:40:08,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:40:08,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:40:08,354 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:40:08,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:40:08,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:40:08,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:40:08,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:40:08,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:40:08,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:40:08,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:40:08,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:40:08,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:40:08,364 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:40:08,365 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:40:08,366 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:40:08,367 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:40:08,368 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:40:08,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:40:08,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:40:08,373 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:40:08,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:40:08,375 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:40:08,376 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:40:08,378 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:40:08,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:40:08,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:40:08,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:40:08,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:40:08,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:40:08,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:40:08,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:40:08,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:40:08,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:40:08,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:40:08,385 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:40:08,385 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:40:08,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:40:08,386 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:40:08,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:40:08,387 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:40:08,388 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 10:40:08,402 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:40:08,403 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:40:08,404 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:40:08,404 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:40:08,404 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:40:08,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:40:08,405 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:40:08,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:40:08,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:40:08,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:40:08,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:40:08,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:40:08,406 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:40:08,406 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:40:08,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:40:08,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:40:08,407 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:40:08,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:40:08,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:40:08,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:40:08,408 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:40:08,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:40:08,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:40:08,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:40:08,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:40:08,409 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:40:08,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:40:08,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:40:08,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:40:08,437 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:40:08,449 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:40:08,453 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:40:08,454 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:40:08,454 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:40:08,455 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.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 10:40:08,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256a9ba9f/b3bc0fc9ef124268964cfc8948088757/FLAGaf959682f [2019-09-08 10:40:09,331 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:40:09,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 10:40:09,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256a9ba9f/b3bc0fc9ef124268964cfc8948088757/FLAGaf959682f [2019-09-08 10:40:09,841 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256a9ba9f/b3bc0fc9ef124268964cfc8948088757 [2019-09-08 10:40:09,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:40:09,854 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:40:09,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:40:09,855 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:40:09,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:40:09,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:40:09" (1/1) ... [2019-09-08 10:40:09,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308db9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:40:09, skipping insertion in model container [2019-09-08 10:40:09,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:40:09" (1/1) ... [2019-09-08 10:40:09,870 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:40:10,162 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:40:12,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:40:12,145 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:40:13,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:40:13,370 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:40:13,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:40:13 WrapperNode [2019-09-08 10:40:13,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:40:13,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:40:13,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:40:13,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:40:13,387 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:40:13" (1/1) ... [2019-09-08 10:40:13,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:40:13" (1/1) ... [2019-09-08 10:40:13,501 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:40:13" (1/1) ... [2019-09-08 10:40:13,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:40:13" (1/1) ... [2019-09-08 10:40:13,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:40:13" (1/1) ... [2019-09-08 10:40:13,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:40:13" (1/1) ... [2019-09-08 10:40:13,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:40:13" (1/1) ... [2019-09-08 10:40:13,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:40:13,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:40:13,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:40:13,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:40:13,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:40:13" (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 10:40:13,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:40:13,927 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:40:13,928 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:40:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:40:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:40:13,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:40:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:40:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:40:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:40:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:40:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:40:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:40:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:40:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:40:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:40:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:40:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:40:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:40:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:40:23,208 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:40:23,209 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:40:23,213 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:40:23 BoogieIcfgContainer [2019-09-08 10:40:23,213 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:40:23,215 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:40:23,215 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:40:23,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:40:23,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:40:09" (1/3) ... [2019-09-08 10:40:23,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54230c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:40:23, skipping insertion in model container [2019-09-08 10:40:23,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:40:13" (2/3) ... [2019-09-08 10:40:23,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54230c50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:40:23, skipping insertion in model container [2019-09-08 10:40:23,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:40:23" (3/3) ... [2019-09-08 10:40:23,226 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.1.ufo.BOUNDED-8.pals.c.v+sep-reducer.c [2019-09-08 10:40:23,236 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:40:23,265 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-08 10:40:23,284 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-08 10:40:23,346 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:40:23,346 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:40:23,347 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:40:23,347 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:40:23,347 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:40:23,347 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:40:23,347 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:40:23,347 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:40:23,347 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:40:23,416 INFO L276 IsEmpty]: Start isEmpty. Operand 3737 states. [2019-09-08 10:40:23,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:40:23,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:23,453 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:40:23,456 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:23,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:23,462 INFO L82 PathProgramCache]: Analyzing trace with hash 659156996, now seen corresponding path program 1 times [2019-09-08 10:40:23,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:23,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:23,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:23,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:23,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:24,522 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 10:40:24,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:24,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:40:24,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:40:24,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:40:24,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:40:24,547 INFO L87 Difference]: Start difference. First operand 3737 states. Second operand 5 states. [2019-09-08 10:40:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:29,946 INFO L93 Difference]: Finished difference Result 7055 states and 12233 transitions. [2019-09-08 10:40:29,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:40:29,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-09-08 10:40:29,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:30,003 INFO L225 Difference]: With dead ends: 7055 [2019-09-08 10:40:30,003 INFO L226 Difference]: Without dead ends: 4530 [2019-09-08 10:40:30,020 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 10:40:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4530 states. [2019-09-08 10:40:30,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4530 to 4505. [2019-09-08 10:40:30,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4505 states. [2019-09-08 10:40:30,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4505 states to 4505 states and 5834 transitions. [2019-09-08 10:40:30,312 INFO L78 Accepts]: Start accepts. Automaton has 4505 states and 5834 transitions. Word has length 69 [2019-09-08 10:40:30,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:30,314 INFO L475 AbstractCegarLoop]: Abstraction has 4505 states and 5834 transitions. [2019-09-08 10:40:30,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:40:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4505 states and 5834 transitions. [2019-09-08 10:40:30,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:40:30,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:30,332 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:40:30,333 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:30,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:30,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1884466580, now seen corresponding path program 1 times [2019-09-08 10:40:30,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:30,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:30,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:30,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:30,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:30,770 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 10:40:30,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:30,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:40:30,773 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:40:30,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:40:30,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:40:30,774 INFO L87 Difference]: Start difference. First operand 4505 states and 5834 transitions. Second operand 6 states. [2019-09-08 10:40:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:34,337 INFO L93 Difference]: Finished difference Result 9160 states and 11876 transitions. [2019-09-08 10:40:34,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:40:34,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:40:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:34,374 INFO L225 Difference]: With dead ends: 9160 [2019-09-08 10:40:34,374 INFO L226 Difference]: Without dead ends: 5966 [2019-09-08 10:40:34,384 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 10:40:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5966 states. [2019-09-08 10:40:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5966 to 5934. [2019-09-08 10:40:34,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5934 states. [2019-09-08 10:40:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5934 states to 5934 states and 7744 transitions. [2019-09-08 10:40:34,687 INFO L78 Accepts]: Start accepts. Automaton has 5934 states and 7744 transitions. Word has length 70 [2019-09-08 10:40:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:34,688 INFO L475 AbstractCegarLoop]: Abstraction has 5934 states and 7744 transitions. [2019-09-08 10:40:34,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:40:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 5934 states and 7744 transitions. [2019-09-08 10:40:34,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:40:34,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:34,701 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:40:34,702 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:34,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash 353186205, now seen corresponding path program 1 times [2019-09-08 10:40:34,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:34,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:34,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:34,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:34,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:35,008 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 10:40:35,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:35,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:40:35,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:40:35,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:40:35,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:40:35,010 INFO L87 Difference]: Start difference. First operand 5934 states and 7744 transitions. Second operand 6 states. [2019-09-08 10:40:37,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:37,778 INFO L93 Difference]: Finished difference Result 13691 states and 17904 transitions. [2019-09-08 10:40:37,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:40:37,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:40:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:37,829 INFO L225 Difference]: With dead ends: 13691 [2019-09-08 10:40:37,830 INFO L226 Difference]: Without dead ends: 9772 [2019-09-08 10:40:37,842 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 10:40:37,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9772 states. [2019-09-08 10:40:38,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9772 to 9727. [2019-09-08 10:40:38,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9727 states. [2019-09-08 10:40:38,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9727 states to 9727 states and 12757 transitions. [2019-09-08 10:40:38,338 INFO L78 Accepts]: Start accepts. Automaton has 9727 states and 12757 transitions. Word has length 70 [2019-09-08 10:40:38,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:38,339 INFO L475 AbstractCegarLoop]: Abstraction has 9727 states and 12757 transitions. [2019-09-08 10:40:38,339 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:40:38,339 INFO L276 IsEmpty]: Start isEmpty. Operand 9727 states and 12757 transitions. [2019-09-08 10:40:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:40:38,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:38,350 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:40:38,351 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:38,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:38,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1292285136, now seen corresponding path program 1 times [2019-09-08 10:40:38,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:38,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:38,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:38,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:38,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:38,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:40:38,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:38,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:40:38,623 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:40:38,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:40:38,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:40:38,624 INFO L87 Difference]: Start difference. First operand 9727 states and 12757 transitions. Second operand 6 states. [2019-09-08 10:40:41,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:41,199 INFO L93 Difference]: Finished difference Result 22510 states and 30041 transitions. [2019-09-08 10:40:41,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:40:41,199 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-09-08 10:40:41,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:41,266 INFO L225 Difference]: With dead ends: 22510 [2019-09-08 10:40:41,267 INFO L226 Difference]: Without dead ends: 16122 [2019-09-08 10:40:41,289 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 10:40:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16122 states. [2019-09-08 10:40:41,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16122 to 16072. [2019-09-08 10:40:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16072 states. [2019-09-08 10:40:41,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16072 states to 16072 states and 21477 transitions. [2019-09-08 10:40:41,913 INFO L78 Accepts]: Start accepts. Automaton has 16072 states and 21477 transitions. Word has length 71 [2019-09-08 10:40:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:41,915 INFO L475 AbstractCegarLoop]: Abstraction has 16072 states and 21477 transitions. [2019-09-08 10:40:41,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:40:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 16072 states and 21477 transitions. [2019-09-08 10:40:41,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:40:41,926 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:41,927 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:40:41,927 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:41,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:41,928 INFO L82 PathProgramCache]: Analyzing trace with hash 77939992, now seen corresponding path program 1 times [2019-09-08 10:40:41,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:41,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:41,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:41,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:41,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:42,280 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 10:40:42,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:42,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:40:42,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:40:42,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:40:42,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:40:42,282 INFO L87 Difference]: Start difference. First operand 16072 states and 21477 transitions. Second operand 9 states. [2019-09-08 10:40:51,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:51,186 INFO L93 Difference]: Finished difference Result 48148 states and 67965 transitions. [2019-09-08 10:40:51,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:40:51,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 10:40:51,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:51,296 INFO L225 Difference]: With dead ends: 48148 [2019-09-08 10:40:51,296 INFO L226 Difference]: Without dead ends: 43895 [2019-09-08 10:40:51,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:40:51,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43895 states. [2019-09-08 10:40:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43895 to 15983. [2019-09-08 10:40:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15983 states. [2019-09-08 10:40:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15983 states to 15983 states and 21356 transitions. [2019-09-08 10:40:52,383 INFO L78 Accepts]: Start accepts. Automaton has 15983 states and 21356 transitions. Word has length 72 [2019-09-08 10:40:52,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:40:52,384 INFO L475 AbstractCegarLoop]: Abstraction has 15983 states and 21356 transitions. [2019-09-08 10:40:52,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:40:52,384 INFO L276 IsEmpty]: Start isEmpty. Operand 15983 states and 21356 transitions. [2019-09-08 10:40:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 10:40:52,395 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:40:52,395 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:40:52,396 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:40:52,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:40:52,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1490375194, now seen corresponding path program 1 times [2019-09-08 10:40:52,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:40:52,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:40:52,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:52,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:40:52,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:40:52,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:40:52,709 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 10:40:52,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:40:52,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:40:52,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:40:52,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:40:52,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:40:52,710 INFO L87 Difference]: Start difference. First operand 15983 states and 21356 transitions. Second operand 8 states. [2019-09-08 10:40:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:40:58,940 INFO L93 Difference]: Finished difference Result 40767 states and 59047 transitions. [2019-09-08 10:40:58,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:40:58,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-09-08 10:40:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:40:59,020 INFO L225 Difference]: With dead ends: 40767 [2019-09-08 10:40:59,020 INFO L226 Difference]: Without dead ends: 36291 [2019-09-08 10:40:59,039 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:40:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36291 states. [2019-09-08 10:41:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36291 to 15710. [2019-09-08 10:41:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15710 states. [2019-09-08 10:41:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15710 states to 15710 states and 20999 transitions. [2019-09-08 10:41:00,032 INFO L78 Accepts]: Start accepts. Automaton has 15710 states and 20999 transitions. Word has length 72 [2019-09-08 10:41:00,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:00,033 INFO L475 AbstractCegarLoop]: Abstraction has 15710 states and 20999 transitions. [2019-09-08 10:41:00,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:41:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states and 20999 transitions. [2019-09-08 10:41:00,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:41:00,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:00,043 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:00,043 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:00,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:00,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2027444782, now seen corresponding path program 1 times [2019-09-08 10:41:00,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:00,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:00,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:00,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:00,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:00,353 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 10:41:00,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:00,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:41:00,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:41:00,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:41:00,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:41:00,355 INFO L87 Difference]: Start difference. First operand 15710 states and 20999 transitions. Second operand 9 states. [2019-09-08 10:41:06,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:06,211 INFO L93 Difference]: Finished difference Result 21318 states and 29442 transitions. [2019-09-08 10:41:06,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 10:41:06,212 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 10:41:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:06,246 INFO L225 Difference]: With dead ends: 21318 [2019-09-08 10:41:06,246 INFO L226 Difference]: Without dead ends: 21312 [2019-09-08 10:41:06,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2019-09-08 10:41:06,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21312 states. [2019-09-08 10:41:06,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21312 to 15710. [2019-09-08 10:41:06,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15710 states. [2019-09-08 10:41:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15710 states to 15710 states and 20998 transitions. [2019-09-08 10:41:08,106 INFO L78 Accepts]: Start accepts. Automaton has 15710 states and 20998 transitions. Word has length 73 [2019-09-08 10:41:08,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:08,107 INFO L475 AbstractCegarLoop]: Abstraction has 15710 states and 20998 transitions. [2019-09-08 10:41:08,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:41:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states and 20998 transitions. [2019-09-08 10:41:08,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:41:08,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:08,116 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:08,116 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:08,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:08,117 INFO L82 PathProgramCache]: Analyzing trace with hash 233124012, now seen corresponding path program 1 times [2019-09-08 10:41:08,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:08,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:08,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:08,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:08,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:08,364 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 10:41:08,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:08,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:41:08,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:41:08,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:41:08,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:41:08,367 INFO L87 Difference]: Start difference. First operand 15710 states and 20998 transitions. Second operand 9 states. [2019-09-08 10:41:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:14,264 INFO L93 Difference]: Finished difference Result 24326 states and 33935 transitions. [2019-09-08 10:41:14,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:41:14,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-09-08 10:41:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:14,296 INFO L225 Difference]: With dead ends: 24326 [2019-09-08 10:41:14,297 INFO L226 Difference]: Without dead ends: 24317 [2019-09-08 10:41:14,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2019-09-08 10:41:14,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24317 states. [2019-09-08 10:41:14,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24317 to 15710. [2019-09-08 10:41:14,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15710 states. [2019-09-08 10:41:15,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15710 states to 15710 states and 20997 transitions. [2019-09-08 10:41:15,001 INFO L78 Accepts]: Start accepts. Automaton has 15710 states and 20997 transitions. Word has length 73 [2019-09-08 10:41:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:15,001 INFO L475 AbstractCegarLoop]: Abstraction has 15710 states and 20997 transitions. [2019-09-08 10:41:15,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:41:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 15710 states and 20997 transitions. [2019-09-08 10:41:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:41:15,012 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:15,013 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:15,013 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:15,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:15,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2061206434, now seen corresponding path program 1 times [2019-09-08 10:41:15,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:15,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:15,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:15,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:15,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:15,592 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 10:41:15,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:15,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 10:41:15,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 10:41:15,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 10:41:15,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 10:41:15,594 INFO L87 Difference]: Start difference. First operand 15710 states and 20997 transitions. Second operand 13 states. [2019-09-08 10:41:16,250 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2019-09-08 10:41:16,453 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 10:41:16,720 WARN L188 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 10:41:18,385 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 10:41:19,131 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 10:41:19,617 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-09-08 10:41:25,851 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-09-08 10:41:26,536 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-09-08 10:41:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:32,812 INFO L93 Difference]: Finished difference Result 89814 states and 132877 transitions. [2019-09-08 10:41:32,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 10:41:32,813 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2019-09-08 10:41:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:32,922 INFO L225 Difference]: With dead ends: 89814 [2019-09-08 10:41:32,922 INFO L226 Difference]: Without dead ends: 89810 [2019-09-08 10:41:32,944 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=605, Invalid=2047, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 10:41:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89810 states. [2019-09-08 10:41:35,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89810 to 15706. [2019-09-08 10:41:35,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15706 states. [2019-09-08 10:41:35,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15706 states to 15706 states and 20993 transitions. [2019-09-08 10:41:35,624 INFO L78 Accepts]: Start accepts. Automaton has 15706 states and 20993 transitions. Word has length 73 [2019-09-08 10:41:35,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:35,625 INFO L475 AbstractCegarLoop]: Abstraction has 15706 states and 20993 transitions. [2019-09-08 10:41:35,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 10:41:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 15706 states and 20993 transitions. [2019-09-08 10:41:35,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 10:41:35,631 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:35,631 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:41:35,632 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:35,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:35,632 INFO L82 PathProgramCache]: Analyzing trace with hash -993343041, now seen corresponding path program 1 times [2019-09-08 10:41:35,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:35,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:35,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:35,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:36,141 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 10:41:36,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:36,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:41:36,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:41:36,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:41:36,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:41:36,143 INFO L87 Difference]: Start difference. First operand 15706 states and 20993 transitions. Second operand 12 states. [2019-09-08 10:41:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:41:46,494 INFO L93 Difference]: Finished difference Result 61476 states and 90427 transitions. [2019-09-08 10:41:46,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:41:46,494 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2019-09-08 10:41:46,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:41:46,557 INFO L225 Difference]: With dead ends: 61476 [2019-09-08 10:41:46,558 INFO L226 Difference]: Without dead ends: 57224 [2019-09-08 10:41:46,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:41:46,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57224 states. [2019-09-08 10:41:48,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57224 to 15614. [2019-09-08 10:41:48,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15614 states. [2019-09-08 10:41:48,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15614 states to 15614 states and 20864 transitions. [2019-09-08 10:41:48,240 INFO L78 Accepts]: Start accepts. Automaton has 15614 states and 20864 transitions. Word has length 73 [2019-09-08 10:41:48,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:41:48,240 INFO L475 AbstractCegarLoop]: Abstraction has 15614 states and 20864 transitions. [2019-09-08 10:41:48,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:41:48,240 INFO L276 IsEmpty]: Start isEmpty. Operand 15614 states and 20864 transitions. [2019-09-08 10:41:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:41:48,247 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:41:48,247 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] [2019-09-08 10:41:48,248 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:41:48,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:41:48,248 INFO L82 PathProgramCache]: Analyzing trace with hash -20725892, now seen corresponding path program 1 times [2019-09-08 10:41:48,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:41:48,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:41:48,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:48,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:41:48,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:41:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:41:48,860 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 10:41:48,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:41:48,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:41:48,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:41:48,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:41:48,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:41:48,862 INFO L87 Difference]: Start difference. First operand 15614 states and 20864 transitions. Second operand 12 states. [2019-09-08 10:42:01,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:01,515 INFO L93 Difference]: Finished difference Result 61646 states and 90654 transitions. [2019-09-08 10:42:01,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:42:01,515 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2019-09-08 10:42:01,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:01,577 INFO L225 Difference]: With dead ends: 61646 [2019-09-08 10:42:01,577 INFO L226 Difference]: Without dead ends: 61637 [2019-09-08 10:42:01,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:42:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61637 states. [2019-09-08 10:42:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61637 to 15605. [2019-09-08 10:42:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15605 states. [2019-09-08 10:42:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15605 states to 15605 states and 20854 transitions. [2019-09-08 10:42:03,299 INFO L78 Accepts]: Start accepts. Automaton has 15605 states and 20854 transitions. Word has length 74 [2019-09-08 10:42:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:03,299 INFO L475 AbstractCegarLoop]: Abstraction has 15605 states and 20854 transitions. [2019-09-08 10:42:03,299 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:42:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 15605 states and 20854 transitions. [2019-09-08 10:42:03,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:42:03,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:03,306 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] [2019-09-08 10:42:03,307 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:03,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:03,307 INFO L82 PathProgramCache]: Analyzing trace with hash 538122635, now seen corresponding path program 1 times [2019-09-08 10:42:03,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:03,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:03,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:03,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:03,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:03,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:03,811 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 10:42:03,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:03,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 10:42:03,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 10:42:03,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 10:42:03,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:42:03,813 INFO L87 Difference]: Start difference. First operand 15605 states and 20854 transitions. Second operand 10 states. [2019-09-08 10:42:19,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:19,153 INFO L93 Difference]: Finished difference Result 70226 states and 103616 transitions. [2019-09-08 10:42:19,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:42:19,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 74 [2019-09-08 10:42:19,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:19,222 INFO L225 Difference]: With dead ends: 70226 [2019-09-08 10:42:19,222 INFO L226 Difference]: Without dead ends: 65858 [2019-09-08 10:42:19,238 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2019-09-08 10:42:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65858 states. [2019-09-08 10:42:21,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65858 to 15552. [2019-09-08 10:42:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15552 states. [2019-09-08 10:42:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15552 states to 15552 states and 20793 transitions. [2019-09-08 10:42:21,405 INFO L78 Accepts]: Start accepts. Automaton has 15552 states and 20793 transitions. Word has length 74 [2019-09-08 10:42:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:21,406 INFO L475 AbstractCegarLoop]: Abstraction has 15552 states and 20793 transitions. [2019-09-08 10:42:21,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 10:42:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 15552 states and 20793 transitions. [2019-09-08 10:42:21,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 10:42:21,413 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:21,413 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] [2019-09-08 10:42:21,413 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:21,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:21,414 INFO L82 PathProgramCache]: Analyzing trace with hash -150966617, now seen corresponding path program 1 times [2019-09-08 10:42:21,414 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:21,414 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:21,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:21,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:21,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:21,567 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 10:42:21,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:21,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:42:21,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:42:21,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:42:21,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:42:21,568 INFO L87 Difference]: Start difference. First operand 15552 states and 20793 transitions. Second operand 3 states. [2019-09-08 10:42:24,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:24,214 INFO L93 Difference]: Finished difference Result 23761 states and 32934 transitions. [2019-09-08 10:42:24,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:42:24,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 10:42:24,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:24,228 INFO L225 Difference]: With dead ends: 23761 [2019-09-08 10:42:24,228 INFO L226 Difference]: Without dead ends: 14591 [2019-09-08 10:42:24,238 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 10:42:24,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14591 states. [2019-09-08 10:42:26,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14591 to 14572. [2019-09-08 10:42:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14572 states. [2019-09-08 10:42:26,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 20152 transitions. [2019-09-08 10:42:26,318 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 20152 transitions. Word has length 74 [2019-09-08 10:42:26,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:26,319 INFO L475 AbstractCegarLoop]: Abstraction has 14572 states and 20152 transitions. [2019-09-08 10:42:26,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:42:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 20152 transitions. [2019-09-08 10:42:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:42:26,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:26,324 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] [2019-09-08 10:42:26,325 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:26,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:26,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2076823766, now seen corresponding path program 1 times [2019-09-08 10:42:26,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:26,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:26,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:26,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:26,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:26,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:26,543 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 10:42:26,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:26,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:42:26,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:42:26,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:42:26,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:42:26,544 INFO L87 Difference]: Start difference. First operand 14572 states and 20152 transitions. Second operand 9 states. [2019-09-08 10:42:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:42:44,760 INFO L93 Difference]: Finished difference Result 62665 states and 90778 transitions. [2019-09-08 10:42:44,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:42:44,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:42:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:42:44,821 INFO L225 Difference]: With dead ends: 62665 [2019-09-08 10:42:44,821 INFO L226 Difference]: Without dead ends: 55347 [2019-09-08 10:42:44,838 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:42:44,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55347 states. [2019-09-08 10:42:47,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55347 to 14572. [2019-09-08 10:42:47,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14572 states. [2019-09-08 10:42:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 20150 transitions. [2019-09-08 10:42:47,394 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 20150 transitions. Word has length 75 [2019-09-08 10:42:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:42:47,394 INFO L475 AbstractCegarLoop]: Abstraction has 14572 states and 20150 transitions. [2019-09-08 10:42:47,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:42:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 20150 transitions. [2019-09-08 10:42:47,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:42:47,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:42:47,400 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] [2019-09-08 10:42:47,400 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:42:47,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:42:47,401 INFO L82 PathProgramCache]: Analyzing trace with hash -68973770, now seen corresponding path program 1 times [2019-09-08 10:42:47,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:42:47,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:42:47,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:47,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:42:47,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:42:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:42:47,631 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 10:42:47,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:42:47,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:42:47,632 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:42:47,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:42:47,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:42:47,633 INFO L87 Difference]: Start difference. First operand 14572 states and 20150 transitions. Second operand 8 states. [2019-09-08 10:43:01,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:01,652 INFO L93 Difference]: Finished difference Result 56106 states and 83051 transitions. [2019-09-08 10:43:01,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:43:01,653 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 75 [2019-09-08 10:43:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:01,699 INFO L225 Difference]: With dead ends: 56106 [2019-09-08 10:43:01,699 INFO L226 Difference]: Without dead ends: 48436 [2019-09-08 10:43:01,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:43:01,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48436 states. [2019-09-08 10:43:04,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48436 to 14572. [2019-09-08 10:43:04,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14572 states. [2019-09-08 10:43:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 20149 transitions. [2019-09-08 10:43:04,362 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 20149 transitions. Word has length 75 [2019-09-08 10:43:04,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:04,363 INFO L475 AbstractCegarLoop]: Abstraction has 14572 states and 20149 transitions. [2019-09-08 10:43:04,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:43:04,363 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 20149 transitions. [2019-09-08 10:43:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:43:04,368 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:04,368 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] [2019-09-08 10:43:04,368 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:04,369 INFO L82 PathProgramCache]: Analyzing trace with hash 537217189, now seen corresponding path program 1 times [2019-09-08 10:43:04,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:04,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:04,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:04,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:04,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:04,569 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 10:43:04,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:04,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:43:04,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:43:04,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:43:04,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:43:04,571 INFO L87 Difference]: Start difference. First operand 14572 states and 20149 transitions. Second operand 9 states. [2019-09-08 10:43:22,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:22,958 INFO L93 Difference]: Finished difference Result 61445 states and 89250 transitions. [2019-09-08 10:43:22,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:43:22,958 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:43:22,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:23,034 INFO L225 Difference]: With dead ends: 61445 [2019-09-08 10:43:23,034 INFO L226 Difference]: Without dead ends: 54477 [2019-09-08 10:43:23,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:43:23,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54477 states. [2019-09-08 10:43:25,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54477 to 14572. [2019-09-08 10:43:25,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14572 states. [2019-09-08 10:43:25,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 20148 transitions. [2019-09-08 10:43:25,837 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 20148 transitions. Word has length 75 [2019-09-08 10:43:25,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:25,838 INFO L475 AbstractCegarLoop]: Abstraction has 14572 states and 20148 transitions. [2019-09-08 10:43:25,838 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:43:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 20148 transitions. [2019-09-08 10:43:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:43:25,843 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:25,843 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] [2019-09-08 10:43:25,843 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash 886824694, now seen corresponding path program 1 times [2019-09-08 10:43:25,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:25,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:25,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:25,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:25,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:26,064 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 10:43:26,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:26,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:43:26,065 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:43:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:43:26,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:43:26,066 INFO L87 Difference]: Start difference. First operand 14572 states and 20148 transitions. Second operand 9 states. [2019-09-08 10:43:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:43,206 INFO L93 Difference]: Finished difference Result 55888 states and 82657 transitions. [2019-09-08 10:43:43,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 10:43:43,207 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 10:43:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:43,259 INFO L225 Difference]: With dead ends: 55888 [2019-09-08 10:43:43,259 INFO L226 Difference]: Without dead ends: 49007 [2019-09-08 10:43:43,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2019-09-08 10:43:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49007 states. [2019-09-08 10:43:46,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49007 to 14572. [2019-09-08 10:43:46,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14572 states. [2019-09-08 10:43:46,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14572 states to 14572 states and 20147 transitions. [2019-09-08 10:43:46,064 INFO L78 Accepts]: Start accepts. Automaton has 14572 states and 20147 transitions. Word has length 75 [2019-09-08 10:43:46,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:46,065 INFO L475 AbstractCegarLoop]: Abstraction has 14572 states and 20147 transitions. [2019-09-08 10:43:46,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:43:46,065 INFO L276 IsEmpty]: Start isEmpty. Operand 14572 states and 20147 transitions. [2019-09-08 10:43:46,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 10:43:46,069 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:46,069 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] [2019-09-08 10:43:46,070 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:46,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:46,070 INFO L82 PathProgramCache]: Analyzing trace with hash -553258111, now seen corresponding path program 1 times [2019-09-08 10:43:46,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:46,071 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:46,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:46,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:46,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:46,193 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 10:43:46,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:46,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:43:46,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:43:46,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:43:46,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:43:46,195 INFO L87 Difference]: Start difference. First operand 14572 states and 20147 transitions. Second operand 3 states. [2019-09-08 10:43:50,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:43:50,091 INFO L93 Difference]: Finished difference Result 27365 states and 39133 transitions. [2019-09-08 10:43:50,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:43:50,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-09-08 10:43:50,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:43:50,108 INFO L225 Difference]: With dead ends: 27365 [2019-09-08 10:43:50,108 INFO L226 Difference]: Without dead ends: 16786 [2019-09-08 10:43:50,118 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 10:43:50,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16786 states. [2019-09-08 10:43:53,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16786 to 16778. [2019-09-08 10:43:53,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16778 states. [2019-09-08 10:43:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16778 states to 16778 states and 23970 transitions. [2019-09-08 10:43:53,764 INFO L78 Accepts]: Start accepts. Automaton has 16778 states and 23970 transitions. Word has length 75 [2019-09-08 10:43:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:43:53,765 INFO L475 AbstractCegarLoop]: Abstraction has 16778 states and 23970 transitions. [2019-09-08 10:43:53,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:43:53,765 INFO L276 IsEmpty]: Start isEmpty. Operand 16778 states and 23970 transitions. [2019-09-08 10:43:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:43:53,769 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:43:53,769 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:43:53,769 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:43:53,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:43:53,769 INFO L82 PathProgramCache]: Analyzing trace with hash -2136318529, now seen corresponding path program 1 times [2019-09-08 10:43:53,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:43:53,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:43:53,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:53,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:43:53,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:43:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:43:53,914 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 10:43:53,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:43:53,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:43:53,915 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:43:53,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:43:53,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:43:53,915 INFO L87 Difference]: Start difference. First operand 16778 states and 23970 transitions. Second operand 3 states. [2019-09-08 10:44:01,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:01,040 INFO L93 Difference]: Finished difference Result 41499 states and 60238 transitions. [2019-09-08 10:44:01,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:44:01,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:44:01,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:01,070 INFO L225 Difference]: With dead ends: 41499 [2019-09-08 10:44:01,070 INFO L226 Difference]: Without dead ends: 28215 [2019-09-08 10:44:01,082 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 10:44:01,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28215 states. [2019-09-08 10:44:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28215 to 28207. [2019-09-08 10:44:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28207 states. [2019-09-08 10:44:07,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28207 states to 28207 states and 40128 transitions. [2019-09-08 10:44:07,946 INFO L78 Accepts]: Start accepts. Automaton has 28207 states and 40128 transitions. Word has length 76 [2019-09-08 10:44:07,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:07,946 INFO L475 AbstractCegarLoop]: Abstraction has 28207 states and 40128 transitions. [2019-09-08 10:44:07,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:44:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 28207 states and 40128 transitions. [2019-09-08 10:44:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:44:07,951 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:07,951 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] [2019-09-08 10:44:07,951 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:07,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:07,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1610299721, now seen corresponding path program 1 times [2019-09-08 10:44:07,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:07,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:07,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:07,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:07,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:08,077 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 10:44:08,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:08,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:44:08,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:44:08,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:44:08,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:44:08,078 INFO L87 Difference]: Start difference. First operand 28207 states and 40128 transitions. Second operand 3 states. [2019-09-08 10:44:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:21,005 INFO L93 Difference]: Finished difference Result 70107 states and 101927 transitions. [2019-09-08 10:44:21,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:44:21,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:44:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:21,050 INFO L225 Difference]: With dead ends: 70107 [2019-09-08 10:44:21,050 INFO L226 Difference]: Without dead ends: 47835 [2019-09-08 10:44:21,071 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 10:44:21,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47835 states. [2019-09-08 10:44:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47835 to 41109. [2019-09-08 10:44:33,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41109 states. [2019-09-08 10:44:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41109 states to 41109 states and 58436 transitions. [2019-09-08 10:44:34,042 INFO L78 Accepts]: Start accepts. Automaton has 41109 states and 58436 transitions. Word has length 76 [2019-09-08 10:44:34,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:44:34,042 INFO L475 AbstractCegarLoop]: Abstraction has 41109 states and 58436 transitions. [2019-09-08 10:44:34,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:44:34,042 INFO L276 IsEmpty]: Start isEmpty. Operand 41109 states and 58436 transitions. [2019-09-08 10:44:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 10:44:34,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:44:34,047 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] [2019-09-08 10:44:34,047 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:44:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:44:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1479085215, now seen corresponding path program 1 times [2019-09-08 10:44:34,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:44:34,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:44:34,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:34,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:44:34,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:44:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:44:34,174 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 10:44:34,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:44:34,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:44:34,175 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:44:34,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:44:34,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:44:34,176 INFO L87 Difference]: Start difference. First operand 41109 states and 58436 transitions. Second operand 3 states. [2019-09-08 10:44:55,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:44:55,941 INFO L93 Difference]: Finished difference Result 102219 states and 148741 transitions. [2019-09-08 10:44:55,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:44:55,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 10:44:55,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:44:56,013 INFO L225 Difference]: With dead ends: 102219 [2019-09-08 10:44:56,013 INFO L226 Difference]: Without dead ends: 68387 [2019-09-08 10:44:56,038 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 10:44:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68387 states. [2019-09-08 10:45:14,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68387 to 49295. [2019-09-08 10:45:14,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49295 states. [2019-09-08 10:45:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49295 states to 49295 states and 70175 transitions. [2019-09-08 10:45:14,439 INFO L78 Accepts]: Start accepts. Automaton has 49295 states and 70175 transitions. Word has length 76 [2019-09-08 10:45:14,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:45:14,440 INFO L475 AbstractCegarLoop]: Abstraction has 49295 states and 70175 transitions. [2019-09-08 10:45:14,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:45:14,440 INFO L276 IsEmpty]: Start isEmpty. Operand 49295 states and 70175 transitions. [2019-09-08 10:45:14,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:45:14,445 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:45:14,445 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:45:14,445 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:45:14,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:45:14,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1487016584, now seen corresponding path program 1 times [2019-09-08 10:45:14,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:45:14,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:45:14,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:14,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:45:14,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:45:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:45:14,689 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 10:45:14,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:45:14,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:45:14,690 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:45:14,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:45:14,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:45:14,690 INFO L87 Difference]: Start difference. First operand 49295 states and 70175 transitions. Second operand 9 states. [2019-09-08 10:46:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:04,007 INFO L93 Difference]: Finished difference Result 114267 states and 164467 transitions. [2019-09-08 10:46:04,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:46:04,010 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 77 [2019-09-08 10:46:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:04,131 INFO L225 Difference]: With dead ends: 114267 [2019-09-08 10:46:04,132 INFO L226 Difference]: Without dead ends: 111668 [2019-09-08 10:46:04,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:46:04,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111668 states. [2019-09-08 10:46:23,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111668 to 49290. [2019-09-08 10:46:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49290 states. [2019-09-08 10:46:23,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49290 states to 49290 states and 70166 transitions. [2019-09-08 10:46:23,523 INFO L78 Accepts]: Start accepts. Automaton has 49290 states and 70166 transitions. Word has length 77 [2019-09-08 10:46:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:46:23,523 INFO L475 AbstractCegarLoop]: Abstraction has 49290 states and 70166 transitions. [2019-09-08 10:46:23,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:46:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 49290 states and 70166 transitions. [2019-09-08 10:46:23,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:46:23,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:46:23,529 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:46:23,529 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:46:23,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:46:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash -622390050, now seen corresponding path program 1 times [2019-09-08 10:46:23,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:46:23,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:46:23,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:23,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:46:23,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:46:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:46:23,641 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 10:46:23,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:46:23,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:46:23,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:46:23,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:46:23,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:46:23,642 INFO L87 Difference]: Start difference. First operand 49290 states and 70166 transitions. Second operand 3 states. [2019-09-08 10:46:57,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:46:57,291 INFO L93 Difference]: Finished difference Result 127254 states and 183619 transitions. [2019-09-08 10:46:57,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:46:57,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 10:46:57,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:46:57,379 INFO L225 Difference]: With dead ends: 127254 [2019-09-08 10:46:57,379 INFO L226 Difference]: Without dead ends: 80199 [2019-09-08 10:46:57,411 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 10:46:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80199 states. [2019-09-08 10:47:20,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80199 to 62679. [2019-09-08 10:47:20,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62679 states. [2019-09-08 10:47:20,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62679 states to 62679 states and 90286 transitions. [2019-09-08 10:47:20,216 INFO L78 Accepts]: Start accepts. Automaton has 62679 states and 90286 transitions. Word has length 77 [2019-09-08 10:47:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:47:20,217 INFO L475 AbstractCegarLoop]: Abstraction has 62679 states and 90286 transitions. [2019-09-08 10:47:20,217 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:47:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 62679 states and 90286 transitions. [2019-09-08 10:47:20,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 10:47:20,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:47:20,221 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:47:20,222 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:47:20,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:47:20,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1208905319, now seen corresponding path program 1 times [2019-09-08 10:47:20,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:47:20,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:47:20,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:20,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:47:20,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:47:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:47:20,321 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 10:47:20,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:47:20,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:47:20,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:47:20,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:47:20,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:47:20,323 INFO L87 Difference]: Start difference. First operand 62679 states and 90286 transitions. Second operand 3 states. [2019-09-08 10:47:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:47:51,285 INFO L93 Difference]: Finished difference Result 136004 states and 196766 transitions. [2019-09-08 10:47:51,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:47:51,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 10:47:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:47:51,365 INFO L225 Difference]: With dead ends: 136004 [2019-09-08 10:47:51,365 INFO L226 Difference]: Without dead ends: 74713 [2019-09-08 10:47:51,402 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 10:47:51,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74713 states. [2019-09-08 10:48:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74713 to 59880. [2019-09-08 10:48:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59880 states. [2019-09-08 10:48:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59880 states to 59880 states and 86575 transitions. [2019-09-08 10:48:13,904 INFO L78 Accepts]: Start accepts. Automaton has 59880 states and 86575 transitions. Word has length 77 [2019-09-08 10:48:13,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:48:13,904 INFO L475 AbstractCegarLoop]: Abstraction has 59880 states and 86575 transitions. [2019-09-08 10:48:13,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:48:13,905 INFO L276 IsEmpty]: Start isEmpty. Operand 59880 states and 86575 transitions. [2019-09-08 10:48:13,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:48:13,907 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:48:13,908 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:48:13,908 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:48:13,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:48:13,908 INFO L82 PathProgramCache]: Analyzing trace with hash 623453508, now seen corresponding path program 1 times [2019-09-08 10:48:13,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:48:13,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:48:13,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:13,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:48:13,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:48:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:48:14,119 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 10:48:14,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:48:14,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:48:14,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:48:14,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:48:14,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:48:14,120 INFO L87 Difference]: Start difference. First operand 59880 states and 86575 transitions. Second operand 9 states. [2019-09-08 10:49:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:49:17,543 INFO L93 Difference]: Finished difference Result 144390 states and 209184 transitions. [2019-09-08 10:49:17,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:49:17,543 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-08 10:49:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:49:17,704 INFO L225 Difference]: With dead ends: 144390 [2019-09-08 10:49:17,705 INFO L226 Difference]: Without dead ends: 141742 [2019-09-08 10:49:17,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:49:17,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141742 states. [2019-09-08 10:49:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141742 to 59880. [2019-09-08 10:49:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59880 states. [2019-09-08 10:49:40,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59880 states to 59880 states and 86573 transitions. [2019-09-08 10:49:40,999 INFO L78 Accepts]: Start accepts. Automaton has 59880 states and 86573 transitions. Word has length 78 [2019-09-08 10:49:40,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:49:40,999 INFO L475 AbstractCegarLoop]: Abstraction has 59880 states and 86573 transitions. [2019-09-08 10:49:40,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:49:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 59880 states and 86573 transitions. [2019-09-08 10:49:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:49:41,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:49:41,002 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:49:41,002 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:49:41,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:49:41,003 INFO L82 PathProgramCache]: Analyzing trace with hash 858175544, now seen corresponding path program 1 times [2019-09-08 10:49:41,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:49:41,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:49:41,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:41,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:49:41,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:49:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:49:41,312 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-09-08 10:49:41,376 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 10:49:41,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:49:41,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:49:41,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:49:41,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:49:41,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:49:41,378 INFO L87 Difference]: Start difference. First operand 59880 states and 86573 transitions. Second operand 9 states. [2019-09-08 10:50:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:50:45,563 INFO L93 Difference]: Finished difference Result 144330 states and 209114 transitions. [2019-09-08 10:50:45,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:50:45,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-08 10:50:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:50:45,726 INFO L225 Difference]: With dead ends: 144330 [2019-09-08 10:50:45,727 INFO L226 Difference]: Without dead ends: 141726 [2019-09-08 10:50:45,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:50:45,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141726 states. [2019-09-08 10:51:11,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141726 to 59880. [2019-09-08 10:51:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59880 states. [2019-09-08 10:51:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59880 states to 59880 states and 86571 transitions. [2019-09-08 10:51:11,404 INFO L78 Accepts]: Start accepts. Automaton has 59880 states and 86571 transitions. Word has length 78 [2019-09-08 10:51:11,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:51:11,405 INFO L475 AbstractCegarLoop]: Abstraction has 59880 states and 86571 transitions. [2019-09-08 10:51:11,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:51:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand 59880 states and 86571 transitions. [2019-09-08 10:51:11,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:51:11,407 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:51:11,407 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:51:11,408 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:51:11,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:51:11,408 INFO L82 PathProgramCache]: Analyzing trace with hash 138734116, now seen corresponding path program 1 times [2019-09-08 10:51:11,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:51:11,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:51:11,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:11,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:51:11,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:51:11,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:51:11,599 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 10:51:11,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:51:11,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:51:11,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:51:11,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:51:11,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:51:11,601 INFO L87 Difference]: Start difference. First operand 59880 states and 86571 transitions. Second operand 9 states. [2019-09-08 10:52:16,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:52:16,266 INFO L93 Difference]: Finished difference Result 144330 states and 209112 transitions. [2019-09-08 10:52:16,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 10:52:16,266 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2019-09-08 10:52:16,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:52:16,419 INFO L225 Difference]: With dead ends: 144330 [2019-09-08 10:52:16,420 INFO L226 Difference]: Without dead ends: 141726 [2019-09-08 10:52:16,443 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 10:52:16,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141726 states. [2019-09-08 10:52:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141726 to 59880. [2019-09-08 10:52:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59880 states. [2019-09-08 10:52:42,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59880 states to 59880 states and 86569 transitions. [2019-09-08 10:52:42,069 INFO L78 Accepts]: Start accepts. Automaton has 59880 states and 86569 transitions. Word has length 78 [2019-09-08 10:52:42,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:52:42,070 INFO L475 AbstractCegarLoop]: Abstraction has 59880 states and 86569 transitions. [2019-09-08 10:52:42,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:52:42,070 INFO L276 IsEmpty]: Start isEmpty. Operand 59880 states and 86569 transitions. [2019-09-08 10:52:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 10:52:42,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:52:42,072 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:52:42,073 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:52:42,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:52:42,073 INFO L82 PathProgramCache]: Analyzing trace with hash 960156932, now seen corresponding path program 1 times [2019-09-08 10:52:42,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:52:42,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:52:42,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:42,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:52:42,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:52:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:52:42,265 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 10:52:42,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:52:42,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:52:42,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:52:42,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:52:42,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:52:42,267 INFO L87 Difference]: Start difference. First operand 59880 states and 86569 transitions. Second operand 9 states.