/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:34:04,062 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:34:04,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:34:04,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:34:04,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:34:04,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:34:04,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:34:04,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:34:04,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:34:04,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:34:04,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:34:04,085 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:34:04,085 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:34:04,087 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:34:04,088 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:34:04,089 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:34:04,089 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:34:04,090 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:34:04,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:34:04,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:34:04,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:34:04,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:34:04,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:34:04,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:34:04,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:34:04,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:34:04,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:34:04,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:34:04,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:34:04,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:34:04,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:34:04,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:34:04,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:34:04,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:34:04,117 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:34:04,117 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:34:04,118 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:34:04,118 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:34:04,118 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:34:04,119 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:34:04,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:34:04,124 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-11-23 22:34:04,144 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:34:04,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:34:04,147 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:34:04,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:34:04,147 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:34:04,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:34:04,148 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:34:04,148 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:34:04,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:34:04,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:34:04,149 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:34:04,149 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:34:04,150 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:34:04,150 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:34:04,150 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:34:04,150 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:34:04,151 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:34:04,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:34:04,151 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:34:04,151 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:34:04,152 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:34:04,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:34:04,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:34:04,152 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:34:04,152 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:34:04,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:34:04,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:34:04,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:34:04,153 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:34:04,153 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:34:04,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:34:04,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:34:04,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:34:04,431 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:34:04,432 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:34:04,433 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.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-23 22:34:04,501 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab3ecdb3/c02d7c7556e94b5fb90e26d04bde5c7e/FLAGee510c569 [2019-11-23 22:34:05,242 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:34:05,243 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-23 22:34:05,271 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab3ecdb3/c02d7c7556e94b5fb90e26d04bde5c7e/FLAGee510c569 [2019-11-23 22:34:05,376 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab3ecdb3/c02d7c7556e94b5fb90e26d04bde5c7e [2019-11-23 22:34:05,386 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:34:05,389 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:34:05,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:34:05,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:34:05,397 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:34:05,398 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:05" (1/1) ... [2019-11-23 22:34:05,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@378fd7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:05, skipping insertion in model container [2019-11-23 22:34:05,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:34:05" (1/1) ... [2019-11-23 22:34:05,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:34:05,556 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:34:06,537 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:34:06,552 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:34:06,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:34:06,877 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:34:06,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:06 WrapperNode [2019-11-23 22:34:06,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:34:06,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:34:06,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:34:06,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:34:06,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:06" (1/1) ... [2019-11-23 22:34:06,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:06" (1/1) ... [2019-11-23 22:34:07,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:34:07,048 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:34:07,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:34:07,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:34:07,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:06" (1/1) ... [2019-11-23 22:34:07,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:06" (1/1) ... [2019-11-23 22:34:07,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:06" (1/1) ... [2019-11-23 22:34:07,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:06" (1/1) ... [2019-11-23 22:34:07,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:06" (1/1) ... [2019-11-23 22:34:07,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:06" (1/1) ... [2019-11-23 22:34:07,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:06" (1/1) ... [2019-11-23 22:34:07,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:34:07,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:34:07,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:34:07,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:34:07,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:06" (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-11-23 22:34:07,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:34:07,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:34:10,887 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:34:10,888 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-23 22:34:10,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:10 BoogieIcfgContainer [2019-11-23 22:34:10,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:34:10,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:34:10,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:34:10,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:34:10,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:34:05" (1/3) ... [2019-11-23 22:34:10,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9bb536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:10, skipping insertion in model container [2019-11-23 22:34:10,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:34:06" (2/3) ... [2019-11-23 22:34:10,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9bb536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:34:10, skipping insertion in model container [2019-11-23 22:34:10,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:34:10" (3/3) ... [2019-11-23 22:34:10,903 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-11-23 22:34:10,912 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:34:10,920 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-11-23 22:34:10,932 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-11-23 22:34:10,979 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:34:10,979 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:34:10,979 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:34:10,980 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:34:10,980 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:34:10,980 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:34:10,981 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:34:10,981 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:34:11,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states. [2019-11-23 22:34:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-23 22:34:11,045 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:11,046 INFO L410 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] [2019-11-23 22:34:11,047 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:11,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:11,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1061871762, now seen corresponding path program 1 times [2019-11-23 22:34:11,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:11,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696987584] [2019-11-23 22:34:11,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:11,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696987584] [2019-11-23 22:34:11,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:11,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:11,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761547083] [2019-11-23 22:34:11,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:11,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:11,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:11,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:11,483 INFO L87 Difference]: Start difference. First operand 1254 states. Second operand 5 states. [2019-11-23 22:34:13,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:13,603 INFO L93 Difference]: Finished difference Result 2467 states and 4323 transitions. [2019-11-23 22:34:13,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:13,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-23 22:34:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:13,645 INFO L225 Difference]: With dead ends: 2467 [2019-11-23 22:34:13,645 INFO L226 Difference]: Without dead ends: 1550 [2019-11-23 22:34:13,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-11-23 22:34:13,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2019-11-23 22:34:13,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1544. [2019-11-23 22:34:13,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1544 states. [2019-11-23 22:34:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 2086 transitions. [2019-11-23 22:34:13,849 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 2086 transitions. Word has length 51 [2019-11-23 22:34:13,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:13,850 INFO L462 AbstractCegarLoop]: Abstraction has 1544 states and 2086 transitions. [2019-11-23 22:34:13,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 2086 transitions. [2019-11-23 22:34:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:34:13,855 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:13,856 INFO L410 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] [2019-11-23 22:34:13,856 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:13,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:13,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1625759521, now seen corresponding path program 1 times [2019-11-23 22:34:13,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:13,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206071921] [2019-11-23 22:34:13,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:14,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206071921] [2019-11-23 22:34:14,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:14,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:14,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743429842] [2019-11-23 22:34:14,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:14,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:14,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:14,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:14,074 INFO L87 Difference]: Start difference. First operand 1544 states and 2086 transitions. Second operand 5 states. [2019-11-23 22:34:15,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:15,511 INFO L93 Difference]: Finished difference Result 3169 states and 4338 transitions. [2019-11-23 22:34:15,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:15,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-23 22:34:15,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:15,524 INFO L225 Difference]: With dead ends: 3169 [2019-11-23 22:34:15,524 INFO L226 Difference]: Without dead ends: 2189 [2019-11-23 22:34:15,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-11-23 22:34:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2189 states. [2019-11-23 22:34:15,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2189 to 2177. [2019-11-23 22:34:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2177 states. [2019-11-23 22:34:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2177 states to 2177 states and 2986 transitions. [2019-11-23 22:34:15,644 INFO L78 Accepts]: Start accepts. Automaton has 2177 states and 2986 transitions. Word has length 52 [2019-11-23 22:34:15,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:15,646 INFO L462 AbstractCegarLoop]: Abstraction has 2177 states and 2986 transitions. [2019-11-23 22:34:15,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2177 states and 2986 transitions. [2019-11-23 22:34:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-23 22:34:15,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:15,654 INFO L410 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] [2019-11-23 22:34:15,655 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:15,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:15,655 INFO L82 PathProgramCache]: Analyzing trace with hash 299183278, now seen corresponding path program 1 times [2019-11-23 22:34:15,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:15,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924129056] [2019-11-23 22:34:15,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:15,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924129056] [2019-11-23 22:34:15,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:15,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 22:34:15,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279569902] [2019-11-23 22:34:15,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:34:15,796 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:15,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:34:15,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:34:15,797 INFO L87 Difference]: Start difference. First operand 2177 states and 2986 transitions. Second operand 5 states. [2019-11-23 22:34:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:17,049 INFO L93 Difference]: Finished difference Result 4520 states and 6280 transitions. [2019-11-23 22:34:17,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:34:17,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-11-23 22:34:17,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:17,067 INFO L225 Difference]: With dead ends: 4520 [2019-11-23 22:34:17,067 INFO L226 Difference]: Without dead ends: 3045 [2019-11-23 22:34:17,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-11-23 22:34:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3045 states. [2019-11-23 22:34:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3045 to 3035. [2019-11-23 22:34:17,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-11-23 22:34:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4170 transitions. [2019-11-23 22:34:17,278 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4170 transitions. Word has length 52 [2019-11-23 22:34:17,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:17,278 INFO L462 AbstractCegarLoop]: Abstraction has 3035 states and 4170 transitions. [2019-11-23 22:34:17,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:34:17,284 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4170 transitions. [2019-11-23 22:34:17,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:34:17,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:17,288 INFO L410 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] [2019-11-23 22:34:17,288 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:17,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:17,289 INFO L82 PathProgramCache]: Analyzing trace with hash 448762372, now seen corresponding path program 1 times [2019-11-23 22:34:17,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:17,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631630416] [2019-11-23 22:34:17,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:17,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631630416] [2019-11-23 22:34:17,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:17,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:34:17,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373835073] [2019-11-23 22:34:17,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:34:17,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:17,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:34:17,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:34:17,480 INFO L87 Difference]: Start difference. First operand 3035 states and 4170 transitions. Second operand 9 states. [2019-11-23 22:34:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:21,392 INFO L93 Difference]: Finished difference Result 7167 states and 10258 transitions. [2019-11-23 22:34:21,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-23 22:34:21,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-11-23 22:34:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:21,424 INFO L225 Difference]: With dead ends: 7167 [2019-11-23 22:34:21,425 INFO L226 Difference]: Without dead ends: 6610 [2019-11-23 22:34:21,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-11-23 22:34:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6610 states. [2019-11-23 22:34:21,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6610 to 3035. [2019-11-23 22:34:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-11-23 22:34:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4169 transitions. [2019-11-23 22:34:21,632 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4169 transitions. Word has length 53 [2019-11-23 22:34:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:21,632 INFO L462 AbstractCegarLoop]: Abstraction has 3035 states and 4169 transitions. [2019-11-23 22:34:21,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:34:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4169 transitions. [2019-11-23 22:34:21,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:34:21,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:21,638 INFO L410 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] [2019-11-23 22:34:21,638 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:21,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:21,638 INFO L82 PathProgramCache]: Analyzing trace with hash 303472925, now seen corresponding path program 1 times [2019-11-23 22:34:21,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:21,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590583690] [2019-11-23 22:34:21,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:21,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590583690] [2019-11-23 22:34:21,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:21,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-23 22:34:21,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136380594] [2019-11-23 22:34:21,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-23 22:34:21,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:21,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-23 22:34:21,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:34:21,939 INFO L87 Difference]: Start difference. First operand 3035 states and 4169 transitions. Second operand 9 states. [2019-11-23 22:34:24,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:24,994 INFO L93 Difference]: Finished difference Result 4563 states and 6360 transitions. [2019-11-23 22:34:24,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-23 22:34:24,995 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-11-23 22:34:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:25,015 INFO L225 Difference]: With dead ends: 4563 [2019-11-23 22:34:25,015 INFO L226 Difference]: Without dead ends: 4558 [2019-11-23 22:34:25,017 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2019-11-23 22:34:25,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2019-11-23 22:34:25,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 3035. [2019-11-23 22:34:25,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-11-23 22:34:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4168 transitions. [2019-11-23 22:34:25,215 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4168 transitions. Word has length 53 [2019-11-23 22:34:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:25,217 INFO L462 AbstractCegarLoop]: Abstraction has 3035 states and 4168 transitions. [2019-11-23 22:34:25,217 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-23 22:34:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4168 transitions. [2019-11-23 22:34:25,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-23 22:34:25,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:25,221 INFO L410 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] [2019-11-23 22:34:25,222 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:25,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:25,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1162103691, now seen corresponding path program 1 times [2019-11-23 22:34:25,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:25,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459626984] [2019-11-23 22:34:25,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:25,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459626984] [2019-11-23 22:34:25,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:25,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-23 22:34:25,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146307844] [2019-11-23 22:34:25,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-23 22:34:25,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:25,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-23 22:34:25,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-23 22:34:25,413 INFO L87 Difference]: Start difference. First operand 3035 states and 4168 transitions. Second operand 8 states. [2019-11-23 22:34:27,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:27,900 INFO L93 Difference]: Finished difference Result 5095 states and 7233 transitions. [2019-11-23 22:34:27,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:34:27,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-11-23 22:34:27,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:27,919 INFO L225 Difference]: With dead ends: 5095 [2019-11-23 22:34:27,920 INFO L226 Difference]: Without dead ends: 4424 [2019-11-23 22:34:27,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:34:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4424 states. [2019-11-23 22:34:28,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4424 to 3035. [2019-11-23 22:34:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-11-23 22:34:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4167 transitions. [2019-11-23 22:34:28,169 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4167 transitions. Word has length 53 [2019-11-23 22:34:28,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:28,169 INFO L462 AbstractCegarLoop]: Abstraction has 3035 states and 4167 transitions. [2019-11-23 22:34:28,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-23 22:34:28,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4167 transitions. [2019-11-23 22:34:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:34:28,173 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:28,173 INFO L410 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] [2019-11-23 22:34:28,173 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:28,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:28,174 INFO L82 PathProgramCache]: Analyzing trace with hash -482264145, now seen corresponding path program 1 times [2019-11-23 22:34:28,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:28,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778617805] [2019-11-23 22:34:28,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:28,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778617805] [2019-11-23 22:34:28,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:28,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:28,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576867652] [2019-11-23 22:34:28,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:28,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:28,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:28,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:28,241 INFO L87 Difference]: Start difference. First operand 3035 states and 4167 transitions. Second operand 3 states. [2019-11-23 22:34:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:28,499 INFO L93 Difference]: Finished difference Result 3991 states and 5632 transitions. [2019-11-23 22:34:28,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:28,500 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-23 22:34:28,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:28,531 INFO L225 Difference]: With dead ends: 3991 [2019-11-23 22:34:28,531 INFO L226 Difference]: Without dead ends: 3088 [2019-11-23 22:34:28,540 INFO L630 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-11-23 22:34:28,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3088 states. [2019-11-23 22:34:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3088 to 3086. [2019-11-23 22:34:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3086 states. [2019-11-23 22:34:28,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 4263 transitions. [2019-11-23 22:34:28,716 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 4263 transitions. Word has length 54 [2019-11-23 22:34:28,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:28,718 INFO L462 AbstractCegarLoop]: Abstraction has 3086 states and 4263 transitions. [2019-11-23 22:34:28,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:28,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 4263 transitions. [2019-11-23 22:34:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:34:28,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:28,721 INFO L410 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] [2019-11-23 22:34:28,722 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:28,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:28,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1622556323, now seen corresponding path program 1 times [2019-11-23 22:34:28,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:28,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263904724] [2019-11-23 22:34:28,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:28,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:28,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263904724] [2019-11-23 22:34:28,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:28,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:28,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117359172] [2019-11-23 22:34:28,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:28,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:28,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:28,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:28,805 INFO L87 Difference]: Start difference. First operand 3086 states and 4263 transitions. Second operand 3 states. [2019-11-23 22:34:29,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:29,059 INFO L93 Difference]: Finished difference Result 4727 states and 6797 transitions. [2019-11-23 22:34:29,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:29,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-23 22:34:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:29,067 INFO L225 Difference]: With dead ends: 4727 [2019-11-23 22:34:29,067 INFO L226 Difference]: Without dead ends: 3508 [2019-11-23 22:34:29,070 INFO L630 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-11-23 22:34:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2019-11-23 22:34:29,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3506. [2019-11-23 22:34:29,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3506 states. [2019-11-23 22:34:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3506 states to 3506 states and 4941 transitions. [2019-11-23 22:34:29,425 INFO L78 Accepts]: Start accepts. Automaton has 3506 states and 4941 transitions. Word has length 54 [2019-11-23 22:34:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:29,425 INFO L462 AbstractCegarLoop]: Abstraction has 3506 states and 4941 transitions. [2019-11-23 22:34:29,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:29,426 INFO L276 IsEmpty]: Start isEmpty. Operand 3506 states and 4941 transitions. [2019-11-23 22:34:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-23 22:34:29,428 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:29,429 INFO L410 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] [2019-11-23 22:34:29,434 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:29,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:29,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1612308197, now seen corresponding path program 1 times [2019-11-23 22:34:29,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:29,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611666777] [2019-11-23 22:34:29,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:29,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:29,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611666777] [2019-11-23 22:34:29,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:29,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:29,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584988071] [2019-11-23 22:34:29,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:29,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:29,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:29,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:29,487 INFO L87 Difference]: Start difference. First operand 3506 states and 4941 transitions. Second operand 3 states. [2019-11-23 22:34:29,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:29,863 INFO L93 Difference]: Finished difference Result 7605 states and 10992 transitions. [2019-11-23 22:34:29,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:29,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-23 22:34:29,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:29,873 INFO L225 Difference]: With dead ends: 7605 [2019-11-23 22:34:29,873 INFO L226 Difference]: Without dead ends: 5153 [2019-11-23 22:34:29,878 INFO L630 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-11-23 22:34:29,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5153 states. [2019-11-23 22:34:30,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5153 to 5147. [2019-11-23 22:34:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5147 states. [2019-11-23 22:34:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5147 states to 5147 states and 7266 transitions. [2019-11-23 22:34:30,172 INFO L78 Accepts]: Start accepts. Automaton has 5147 states and 7266 transitions. Word has length 54 [2019-11-23 22:34:30,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:30,172 INFO L462 AbstractCegarLoop]: Abstraction has 5147 states and 7266 transitions. [2019-11-23 22:34:30,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:30,172 INFO L276 IsEmpty]: Start isEmpty. Operand 5147 states and 7266 transitions. [2019-11-23 22:34:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:34:30,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:30,175 INFO L410 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] [2019-11-23 22:34:30,176 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:30,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1623263409, now seen corresponding path program 1 times [2019-11-23 22:34:30,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:30,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150215322] [2019-11-23 22:34:30,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:30,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:30,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150215322] [2019-11-23 22:34:30,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:30,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:30,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556135112] [2019-11-23 22:34:30,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:30,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:30,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:30,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:30,218 INFO L87 Difference]: Start difference. First operand 5147 states and 7266 transitions. Second operand 3 states. [2019-11-23 22:34:30,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:30,876 INFO L93 Difference]: Finished difference Result 9593 states and 13741 transitions. [2019-11-23 22:34:30,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:30,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-23 22:34:30,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:30,892 INFO L225 Difference]: With dead ends: 9593 [2019-11-23 22:34:30,892 INFO L226 Difference]: Without dead ends: 5408 [2019-11-23 22:34:30,900 INFO L630 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-11-23 22:34:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5408 states. [2019-11-23 22:34:31,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5408 to 4343. [2019-11-23 22:34:31,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4343 states. [2019-11-23 22:34:31,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4343 states to 4343 states and 6182 transitions. [2019-11-23 22:34:31,312 INFO L78 Accepts]: Start accepts. Automaton has 4343 states and 6182 transitions. Word has length 55 [2019-11-23 22:34:31,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:31,312 INFO L462 AbstractCegarLoop]: Abstraction has 4343 states and 6182 transitions. [2019-11-23 22:34:31,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:31,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4343 states and 6182 transitions. [2019-11-23 22:34:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:34:31,315 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:31,316 INFO L410 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] [2019-11-23 22:34:31,316 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:31,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1493102210, now seen corresponding path program 1 times [2019-11-23 22:34:31,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:31,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751177016] [2019-11-23 22:34:31,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:31,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751177016] [2019-11-23 22:34:31,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:31,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:31,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23370113] [2019-11-23 22:34:31,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:31,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:31,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:31,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:31,367 INFO L87 Difference]: Start difference. First operand 4343 states and 6182 transitions. Second operand 3 states. [2019-11-23 22:34:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:31,768 INFO L93 Difference]: Finished difference Result 8336 states and 12073 transitions. [2019-11-23 22:34:31,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:31,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-23 22:34:31,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:31,779 INFO L225 Difference]: With dead ends: 8336 [2019-11-23 22:34:31,779 INFO L226 Difference]: Without dead ends: 4679 [2019-11-23 22:34:31,786 INFO L630 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-11-23 22:34:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2019-11-23 22:34:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 3775. [2019-11-23 22:34:32,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3775 states. [2019-11-23 22:34:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3775 states to 3775 states and 5410 transitions. [2019-11-23 22:34:32,172 INFO L78 Accepts]: Start accepts. Automaton has 3775 states and 5410 transitions. Word has length 55 [2019-11-23 22:34:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:32,173 INFO L462 AbstractCegarLoop]: Abstraction has 3775 states and 5410 transitions. [2019-11-23 22:34:32,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3775 states and 5410 transitions. [2019-11-23 22:34:32,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-23 22:34:32,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:32,181 INFO L410 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] [2019-11-23 22:34:32,181 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:32,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:32,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1419432604, now seen corresponding path program 1 times [2019-11-23 22:34:32,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:32,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364376264] [2019-11-23 22:34:32,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:32,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:32,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364376264] [2019-11-23 22:34:32,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:32,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:34:32,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897347137] [2019-11-23 22:34:32,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:34:32,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:32,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:34:32,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:34:32,223 INFO L87 Difference]: Start difference. First operand 3775 states and 5410 transitions. Second operand 3 states. [2019-11-23 22:34:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:32,542 INFO L93 Difference]: Finished difference Result 7569 states and 11012 transitions. [2019-11-23 22:34:32,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:34:32,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-23 22:34:32,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:32,547 INFO L225 Difference]: With dead ends: 7569 [2019-11-23 22:34:32,548 INFO L226 Difference]: Without dead ends: 4109 [2019-11-23 22:34:32,553 INFO L630 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-11-23 22:34:32,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2019-11-23 22:34:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 3304. [2019-11-23 22:34:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3304 states. [2019-11-23 22:34:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 4779 transitions. [2019-11-23 22:34:32,916 INFO L78 Accepts]: Start accepts. Automaton has 3304 states and 4779 transitions. Word has length 55 [2019-11-23 22:34:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:32,916 INFO L462 AbstractCegarLoop]: Abstraction has 3304 states and 4779 transitions. [2019-11-23 22:34:32,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:34:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 4779 transitions. [2019-11-23 22:34:32,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:34:32,918 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:32,918 INFO L410 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] [2019-11-23 22:34:32,918 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:32,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:32,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1871407914, now seen corresponding path program 1 times [2019-11-23 22:34:32,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:32,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465030505] [2019-11-23 22:34:32,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:33,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:33,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465030505] [2019-11-23 22:34:33,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:33,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-23 22:34:33,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548763632] [2019-11-23 22:34:33,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:34:33,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:33,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:34:33,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:34:33,430 INFO L87 Difference]: Start difference. First operand 3304 states and 4779 transitions. Second operand 19 states. [2019-11-23 22:34:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:38,344 INFO L93 Difference]: Finished difference Result 6980 states and 10118 transitions. [2019-11-23 22:34:38,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-23 22:34:38,344 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-11-23 22:34:38,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:38,350 INFO L225 Difference]: With dead ends: 6980 [2019-11-23 22:34:38,350 INFO L226 Difference]: Without dead ends: 6976 [2019-11-23 22:34:38,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=229, Invalid=1031, Unknown=0, NotChecked=0, Total=1260 [2019-11-23 22:34:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6976 states. [2019-11-23 22:34:38,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6976 to 3316. [2019-11-23 22:34:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3316 states. [2019-11-23 22:34:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 4796 transitions. [2019-11-23 22:34:38,690 INFO L78 Accepts]: Start accepts. Automaton has 3316 states and 4796 transitions. Word has length 56 [2019-11-23 22:34:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:38,691 INFO L462 AbstractCegarLoop]: Abstraction has 3316 states and 4796 transitions. [2019-11-23 22:34:38,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:34:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 3316 states and 4796 transitions. [2019-11-23 22:34:38,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:34:38,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:38,692 INFO L410 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] [2019-11-23 22:34:38,692 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:38,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:38,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1094868748, now seen corresponding path program 1 times [2019-11-23 22:34:38,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:38,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898372521] [2019-11-23 22:34:38,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:39,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:39,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898372521] [2019-11-23 22:34:39,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:39,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-23 22:34:39,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421797823] [2019-11-23 22:34:39,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:34:39,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:39,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:34:39,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:34:39,295 INFO L87 Difference]: Start difference. First operand 3316 states and 4796 transitions. Second operand 19 states. [2019-11-23 22:34:39,554 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 84 [2019-11-23 22:34:40,027 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-23 22:34:40,455 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-23 22:34:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:45,615 INFO L93 Difference]: Finished difference Result 6366 states and 9207 transitions. [2019-11-23 22:34:45,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-23 22:34:45,620 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-11-23 22:34:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:45,629 INFO L225 Difference]: With dead ends: 6366 [2019-11-23 22:34:45,629 INFO L226 Difference]: Without dead ends: 6362 [2019-11-23 22:34:45,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=229, Invalid=893, Unknown=0, NotChecked=0, Total=1122 [2019-11-23 22:34:45,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6362 states. [2019-11-23 22:34:45,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6362 to 3323. [2019-11-23 22:34:45,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3323 states. [2019-11-23 22:34:45,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3323 states to 3323 states and 4805 transitions. [2019-11-23 22:34:45,988 INFO L78 Accepts]: Start accepts. Automaton has 3323 states and 4805 transitions. Word has length 56 [2019-11-23 22:34:45,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:45,988 INFO L462 AbstractCegarLoop]: Abstraction has 3323 states and 4805 transitions. [2019-11-23 22:34:45,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:34:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4805 transitions. [2019-11-23 22:34:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:34:45,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:45,989 INFO L410 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] [2019-11-23 22:34:45,990 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:45,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:45,990 INFO L82 PathProgramCache]: Analyzing trace with hash 557999134, now seen corresponding path program 1 times [2019-11-23 22:34:45,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:45,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709053200] [2019-11-23 22:34:45,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:46,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709053200] [2019-11-23 22:34:46,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:46,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-23 22:34:46,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499041406] [2019-11-23 22:34:46,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-23 22:34:46,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:46,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-23 22:34:46,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-11-23 22:34:46,424 INFO L87 Difference]: Start difference. First operand 3323 states and 4805 transitions. Second operand 19 states. [2019-11-23 22:34:46,585 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-11-23 22:34:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:51,629 INFO L93 Difference]: Finished difference Result 7047 states and 10217 transitions. [2019-11-23 22:34:51,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-23 22:34:51,630 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 56 [2019-11-23 22:34:51,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:51,637 INFO L225 Difference]: With dead ends: 7047 [2019-11-23 22:34:51,637 INFO L226 Difference]: Without dead ends: 7041 [2019-11-23 22:34:51,639 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=281, Invalid=1125, Unknown=0, NotChecked=0, Total=1406 [2019-11-23 22:34:51,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7041 states. [2019-11-23 22:34:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7041 to 3323. [2019-11-23 22:34:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3323 states. [2019-11-23 22:34:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3323 states to 3323 states and 4804 transitions. [2019-11-23 22:34:51,875 INFO L78 Accepts]: Start accepts. Automaton has 3323 states and 4804 transitions. Word has length 56 [2019-11-23 22:34:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:51,875 INFO L462 AbstractCegarLoop]: Abstraction has 3323 states and 4804 transitions. [2019-11-23 22:34:51,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-23 22:34:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 4804 transitions. [2019-11-23 22:34:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-23 22:34:51,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:51,876 INFO L410 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] [2019-11-23 22:34:51,877 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:51,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:51,877 INFO L82 PathProgramCache]: Analyzing trace with hash 513328539, now seen corresponding path program 1 times [2019-11-23 22:34:51,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:51,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705871728] [2019-11-23 22:34:51,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:52,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-11-23 22:34:52,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705871728] [2019-11-23 22:34:52,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:52,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-11-23 22:34:52,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568286719] [2019-11-23 22:34:52,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-23 22:34:52,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:52,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-23 22:34:52,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-11-23 22:34:52,773 INFO L87 Difference]: Start difference. First operand 3323 states and 4804 transitions. Second operand 17 states. [2019-11-23 22:34:53,561 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2019-11-23 22:34:53,865 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-23 22:34:54,111 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-11-23 22:34:54,343 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-11-23 22:34:54,571 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2019-11-23 22:34:54,733 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 41 [2019-11-23 22:34:57,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:34:57,933 INFO L93 Difference]: Finished difference Result 6339 states and 9181 transitions. [2019-11-23 22:34:57,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-23 22:34:57,934 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2019-11-23 22:34:57,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:34:57,940 INFO L225 Difference]: With dead ends: 6339 [2019-11-23 22:34:57,940 INFO L226 Difference]: Without dead ends: 6278 [2019-11-23 22:34:57,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=272, Invalid=784, Unknown=0, NotChecked=0, Total=1056 [2019-11-23 22:34:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6278 states. [2019-11-23 22:34:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6278 to 3311. [2019-11-23 22:34:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3311 states. [2019-11-23 22:34:58,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 4791 transitions. [2019-11-23 22:34:58,230 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 4791 transitions. Word has length 56 [2019-11-23 22:34:58,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:34:58,230 INFO L462 AbstractCegarLoop]: Abstraction has 3311 states and 4791 transitions. [2019-11-23 22:34:58,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-23 22:34:58,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4791 transitions. [2019-11-23 22:34:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:34:58,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:34:58,232 INFO L410 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] [2019-11-23 22:34:58,232 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:34:58,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:34:58,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1785706246, now seen corresponding path program 1 times [2019-11-23 22:34:58,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:34:58,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296257257] [2019-11-23 22:34:58,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:34:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:34:58,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:34:58,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296257257] [2019-11-23 22:34:58,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:34:58,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-11-23 22:34:58,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662820034] [2019-11-23 22:34:58,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-23 22:34:58,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:34:58,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-23 22:34:58,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2019-11-23 22:34:58,762 INFO L87 Difference]: Start difference. First operand 3311 states and 4791 transitions. Second operand 16 states. [2019-11-23 22:34:59,348 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 42 [2019-11-23 22:35:00,103 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-23 22:35:03,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:03,456 INFO L93 Difference]: Finished difference Result 6263 states and 9075 transitions. [2019-11-23 22:35:03,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:35:03,456 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 57 [2019-11-23 22:35:03,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:03,461 INFO L225 Difference]: With dead ends: 6263 [2019-11-23 22:35:03,461 INFO L226 Difference]: Without dead ends: 6259 [2019-11-23 22:35:03,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=192, Invalid=678, Unknown=0, NotChecked=0, Total=870 [2019-11-23 22:35:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6259 states. [2019-11-23 22:35:03,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6259 to 3300. [2019-11-23 22:35:03,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3300 states. [2019-11-23 22:35:03,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3300 states to 3300 states and 4778 transitions. [2019-11-23 22:35:03,765 INFO L78 Accepts]: Start accepts. Automaton has 3300 states and 4778 transitions. Word has length 57 [2019-11-23 22:35:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:03,765 INFO L462 AbstractCegarLoop]: Abstraction has 3300 states and 4778 transitions. [2019-11-23 22:35:03,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-23 22:35:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 3300 states and 4778 transitions. [2019-11-23 22:35:03,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-23 22:35:03,767 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:03,767 INFO L410 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] [2019-11-23 22:35:03,767 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:03,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:03,767 INFO L82 PathProgramCache]: Analyzing trace with hash 247888215, now seen corresponding path program 1 times [2019-11-23 22:35:03,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:03,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669573738] [2019-11-23 22:35:03,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:04,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669573738] [2019-11-23 22:35:04,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:04,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-23 22:35:04,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653423920] [2019-11-23 22:35:04,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-23 22:35:04,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:04,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-23 22:35:04,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:35:04,380 INFO L87 Difference]: Start difference. First operand 3300 states and 4778 transitions. Second operand 15 states. [2019-11-23 22:35:04,916 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-23 22:35:05,187 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-11-23 22:35:05,447 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-11-23 22:35:05,820 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-11-23 22:35:07,197 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-11-23 22:35:07,884 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-23 22:35:09,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:09,409 INFO L93 Difference]: Finished difference Result 6385 states and 9242 transitions. [2019-11-23 22:35:09,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-23 22:35:09,409 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-11-23 22:35:09,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:09,414 INFO L225 Difference]: With dead ends: 6385 [2019-11-23 22:35:09,414 INFO L226 Difference]: Without dead ends: 6308 [2019-11-23 22:35:09,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-11-23 22:35:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6308 states. [2019-11-23 22:35:09,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6308 to 3291. [2019-11-23 22:35:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3291 states. [2019-11-23 22:35:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 4766 transitions. [2019-11-23 22:35:09,725 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 4766 transitions. Word has length 57 [2019-11-23 22:35:09,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:09,725 INFO L462 AbstractCegarLoop]: Abstraction has 3291 states and 4766 transitions. [2019-11-23 22:35:09,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-23 22:35:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 4766 transitions. [2019-11-23 22:35:09,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-23 22:35:09,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:09,728 INFO L410 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] [2019-11-23 22:35:09,728 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:09,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:09,728 INFO L82 PathProgramCache]: Analyzing trace with hash -101338621, now seen corresponding path program 1 times [2019-11-23 22:35:09,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:09,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137835604] [2019-11-23 22:35:09,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:09,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:09,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137835604] [2019-11-23 22:35:09,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:09,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:09,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069477721] [2019-11-23 22:35:09,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:09,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:09,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:09,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:09,781 INFO L87 Difference]: Start difference. First operand 3291 states and 4766 transitions. Second operand 3 states. [2019-11-23 22:35:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:10,531 INFO L93 Difference]: Finished difference Result 8325 states and 12266 transitions. [2019-11-23 22:35:10,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:10,532 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-23 22:35:10,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:10,537 INFO L225 Difference]: With dead ends: 8325 [2019-11-23 22:35:10,537 INFO L226 Difference]: Without dead ends: 5603 [2019-11-23 22:35:10,540 INFO L630 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-11-23 22:35:10,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5603 states. [2019-11-23 22:35:11,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5603 to 5601. [2019-11-23 22:35:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5601 states. [2019-11-23 22:35:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5601 states to 5601 states and 8104 transitions. [2019-11-23 22:35:11,124 INFO L78 Accepts]: Start accepts. Automaton has 5601 states and 8104 transitions. Word has length 63 [2019-11-23 22:35:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:11,124 INFO L462 AbstractCegarLoop]: Abstraction has 5601 states and 8104 transitions. [2019-11-23 22:35:11,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 5601 states and 8104 transitions. [2019-11-23 22:35:11,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-23 22:35:11,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:11,126 INFO L410 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] [2019-11-23 22:35:11,126 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:11,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:11,126 INFO L82 PathProgramCache]: Analyzing trace with hash 838129574, now seen corresponding path program 1 times [2019-11-23 22:35:11,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:11,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575685146] [2019-11-23 22:35:11,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:11,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:11,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575685146] [2019-11-23 22:35:11,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:11,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-23 22:35:11,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640750175] [2019-11-23 22:35:11,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 22:35:11,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:11,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 22:35:11,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:11,219 INFO L87 Difference]: Start difference. First operand 5601 states and 8104 transitions. Second operand 5 states. [2019-11-23 22:35:11,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:11,827 INFO L93 Difference]: Finished difference Result 8807 states and 12783 transitions. [2019-11-23 22:35:11,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 22:35:11,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-23 22:35:11,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:11,832 INFO L225 Difference]: With dead ends: 8807 [2019-11-23 22:35:11,832 INFO L226 Difference]: Without dead ends: 3748 [2019-11-23 22:35:11,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 22:35:11,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2019-11-23 22:35:12,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3734. [2019-11-23 22:35:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3734 states. [2019-11-23 22:35:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3734 states to 3734 states and 5263 transitions. [2019-11-23 22:35:12,357 INFO L78 Accepts]: Start accepts. Automaton has 3734 states and 5263 transitions. Word has length 64 [2019-11-23 22:35:12,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:12,357 INFO L462 AbstractCegarLoop]: Abstraction has 3734 states and 5263 transitions. [2019-11-23 22:35:12,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 22:35:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3734 states and 5263 transitions. [2019-11-23 22:35:12,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-23 22:35:12,358 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:12,359 INFO L410 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] [2019-11-23 22:35:12,359 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:12,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:12,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1809556404, now seen corresponding path program 1 times [2019-11-23 22:35:12,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:12,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891503055] [2019-11-23 22:35:12,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:12,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:12,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891503055] [2019-11-23 22:35:12,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:12,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:35:12,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131394360] [2019-11-23 22:35:12,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-23 22:35:12,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:12,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-23 22:35:12,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-23 22:35:12,434 INFO L87 Difference]: Start difference. First operand 3734 states and 5263 transitions. Second operand 6 states. [2019-11-23 22:35:13,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:13,551 INFO L93 Difference]: Finished difference Result 6987 states and 9831 transitions. [2019-11-23 22:35:13,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-23 22:35:13,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-23 22:35:13,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:13,557 INFO L225 Difference]: With dead ends: 6987 [2019-11-23 22:35:13,557 INFO L226 Difference]: Without dead ends: 6985 [2019-11-23 22:35:13,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-23 22:35:13,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6985 states. [2019-11-23 22:35:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6985 to 3848. [2019-11-23 22:35:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2019-11-23 22:35:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5377 transitions. [2019-11-23 22:35:14,109 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5377 transitions. Word has length 66 [2019-11-23 22:35:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:14,110 INFO L462 AbstractCegarLoop]: Abstraction has 3848 states and 5377 transitions. [2019-11-23 22:35:14,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-23 22:35:14,110 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5377 transitions. [2019-11-23 22:35:14,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-23 22:35:14,111 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:14,112 INFO L410 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] [2019-11-23 22:35:14,112 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash 382235117, now seen corresponding path program 1 times [2019-11-23 22:35:14,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:14,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846172646] [2019-11-23 22:35:14,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:14,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846172646] [2019-11-23 22:35:14,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:14,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:14,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865341976] [2019-11-23 22:35:14,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:14,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:14,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:14,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:14,158 INFO L87 Difference]: Start difference. First operand 3848 states and 5377 transitions. Second operand 3 states. [2019-11-23 22:35:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:15,390 INFO L93 Difference]: Finished difference Result 9865 states and 13929 transitions. [2019-11-23 22:35:15,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:15,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-23 22:35:15,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:15,398 INFO L225 Difference]: With dead ends: 9865 [2019-11-23 22:35:15,398 INFO L226 Difference]: Without dead ends: 6538 [2019-11-23 22:35:15,402 INFO L630 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-11-23 22:35:15,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-11-23 22:35:16,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 6460. [2019-11-23 22:35:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6460 states. [2019-11-23 22:35:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6460 states to 6460 states and 8968 transitions. [2019-11-23 22:35:16,306 INFO L78 Accepts]: Start accepts. Automaton has 6460 states and 8968 transitions. Word has length 67 [2019-11-23 22:35:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:16,306 INFO L462 AbstractCegarLoop]: Abstraction has 6460 states and 8968 transitions. [2019-11-23 22:35:16,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 6460 states and 8968 transitions. [2019-11-23 22:35:16,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 22:35:16,308 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:16,308 INFO L410 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] [2019-11-23 22:35:16,308 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:16,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1080773224, now seen corresponding path program 1 times [2019-11-23 22:35:16,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:16,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700227081] [2019-11-23 22:35:16,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:16,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700227081] [2019-11-23 22:35:16,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:16,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:16,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615068602] [2019-11-23 22:35:16,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:16,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:16,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:16,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:16,359 INFO L87 Difference]: Start difference. First operand 6460 states and 8968 transitions. Second operand 3 states. [2019-11-23 22:35:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:17,411 INFO L93 Difference]: Finished difference Result 7136 states and 9902 transitions. [2019-11-23 22:35:17,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:17,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-23 22:35:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:17,415 INFO L225 Difference]: With dead ends: 7136 [2019-11-23 22:35:17,415 INFO L226 Difference]: Without dead ends: 5772 [2019-11-23 22:35:17,417 INFO L630 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-11-23 22:35:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5772 states. [2019-11-23 22:35:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5772 to 5179. [2019-11-23 22:35:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5179 states. [2019-11-23 22:35:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5179 states to 5179 states and 7132 transitions. [2019-11-23 22:35:18,106 INFO L78 Accepts]: Start accepts. Automaton has 5179 states and 7132 transitions. Word has length 68 [2019-11-23 22:35:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:18,107 INFO L462 AbstractCegarLoop]: Abstraction has 5179 states and 7132 transitions. [2019-11-23 22:35:18,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 5179 states and 7132 transitions. [2019-11-23 22:35:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 22:35:18,108 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:18,108 INFO L410 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] [2019-11-23 22:35:18,109 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:18,109 INFO L82 PathProgramCache]: Analyzing trace with hash 604312731, now seen corresponding path program 1 times [2019-11-23 22:35:18,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:18,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150220200] [2019-11-23 22:35:18,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:18,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150220200] [2019-11-23 22:35:18,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:18,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:35:18,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426850481] [2019-11-23 22:35:18,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:35:18,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:18,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:35:18,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:35:18,162 INFO L87 Difference]: Start difference. First operand 5179 states and 7132 transitions. Second operand 3 states. [2019-11-23 22:35:19,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:19,103 INFO L93 Difference]: Finished difference Result 6183 states and 8512 transitions. [2019-11-23 22:35:19,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:35:19,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-11-23 22:35:19,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:19,106 INFO L225 Difference]: With dead ends: 6183 [2019-11-23 22:35:19,106 INFO L226 Difference]: Without dead ends: 4181 [2019-11-23 22:35:19,108 INFO L630 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-11-23 22:35:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4181 states. [2019-11-23 22:35:19,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4181 to 4157. [2019-11-23 22:35:19,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4157 states. [2019-11-23 22:35:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4157 states to 4157 states and 5620 transitions. [2019-11-23 22:35:19,651 INFO L78 Accepts]: Start accepts. Automaton has 4157 states and 5620 transitions. Word has length 68 [2019-11-23 22:35:19,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:19,651 INFO L462 AbstractCegarLoop]: Abstraction has 4157 states and 5620 transitions. [2019-11-23 22:35:19,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:35:19,651 INFO L276 IsEmpty]: Start isEmpty. Operand 4157 states and 5620 transitions. [2019-11-23 22:35:19,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-23 22:35:19,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:19,653 INFO L410 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] [2019-11-23 22:35:19,653 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:19,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:19,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1757380342, now seen corresponding path program 1 times [2019-11-23 22:35:19,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:19,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974397729] [2019-11-23 22:35:19,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:19,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974397729] [2019-11-23 22:35:19,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:19,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:35:19,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171115098] [2019-11-23 22:35:19,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:35:19,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:35:19,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:35:19,722 INFO L87 Difference]: Start difference. First operand 4157 states and 5620 transitions. Second operand 7 states. [2019-11-23 22:35:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:22,417 INFO L93 Difference]: Finished difference Result 14612 states and 19937 transitions. [2019-11-23 22:35:22,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:35:22,418 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-11-23 22:35:22,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:22,430 INFO L225 Difference]: With dead ends: 14612 [2019-11-23 22:35:22,430 INFO L226 Difference]: Without dead ends: 12682 [2019-11-23 22:35:22,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:35:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12682 states. [2019-11-23 22:35:23,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12682 to 5997. [2019-11-23 22:35:23,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5997 states. [2019-11-23 22:35:23,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5997 states to 5997 states and 8148 transitions. [2019-11-23 22:35:23,384 INFO L78 Accepts]: Start accepts. Automaton has 5997 states and 8148 transitions. Word has length 68 [2019-11-23 22:35:23,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:35:23,384 INFO L462 AbstractCegarLoop]: Abstraction has 5997 states and 8148 transitions. [2019-11-23 22:35:23,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-23 22:35:23,384 INFO L276 IsEmpty]: Start isEmpty. Operand 5997 states and 8148 transitions. [2019-11-23 22:35:23,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-23 22:35:23,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:35:23,386 INFO L410 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-11-23 22:35:23,386 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:35:23,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:35:23,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1471837234, now seen corresponding path program 1 times [2019-11-23 22:35:23,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:35:23,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752455920] [2019-11-23 22:35:23,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:35:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:35:23,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 22:35:23,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752455920] [2019-11-23 22:35:23,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:35:23,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-23 22:35:23,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694108881] [2019-11-23 22:35:23,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-23 22:35:23,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:35:23,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-23 22:35:23,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-23 22:35:23,467 INFO L87 Difference]: Start difference. First operand 5997 states and 8148 transitions. Second operand 7 states. [2019-11-23 22:35:26,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:35:26,825 INFO L93 Difference]: Finished difference Result 19051 states and 26003 transitions. [2019-11-23 22:35:26,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-23 22:35:26,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-11-23 22:35:26,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:35:26,846 INFO L225 Difference]: With dead ends: 19051 [2019-11-23 22:35:26,846 INFO L226 Difference]: Without dead ends: 16249 [2019-11-23 22:35:26,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-11-23 22:35:26,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16249 states.