/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/sumt8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 02:38:50,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 02:38:50,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 02:38:50,273 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 02:38:50,273 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 02:38:50,278 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 02:38:50,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 02:38:50,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 02:38:50,292 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 02:38:50,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 02:38:50,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 02:38:50,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 02:38:50,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 02:38:50,304 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 02:38:50,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 02:38:50,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 02:38:50,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 02:38:50,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 02:38:50,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 02:38:50,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 02:38:50,338 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 02:38:50,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 02:38:50,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 02:38:50,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 02:38:50,355 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 02:38:50,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 02:38:50,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 02:38:50,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 02:38:50,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 02:38:50,361 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 02:38:50,361 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 02:38:50,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 02:38:50,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 02:38:50,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 02:38:50,366 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 02:38:50,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 02:38:50,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 02:38:50,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 02:38:50,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 02:38:50,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 02:38:50,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 02:38:50,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 02:38:50,394 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 02:38:50,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 02:38:50,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 02:38:50,400 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 02:38:50,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 02:38:50,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 02:38:50,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 02:38:50,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 02:38:50,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 02:38:50,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 02:38:50,403 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 02:38:50,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 02:38:50,403 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 02:38:50,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 02:38:50,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 02:38:50,404 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 02:38:50,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 02:38:50,405 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 02:38:50,405 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:38:50,405 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 02:38:50,405 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 02:38:50,405 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 02:38:50,406 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-10-24 02:38:50,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 02:38:50,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 02:38:50,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 02:38:50,834 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 02:38:50,835 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 02:38:50,836 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt8.c [2020-10-24 02:38:50,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21924bcac/1aa32dadd9e54f148968a2b688f93a7d/FLAG54e7b6dbd [2020-10-24 02:38:51,657 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 02:38:51,658 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt8.c [2020-10-24 02:38:51,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21924bcac/1aa32dadd9e54f148968a2b688f93a7d/FLAG54e7b6dbd [2020-10-24 02:38:51,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21924bcac/1aa32dadd9e54f148968a2b688f93a7d [2020-10-24 02:38:51,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 02:38:51,691 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 02:38:51,693 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 02:38:51,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 02:38:51,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 02:38:51,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:51" (1/1) ... [2020-10-24 02:38:51,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e976205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:51, skipping insertion in model container [2020-10-24 02:38:51,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:51" (1/1) ... [2020-10-24 02:38:51,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 02:38:51,728 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 02:38:51,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:38:51,941 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 02:38:51,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:38:51,980 INFO L208 MainTranslator]: Completed translation [2020-10-24 02:38:51,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:51 WrapperNode [2020-10-24 02:38:51,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 02:38:51,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 02:38:51,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 02:38:51,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 02:38:51,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:51" (1/1) ... [2020-10-24 02:38:51,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:51" (1/1) ... [2020-10-24 02:38:52,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:51" (1/1) ... [2020-10-24 02:38:52,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:51" (1/1) ... [2020-10-24 02:38:52,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:51" (1/1) ... [2020-10-24 02:38:52,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:51" (1/1) ... [2020-10-24 02:38:52,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:51" (1/1) ... [2020-10-24 02:38:52,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 02:38:52,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 02:38:52,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 02:38:52,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 02:38:52,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:51" (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 [2020-10-24 02:38:52,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 02:38:52,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 02:38:52,118 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 02:38:52,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-10-24 02:38:52,119 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-24 02:38:52,119 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 02:38:52,119 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 02:38:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 02:38:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 02:38:52,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 02:38:52,121 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-10-24 02:38:52,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-24 02:38:52,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 02:38:52,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 02:38:52,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 02:38:52,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 02:38:52,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 02:38:52,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 02:38:52,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 02:38:52,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 02:38:52,532 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 02:38:52,532 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-24 02:38:52,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:52 BoogieIcfgContainer [2020-10-24 02:38:52,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 02:38:52,537 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 02:38:52,537 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 02:38:52,541 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 02:38:52,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:38:51" (1/3) ... [2020-10-24 02:38:52,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18986c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:52, skipping insertion in model container [2020-10-24 02:38:52,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:51" (2/3) ... [2020-10-24 02:38:52,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18986c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:52, skipping insertion in model container [2020-10-24 02:38:52,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:52" (3/3) ... [2020-10-24 02:38:52,545 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt8.c [2020-10-24 02:38:52,560 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 02:38:52,566 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 02:38:52,583 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 02:38:52,614 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 02:38:52,615 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 02:38:52,615 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 02:38:52,615 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 02:38:52,615 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 02:38:52,615 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 02:38:52,616 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 02:38:52,616 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 02:38:52,659 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2020-10-24 02:38:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-24 02:38:52,679 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:52,680 INFO L422 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] [2020-10-24 02:38:52,681 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:52,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:52,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1693041709, now seen corresponding path program 1 times [2020-10-24 02:38:52,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:52,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1507903276] [2020-10-24 02:38:52,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:53,568 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2020-10-24 02:38:53,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:53,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:53,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1507903276] [2020-10-24 02:38:53,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:38:53,708 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-10-24 02:38:53,709 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146415867] [2020-10-24 02:38:53,714 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 02:38:53,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:53,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 02:38:53,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-10-24 02:38:53,736 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 16 states. [2020-10-24 02:38:55,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:55,344 INFO L93 Difference]: Finished difference Result 185 states and 253 transitions. [2020-10-24 02:38:55,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 02:38:55,346 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2020-10-24 02:38:55,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:55,359 INFO L225 Difference]: With dead ends: 185 [2020-10-24 02:38:55,359 INFO L226 Difference]: Without dead ends: 131 [2020-10-24 02:38:55,364 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2020-10-24 02:38:55,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-10-24 02:38:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 61. [2020-10-24 02:38:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-24 02:38:55,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 68 transitions. [2020-10-24 02:38:55,442 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 68 transitions. Word has length 36 [2020-10-24 02:38:55,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:55,443 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 68 transitions. [2020-10-24 02:38:55,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 02:38:55,443 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 68 transitions. [2020-10-24 02:38:55,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-10-24 02:38:55,445 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:55,445 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:55,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 02:38:55,446 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:55,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:55,447 INFO L82 PathProgramCache]: Analyzing trace with hash -184005851, now seen corresponding path program 1 times [2020-10-24 02:38:55,447 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:55,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1491487763] [2020-10-24 02:38:55,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:55,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:55,647 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:38:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:55,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1491487763] [2020-10-24 02:38:55,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:55,662 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:38:55,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787652749] [2020-10-24 02:38:55,664 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:38:55,665 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:55,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:38:55,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:38:55,666 INFO L87 Difference]: Start difference. First operand 61 states and 68 transitions. Second operand 5 states. [2020-10-24 02:38:58,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:58,090 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2020-10-24 02:38:58,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:38:58,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2020-10-24 02:38:58,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:58,094 INFO L225 Difference]: With dead ends: 102 [2020-10-24 02:38:58,094 INFO L226 Difference]: Without dead ends: 77 [2020-10-24 02:38:58,095 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:38:58,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-10-24 02:38:58,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2020-10-24 02:38:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 02:38:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2020-10-24 02:38:58,124 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 45 [2020-10-24 02:38:58,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:58,125 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2020-10-24 02:38:58,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:38:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2020-10-24 02:38:58,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-10-24 02:38:58,127 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:58,127 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:58,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 02:38:58,128 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:58,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:58,128 INFO L82 PathProgramCache]: Analyzing trace with hash 7172381, now seen corresponding path program 1 times [2020-10-24 02:38:58,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:58,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1547391403] [2020-10-24 02:38:58,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:58,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:58,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:38:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:58,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:58,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1547391403] [2020-10-24 02:38:58,429 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:58,429 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:38:58,429 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278361926] [2020-10-24 02:38:58,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:38:58,430 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:58,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:38:58,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:38:58,431 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 5 states. [2020-10-24 02:38:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:58,967 INFO L93 Difference]: Finished difference Result 101 states and 121 transitions. [2020-10-24 02:38:58,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:38:58,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2020-10-24 02:38:58,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:58,973 INFO L225 Difference]: With dead ends: 101 [2020-10-24 02:38:58,973 INFO L226 Difference]: Without dead ends: 76 [2020-10-24 02:38:58,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:38:58,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-24 02:38:59,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2020-10-24 02:38:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-24 02:38:59,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2020-10-24 02:38:59,016 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 46 [2020-10-24 02:38:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:59,017 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2020-10-24 02:38:59,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:38:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2020-10-24 02:38:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-10-24 02:38:59,023 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:59,023 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:38:59,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 02:38:59,024 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:59,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1626182229, now seen corresponding path program 1 times [2020-10-24 02:38:59,027 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:59,027 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1868464593] [2020-10-24 02:38:59,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:59,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:59,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:38:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:59,193 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1868464593] [2020-10-24 02:38:59,193 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:59,193 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:38:59,194 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102669004] [2020-10-24 02:38:59,194 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:38:59,194 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:59,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:38:59,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:38:59,196 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 5 states. [2020-10-24 02:39:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:01,596 INFO L93 Difference]: Finished difference Result 91 states and 106 transitions. [2020-10-24 02:39:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:39:01,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2020-10-24 02:39:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:01,598 INFO L225 Difference]: With dead ends: 91 [2020-10-24 02:39:01,598 INFO L226 Difference]: Without dead ends: 66 [2020-10-24 02:39:01,599 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:39:01,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-24 02:39:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2020-10-24 02:39:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-24 02:39:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2020-10-24 02:39:01,626 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 47 [2020-10-24 02:39:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:01,626 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2020-10-24 02:39:01,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:39:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2020-10-24 02:39:01,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-24 02:39:01,628 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:01,628 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:01,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 02:39:01,628 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:01,631 INFO L82 PathProgramCache]: Analyzing trace with hash 309487203, now seen corresponding path program 1 times [2020-10-24 02:39:01,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:01,634 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1035696805] [2020-10-24 02:39:01,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:01,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:01,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:01,926 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1035696805] [2020-10-24 02:39:01,926 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:01,926 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:39:01,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379312986] [2020-10-24 02:39:01,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:39:01,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:01,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:39:01,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:39:01,931 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 5 states. [2020-10-24 02:39:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:02,369 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2020-10-24 02:39:02,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:39:02,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2020-10-24 02:39:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:02,371 INFO L225 Difference]: With dead ends: 99 [2020-10-24 02:39:02,371 INFO L226 Difference]: Without dead ends: 74 [2020-10-24 02:39:02,372 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:39:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-24 02:39:02,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2020-10-24 02:39:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-24 02:39:02,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2020-10-24 02:39:02,404 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 48 [2020-10-24 02:39:02,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:02,404 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2020-10-24 02:39:02,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:39:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2020-10-24 02:39:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-24 02:39:02,406 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:02,406 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:02,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 02:39:02,406 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:02,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:02,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1215752241, now seen corresponding path program 1 times [2020-10-24 02:39:02,407 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:02,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1568342559] [2020-10-24 02:39:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:02,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:02,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:02,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1568342559] [2020-10-24 02:39:02,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:02,514 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:39:02,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863750134] [2020-10-24 02:39:02,514 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:39:02,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:02,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:39:02,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:39:02,516 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 5 states. [2020-10-24 02:39:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:02,796 INFO L93 Difference]: Finished difference Result 98 states and 115 transitions. [2020-10-24 02:39:02,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:39:02,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2020-10-24 02:39:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:02,798 INFO L225 Difference]: With dead ends: 98 [2020-10-24 02:39:02,798 INFO L226 Difference]: Without dead ends: 73 [2020-10-24 02:39:02,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:39:02,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-24 02:39:02,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2020-10-24 02:39:02,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-10-24 02:39:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2020-10-24 02:39:02,841 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 49 [2020-10-24 02:39:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:02,841 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2020-10-24 02:39:02,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:39:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2020-10-24 02:39:02,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-10-24 02:39:02,849 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:02,849 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:02,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 02:39:02,850 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:02,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:02,851 INFO L82 PathProgramCache]: Analyzing trace with hash 275252137, now seen corresponding path program 1 times [2020-10-24 02:39:02,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:02,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1590604235] [2020-10-24 02:39:02,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:03,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:03,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:03,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1590604235] [2020-10-24 02:39:03,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:03,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:39:03,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658968094] [2020-10-24 02:39:03,352 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:39:03,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:03,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:39:03,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:39:03,354 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 9 states. [2020-10-24 02:39:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:06,172 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2020-10-24 02:39:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:39:06,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-10-24 02:39:06,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:06,175 INFO L225 Difference]: With dead ends: 97 [2020-10-24 02:39:06,175 INFO L226 Difference]: Without dead ends: 72 [2020-10-24 02:39:06,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:39:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-10-24 02:39:06,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2020-10-24 02:39:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-10-24 02:39:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2020-10-24 02:39:06,209 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 50 [2020-10-24 02:39:06,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:06,209 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2020-10-24 02:39:06,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:39:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2020-10-24 02:39:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-24 02:39:06,213 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:06,213 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:06,213 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 02:39:06,213 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:06,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:06,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1515582231, now seen corresponding path program 1 times [2020-10-24 02:39:06,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:06,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [536099311] [2020-10-24 02:39:06,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:06,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:06,764 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2020-10-24 02:39:06,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:06,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:06,851 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:06,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [536099311] [2020-10-24 02:39:06,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:06,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2020-10-24 02:39:06,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959680198] [2020-10-24 02:39:06,852 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-24 02:39:06,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:06,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-24 02:39:06,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2020-10-24 02:39:06,855 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand 18 states. [2020-10-24 02:39:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:08,400 INFO L93 Difference]: Finished difference Result 132 states and 163 transitions. [2020-10-24 02:39:08,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 02:39:08,400 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 51 [2020-10-24 02:39:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:08,402 INFO L225 Difference]: With dead ends: 132 [2020-10-24 02:39:08,402 INFO L226 Difference]: Without dead ends: 129 [2020-10-24 02:39:08,404 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=259, Invalid=863, Unknown=0, NotChecked=0, Total=1122 [2020-10-24 02:39:08,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-10-24 02:39:08,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 76. [2020-10-24 02:39:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-24 02:39:08,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2020-10-24 02:39:08,436 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 51 [2020-10-24 02:39:08,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:08,437 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2020-10-24 02:39:08,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-24 02:39:08,437 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2020-10-24 02:39:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-10-24 02:39:08,438 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:08,438 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:08,438 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 02:39:08,439 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:08,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:08,439 INFO L82 PathProgramCache]: Analyzing trace with hash -2080392521, now seen corresponding path program 1 times [2020-10-24 02:39:08,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:08,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1074024316] [2020-10-24 02:39:08,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:08,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:08,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:08,536 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1074024316] [2020-10-24 02:39:08,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:08,537 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:39:08,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004955199] [2020-10-24 02:39:08,537 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:39:08,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:08,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:39:08,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:39:08,539 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand 5 states. [2020-10-24 02:39:08,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:08,829 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2020-10-24 02:39:08,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:39:08,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-10-24 02:39:08,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:08,833 INFO L225 Difference]: With dead ends: 101 [2020-10-24 02:39:08,833 INFO L226 Difference]: Without dead ends: 76 [2020-10-24 02:39:08,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:39:08,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-24 02:39:08,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2020-10-24 02:39:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-10-24 02:39:08,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2020-10-24 02:39:08,890 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 51 [2020-10-24 02:39:08,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:08,891 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2020-10-24 02:39:08,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:39:08,891 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2020-10-24 02:39:08,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-10-24 02:39:08,892 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:08,892 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:08,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 02:39:08,893 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:08,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:08,893 INFO L82 PathProgramCache]: Analyzing trace with hash -695123077, now seen corresponding path program 2 times [2020-10-24 02:39:08,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:08,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1160542958] [2020-10-24 02:39:08,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:08,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:08,992 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:08,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:09,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:09,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1160542958] [2020-10-24 02:39:09,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:09,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 02:39:09,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372667392] [2020-10-24 02:39:09,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:39:09,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:09,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:39:09,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:39:09,015 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 6 states. [2020-10-24 02:39:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:09,438 INFO L93 Difference]: Finished difference Result 117 states and 138 transitions. [2020-10-24 02:39:09,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 02:39:09,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2020-10-24 02:39:09,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:09,441 INFO L225 Difference]: With dead ends: 117 [2020-10-24 02:39:09,442 INFO L226 Difference]: Without dead ends: 92 [2020-10-24 02:39:09,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:39:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-10-24 02:39:09,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2020-10-24 02:39:09,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-10-24 02:39:09,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2020-10-24 02:39:09,469 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 60 [2020-10-24 02:39:09,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:09,470 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2020-10-24 02:39:09,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:39:09,470 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2020-10-24 02:39:09,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-10-24 02:39:09,470 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:09,471 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:09,471 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 02:39:09,471 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:09,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:09,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1342407559, now seen corresponding path program 1 times [2020-10-24 02:39:09,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:09,472 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1652761956] [2020-10-24 02:39:09,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:09,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:09,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:09,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:09,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:09,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:09,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1652761956] [2020-10-24 02:39:09,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:09,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:39:09,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896800274] [2020-10-24 02:39:09,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:39:09,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:09,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:39:09,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:39:09,850 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand 9 states. [2020-10-24 02:39:10,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:10,668 INFO L93 Difference]: Finished difference Result 116 states and 136 transitions. [2020-10-24 02:39:10,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:39:10,669 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2020-10-24 02:39:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:10,670 INFO L225 Difference]: With dead ends: 116 [2020-10-24 02:39:10,670 INFO L226 Difference]: Without dead ends: 91 [2020-10-24 02:39:10,671 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-10-24 02:39:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-24 02:39:10,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2020-10-24 02:39:10,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-24 02:39:10,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 86 transitions. [2020-10-24 02:39:10,700 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 86 transitions. Word has length 61 [2020-10-24 02:39:10,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:10,701 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 86 transitions. [2020-10-24 02:39:10,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:39:10,701 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 86 transitions. [2020-10-24 02:39:10,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-10-24 02:39:10,702 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:10,702 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:10,702 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 02:39:10,703 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:10,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:10,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1111402625, now seen corresponding path program 1 times [2020-10-24 02:39:10,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:10,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1384204345] [2020-10-24 02:39:10,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:11,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:11,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:11,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:11,188 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:11,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1384204345] [2020-10-24 02:39:11,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:11,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:39:11,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906510194] [2020-10-24 02:39:11,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:39:11,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:11,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:39:11,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:39:11,195 INFO L87 Difference]: Start difference. First operand 79 states and 86 transitions. Second operand 10 states. [2020-10-24 02:39:12,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:12,060 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2020-10-24 02:39:12,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:39:12,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2020-10-24 02:39:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:12,063 INFO L225 Difference]: With dead ends: 115 [2020-10-24 02:39:12,063 INFO L226 Difference]: Without dead ends: 90 [2020-10-24 02:39:12,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:39:12,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-24 02:39:12,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2020-10-24 02:39:12,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-24 02:39:12,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2020-10-24 02:39:12,094 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 62 [2020-10-24 02:39:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:12,094 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2020-10-24 02:39:12,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:39:12,095 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2020-10-24 02:39:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-24 02:39:12,095 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:12,095 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:12,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 02:39:12,096 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:12,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash -724728243, now seen corresponding path program 1 times [2020-10-24 02:39:12,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:12,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [172004325] [2020-10-24 02:39:12,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:12,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:12,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:12,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:12,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [172004325] [2020-10-24 02:39:12,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:12,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:39:12,531 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209781119] [2020-10-24 02:39:12,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:39:12,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:12,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:39:12,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:39:12,533 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 10 states. [2020-10-24 02:39:13,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:13,393 INFO L93 Difference]: Finished difference Result 114 states and 132 transitions. [2020-10-24 02:39:13,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:39:13,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-10-24 02:39:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:13,395 INFO L225 Difference]: With dead ends: 114 [2020-10-24 02:39:13,395 INFO L226 Difference]: Without dead ends: 89 [2020-10-24 02:39:13,396 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:39:13,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-10-24 02:39:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2020-10-24 02:39:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-24 02:39:13,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2020-10-24 02:39:13,432 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 63 [2020-10-24 02:39:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:13,433 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2020-10-24 02:39:13,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:39:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2020-10-24 02:39:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-24 02:39:13,434 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:13,434 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:13,434 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 02:39:13,434 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:13,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:13,436 INFO L82 PathProgramCache]: Analyzing trace with hash -780155513, now seen corresponding path program 1 times [2020-10-24 02:39:13,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:13,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2032442187] [2020-10-24 02:39:13,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:13,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:13,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:13,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:13,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2032442187] [2020-10-24 02:39:13,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:13,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 02:39:13,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891077511] [2020-10-24 02:39:13,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:39:13,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:13,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:39:13,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:39:13,595 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 6 states. [2020-10-24 02:39:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:13,983 INFO L93 Difference]: Finished difference Result 113 states and 130 transitions. [2020-10-24 02:39:13,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 02:39:13,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2020-10-24 02:39:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:13,987 INFO L225 Difference]: With dead ends: 113 [2020-10-24 02:39:13,990 INFO L226 Difference]: Without dead ends: 88 [2020-10-24 02:39:13,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:39:13,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-10-24 02:39:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2020-10-24 02:39:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-24 02:39:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2020-10-24 02:39:14,020 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 64 [2020-10-24 02:39:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:14,020 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2020-10-24 02:39:14,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:39:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2020-10-24 02:39:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-24 02:39:14,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:14,021 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:14,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 02:39:14,021 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:14,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:14,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1468346093, now seen corresponding path program 1 times [2020-10-24 02:39:14,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:14,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [410762890] [2020-10-24 02:39:14,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:14,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:14,500 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:14,505 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:14,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [410762890] [2020-10-24 02:39:14,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:14,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:39:14,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658506815] [2020-10-24 02:39:14,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:39:14,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:14,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:39:14,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:39:14,534 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 10 states. [2020-10-24 02:39:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:17,601 INFO L93 Difference]: Finished difference Result 112 states and 128 transitions. [2020-10-24 02:39:17,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:39:17,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2020-10-24 02:39:17,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:17,603 INFO L225 Difference]: With dead ends: 112 [2020-10-24 02:39:17,603 INFO L226 Difference]: Without dead ends: 87 [2020-10-24 02:39:17,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2020-10-24 02:39:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-24 02:39:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2020-10-24 02:39:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-10-24 02:39:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2020-10-24 02:39:17,642 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 65 [2020-10-24 02:39:17,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:17,643 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2020-10-24 02:39:17,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:39:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2020-10-24 02:39:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-24 02:39:17,644 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:17,644 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:17,644 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 02:39:17,645 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:17,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:17,645 INFO L82 PathProgramCache]: Analyzing trace with hash -996355347, now seen corresponding path program 3 times [2020-10-24 02:39:17,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:17,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [987265194] [2020-10-24 02:39:17,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:17,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:17,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:17,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:17,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:17,818 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:17,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [987265194] [2020-10-24 02:39:17,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:17,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 02:39:17,822 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737144801] [2020-10-24 02:39:17,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:39:17,823 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:17,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:39:17,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:39:17,824 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 6 states. [2020-10-24 02:39:18,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:18,246 INFO L93 Difference]: Finished difference Result 111 states and 126 transitions. [2020-10-24 02:39:18,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 02:39:18,246 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2020-10-24 02:39:18,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:18,248 INFO L225 Difference]: With dead ends: 111 [2020-10-24 02:39:18,248 INFO L226 Difference]: Without dead ends: 86 [2020-10-24 02:39:18,249 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:39:18,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-10-24 02:39:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2020-10-24 02:39:18,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-24 02:39:18,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 91 transitions. [2020-10-24 02:39:18,296 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 91 transitions. Word has length 66 [2020-10-24 02:39:18,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:18,296 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 91 transitions. [2020-10-24 02:39:18,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:39:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 91 transitions. [2020-10-24 02:39:18,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-10-24 02:39:18,297 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:18,297 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:18,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 02:39:18,298 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:18,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:18,299 INFO L82 PathProgramCache]: Analyzing trace with hash -297362803, now seen corresponding path program 1 times [2020-10-24 02:39:18,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:18,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1132017476] [2020-10-24 02:39:18,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:18,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:18,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:18,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:18,922 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-24 02:39:18,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1132017476] [2020-10-24 02:39:18,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:18,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 02:39:18,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222957913] [2020-10-24 02:39:18,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 02:39:18,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:18,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 02:39:18,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2020-10-24 02:39:18,925 INFO L87 Difference]: Start difference. First operand 84 states and 91 transitions. Second operand 20 states. [2020-10-24 02:39:22,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:22,808 INFO L93 Difference]: Finished difference Result 128 states and 150 transitions. [2020-10-24 02:39:22,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-24 02:39:22,809 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2020-10-24 02:39:22,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:22,811 INFO L225 Difference]: With dead ends: 128 [2020-10-24 02:39:22,811 INFO L226 Difference]: Without dead ends: 125 [2020-10-24 02:39:22,813 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=292, Invalid=1114, Unknown=0, NotChecked=0, Total=1406 [2020-10-24 02:39:22,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-24 02:39:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 91. [2020-10-24 02:39:22,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-24 02:39:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2020-10-24 02:39:22,852 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 66 [2020-10-24 02:39:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:22,852 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2020-10-24 02:39:22,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 02:39:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2020-10-24 02:39:22,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-10-24 02:39:22,854 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:22,854 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:22,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 02:39:22,854 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:22,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:22,855 INFO L82 PathProgramCache]: Analyzing trace with hash 860266693, now seen corresponding path program 2 times [2020-10-24 02:39:22,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:22,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863472730] [2020-10-24 02:39:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:22,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:22,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:22,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:22,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:39:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:39:22,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863472730] [2020-10-24 02:39:22,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:22,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 02:39:22,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789664812] [2020-10-24 02:39:22,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:39:22,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:22,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:39:23,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:39:23,002 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 7 states. [2020-10-24 02:39:23,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:23,584 INFO L93 Difference]: Finished difference Result 132 states and 153 transitions. [2020-10-24 02:39:23,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 02:39:23,585 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2020-10-24 02:39:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:23,586 INFO L225 Difference]: With dead ends: 132 [2020-10-24 02:39:23,586 INFO L226 Difference]: Without dead ends: 107 [2020-10-24 02:39:23,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:39:23,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-24 02:39:23,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2020-10-24 02:39:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-24 02:39:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2020-10-24 02:39:23,625 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 75 [2020-10-24 02:39:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:23,626 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2020-10-24 02:39:23,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:39:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2020-10-24 02:39:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2020-10-24 02:39:23,627 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:23,627 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:23,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 02:39:23,627 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:23,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:23,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1980117123, now seen corresponding path program 1 times [2020-10-24 02:39:23,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:23,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [821530015] [2020-10-24 02:39:23,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:24,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:24,031 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:24,035 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:24,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:39:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:39:24,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [821530015] [2020-10-24 02:39:24,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:24,070 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:39:24,070 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530375492] [2020-10-24 02:39:24,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:39:24,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:24,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:39:24,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:39:24,072 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 10 states. [2020-10-24 02:39:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:25,114 INFO L93 Difference]: Finished difference Result 131 states and 151 transitions. [2020-10-24 02:39:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:39:25,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2020-10-24 02:39:25,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:25,116 INFO L225 Difference]: With dead ends: 131 [2020-10-24 02:39:25,116 INFO L226 Difference]: Without dead ends: 106 [2020-10-24 02:39:25,117 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2020-10-24 02:39:25,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-24 02:39:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2020-10-24 02:39:25,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-10-24 02:39:25,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2020-10-24 02:39:25,165 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 76 [2020-10-24 02:39:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:25,166 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2020-10-24 02:39:25,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:39:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2020-10-24 02:39:25,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2020-10-24 02:39:25,167 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:25,167 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:25,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 02:39:25,168 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:25,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:25,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1192352587, now seen corresponding path program 1 times [2020-10-24 02:39:25,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:25,169 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1233746117] [2020-10-24 02:39:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:27,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:27,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:27,384 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:27,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:39:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:27,412 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:39:27,413 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1233746117] [2020-10-24 02:39:27,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:27,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 02:39:27,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381289242] [2020-10-24 02:39:27,414 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:39:27,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:27,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:39:27,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=29, Unknown=1, NotChecked=0, Total=42 [2020-10-24 02:39:27,415 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 7 states. [2020-10-24 02:39:43,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:43,373 INFO L93 Difference]: Finished difference Result 150 states and 180 transitions. [2020-10-24 02:39:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:39:43,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 77 [2020-10-24 02:39:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:43,376 INFO L225 Difference]: With dead ends: 150 [2020-10-24 02:39:43,376 INFO L226 Difference]: Without dead ends: 125 [2020-10-24 02:39:43,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=44, Invalid=111, Unknown=1, NotChecked=0, Total=156 [2020-10-24 02:39:43,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-24 02:39:43,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2020-10-24 02:39:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-10-24 02:39:43,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 142 transitions. [2020-10-24 02:39:43,436 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 142 transitions. Word has length 77 [2020-10-24 02:39:43,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:43,437 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 142 transitions. [2020-10-24 02:39:43,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:39:43,437 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 142 transitions. [2020-10-24 02:39:43,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-10-24 02:39:43,438 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:43,438 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:43,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-24 02:39:43,439 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:43,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:43,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1784720579, now seen corresponding path program 1 times [2020-10-24 02:39:43,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:43,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1756235602] [2020-10-24 02:39:43,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:44,054 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:44,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:44,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:44,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:44,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:39:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:39:44,136 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1756235602] [2020-10-24 02:39:44,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:44,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 02:39:44,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513059988] [2020-10-24 02:39:44,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:39:44,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:44,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:39:44,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:39:44,141 INFO L87 Difference]: Start difference. First operand 122 states and 142 transitions. Second operand 11 states. [2020-10-24 02:39:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:45,367 INFO L93 Difference]: Finished difference Result 185 states and 228 transitions. [2020-10-24 02:39:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:39:45,368 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 78 [2020-10-24 02:39:45,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:45,372 INFO L225 Difference]: With dead ends: 185 [2020-10-24 02:39:45,372 INFO L226 Difference]: Without dead ends: 132 [2020-10-24 02:39:45,373 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:39:45,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2020-10-24 02:39:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 124. [2020-10-24 02:39:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-10-24 02:39:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 144 transitions. [2020-10-24 02:39:45,438 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 144 transitions. Word has length 78 [2020-10-24 02:39:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:45,438 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 144 transitions. [2020-10-24 02:39:45,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:39:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 144 transitions. [2020-10-24 02:39:45,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-24 02:39:45,439 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:45,439 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:45,439 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-24 02:39:45,439 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:45,440 INFO L82 PathProgramCache]: Analyzing trace with hash -296653359, now seen corresponding path program 1 times [2020-10-24 02:39:45,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:45,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [725112976] [2020-10-24 02:39:45,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:45,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:45,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:45,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:45,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:45,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:39:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:39:45,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [725112976] [2020-10-24 02:39:45,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:45,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 02:39:45,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826365273] [2020-10-24 02:39:45,604 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:39:45,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:45,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:39:45,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:39:45,605 INFO L87 Difference]: Start difference. First operand 124 states and 144 transitions. Second operand 7 states. [2020-10-24 02:39:46,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:46,224 INFO L93 Difference]: Finished difference Result 181 states and 223 transitions. [2020-10-24 02:39:46,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 02:39:46,227 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2020-10-24 02:39:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:46,229 INFO L225 Difference]: With dead ends: 181 [2020-10-24 02:39:46,229 INFO L226 Difference]: Without dead ends: 128 [2020-10-24 02:39:46,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:39:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2020-10-24 02:39:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2020-10-24 02:39:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2020-10-24 02:39:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 146 transitions. [2020-10-24 02:39:46,315 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 146 transitions. Word has length 79 [2020-10-24 02:39:46,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:46,315 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 146 transitions. [2020-10-24 02:39:46,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:39:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 146 transitions. [2020-10-24 02:39:46,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-10-24 02:39:46,316 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:46,316 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:46,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-24 02:39:46,317 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:46,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:46,317 INFO L82 PathProgramCache]: Analyzing trace with hash 635318793, now seen corresponding path program 1 times [2020-10-24 02:39:46,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:46,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1083956081] [2020-10-24 02:39:46,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:46,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:46,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:46,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:46,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:46,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:46,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:46,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:46,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:39:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:47,034 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-10-24 02:39:47,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1083956081] [2020-10-24 02:39:47,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:47,035 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 02:39:47,038 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720930402] [2020-10-24 02:39:47,039 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 02:39:47,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:47,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 02:39:47,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=354, Unknown=0, NotChecked=0, Total=462 [2020-10-24 02:39:47,040 INFO L87 Difference]: Start difference. First operand 126 states and 146 transitions. Second operand 22 states. [2020-10-24 02:39:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:48,946 INFO L93 Difference]: Finished difference Result 151 states and 177 transitions. [2020-10-24 02:39:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 02:39:48,947 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 80 [2020-10-24 02:39:48,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:48,949 INFO L225 Difference]: With dead ends: 151 [2020-10-24 02:39:48,949 INFO L226 Difference]: Without dead ends: 148 [2020-10-24 02:39:48,950 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2020-10-24 02:39:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-10-24 02:39:49,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 133. [2020-10-24 02:39:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2020-10-24 02:39:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 153 transitions. [2020-10-24 02:39:49,031 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 153 transitions. Word has length 80 [2020-10-24 02:39:49,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:49,032 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 153 transitions. [2020-10-24 02:39:49,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 02:39:49,032 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 153 transitions. [2020-10-24 02:39:49,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-10-24 02:39:49,033 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:49,033 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:49,033 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-24 02:39:49,034 INFO L429 AbstractCegarLoop]: === Iteration 24 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:49,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:49,034 INFO L82 PathProgramCache]: Analyzing trace with hash 987477193, now seen corresponding path program 2 times [2020-10-24 02:39:49,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:49,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [675300541] [2020-10-24 02:39:49,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:49,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:49,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:49,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:49,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:39:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:49,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:39:49,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 17 proven. 48 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:39:49,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [675300541] [2020-10-24 02:39:49,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:49,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 02:39:49,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312301563] [2020-10-24 02:39:49,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:39:49,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:49,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:39:49,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:39:49,234 INFO L87 Difference]: Start difference. First operand 133 states and 153 transitions. Second operand 8 states. [2020-10-24 02:39:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:49,991 INFO L93 Difference]: Finished difference Result 202 states and 248 transitions. [2020-10-24 02:39:49,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:39:49,992 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2020-10-24 02:39:49,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:49,993 INFO L225 Difference]: With dead ends: 202 [2020-10-24 02:39:49,994 INFO L226 Difference]: Without dead ends: 149 [2020-10-24 02:39:49,994 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:39:49,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2020-10-24 02:39:50,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2020-10-24 02:39:50,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2020-10-24 02:39:50,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 155 transitions. [2020-10-24 02:39:50,064 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 155 transitions. Word has length 89 [2020-10-24 02:39:50,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:50,065 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 155 transitions. [2020-10-24 02:39:50,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:39:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 155 transitions. [2020-10-24 02:39:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2020-10-24 02:39:50,066 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:50,066 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:50,066 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-24 02:39:50,066 INFO L429 AbstractCegarLoop]: === Iteration 25 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:50,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:50,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1963408377, now seen corresponding path program 1 times [2020-10-24 02:39:50,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:50,067 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1908396951] [2020-10-24 02:39:50,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:50,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:50,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:50,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:50,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:39:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:50,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:39:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:39:50,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1908396951] [2020-10-24 02:39:50,575 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:50,575 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 02:39:50,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875601654] [2020-10-24 02:39:50,576 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:39:50,576 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:50,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:39:50,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:39:50,577 INFO L87 Difference]: Start difference. First operand 135 states and 155 transitions. Second operand 11 states. [2020-10-24 02:39:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:51,864 INFO L93 Difference]: Finished difference Result 201 states and 246 transitions. [2020-10-24 02:39:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 02:39:51,865 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 90 [2020-10-24 02:39:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:51,866 INFO L225 Difference]: With dead ends: 201 [2020-10-24 02:39:51,866 INFO L226 Difference]: Without dead ends: 148 [2020-10-24 02:39:51,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2020-10-24 02:39:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-10-24 02:39:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 136. [2020-10-24 02:39:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2020-10-24 02:39:51,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2020-10-24 02:39:51,927 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 90 [2020-10-24 02:39:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:51,927 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2020-10-24 02:39:51,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:39:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2020-10-24 02:39:51,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2020-10-24 02:39:51,928 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:51,929 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:39:51,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-24 02:39:51,929 INFO L429 AbstractCegarLoop]: === Iteration 26 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:51,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:51,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1112408497, now seen corresponding path program 1 times [2020-10-24 02:39:51,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:51,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1863055053] [2020-10-24 02:39:51,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:54,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:54,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:39:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:54,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:39:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:54,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:39:54,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:54,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:39:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:54,328 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 16 proven. 54 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:39:54,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1863055053] [2020-10-24 02:39:54,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:54,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:39:54,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463212972] [2020-10-24 02:39:54,329 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:39:54,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:54,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:39:54,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:39:54,332 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand 9 states. [2020-10-24 02:40:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:21,016 INFO L93 Difference]: Finished difference Result 196 states and 238 transitions. [2020-10-24 02:40:21,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 02:40:21,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2020-10-24 02:40:21,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:21,018 INFO L225 Difference]: With dead ends: 196 [2020-10-24 02:40:21,018 INFO L226 Difference]: Without dead ends: 143 [2020-10-24 02:40:21,019 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=60, Invalid=149, Unknown=1, NotChecked=0, Total=210 [2020-10-24 02:40:21,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-10-24 02:40:21,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2020-10-24 02:40:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-10-24 02:40:21,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2020-10-24 02:40:21,090 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 91 [2020-10-24 02:40:21,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:21,091 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2020-10-24 02:40:21,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:40:21,091 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2020-10-24 02:40:21,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2020-10-24 02:40:21,092 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:21,092 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:21,092 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-24 02:40:21,092 INFO L429 AbstractCegarLoop]: === Iteration 27 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:21,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:21,093 INFO L82 PathProgramCache]: Analyzing trace with hash -943396289, now seen corresponding path program 1 times [2020-10-24 02:40:21,093 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:21,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1151170919] [2020-10-24 02:40:21,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:21,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:21,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:40:21,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:21,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:40:21,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:21,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:40:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:21,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:40:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 57 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:40:21,746 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1151170919] [2020-10-24 02:40:21,747 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:21,747 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:40:21,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30023338] [2020-10-24 02:40:21,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:40:21,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:21,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:40:21,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:40:21,748 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand 12 states. [2020-10-24 02:40:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:23,085 INFO L93 Difference]: Finished difference Result 194 states and 236 transitions. [2020-10-24 02:40:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 02:40:23,086 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 92 [2020-10-24 02:40:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:23,087 INFO L225 Difference]: With dead ends: 194 [2020-10-24 02:40:23,088 INFO L226 Difference]: Without dead ends: 141 [2020-10-24 02:40:23,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:40:23,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2020-10-24 02:40:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2020-10-24 02:40:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-10-24 02:40:23,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 159 transitions. [2020-10-24 02:40:23,190 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 159 transitions. Word has length 92 [2020-10-24 02:40:23,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:23,191 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 159 transitions. [2020-10-24 02:40:23,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:40:23,191 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 159 transitions. [2020-10-24 02:40:23,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2020-10-24 02:40:23,193 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:23,193 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:23,194 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-24 02:40:23,194 INFO L429 AbstractCegarLoop]: === Iteration 28 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:23,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:23,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1031069653, now seen corresponding path program 1 times [2020-10-24 02:40:23,194 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:23,195 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1393827943] [2020-10-24 02:40:23,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:23,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:23,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:40:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:23,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:40:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:23,977 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:40:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:23,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:40:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 02:40:24,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1393827943] [2020-10-24 02:40:24,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:24,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 02:40:24,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776490172] [2020-10-24 02:40:24,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 02:40:24,039 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:24,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 02:40:24,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2020-10-24 02:40:24,040 INFO L87 Difference]: Start difference. First operand 139 states and 159 transitions. Second operand 24 states. [2020-10-24 02:40:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:26,225 INFO L93 Difference]: Finished difference Result 163 states and 188 transitions. [2020-10-24 02:40:26,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 02:40:26,226 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 93 [2020-10-24 02:40:26,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:26,228 INFO L225 Difference]: With dead ends: 163 [2020-10-24 02:40:26,228 INFO L226 Difference]: Without dead ends: 160 [2020-10-24 02:40:26,229 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=364, Invalid=1706, Unknown=0, NotChecked=0, Total=2070 [2020-10-24 02:40:26,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-24 02:40:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2020-10-24 02:40:26,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2020-10-24 02:40:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 166 transitions. [2020-10-24 02:40:26,336 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 166 transitions. Word has length 93 [2020-10-24 02:40:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:26,336 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 166 transitions. [2020-10-24 02:40:26,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 02:40:26,337 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 166 transitions. [2020-10-24 02:40:26,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2020-10-24 02:40:26,337 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:26,337 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:26,338 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-10-24 02:40:26,338 INFO L429 AbstractCegarLoop]: === Iteration 29 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:26,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:26,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1744974723, now seen corresponding path program 2 times [2020-10-24 02:40:26,339 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:26,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1680201203] [2020-10-24 02:40:26,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:26,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:26,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:40:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:26,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:40:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:26,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:40:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:26,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:40:26,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:26,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:40:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:26,556 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 21 proven. 78 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 02:40:26,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1680201203] [2020-10-24 02:40:26,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:26,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:40:26,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781952621] [2020-10-24 02:40:26,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:40:26,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:26,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:40:26,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:40:26,558 INFO L87 Difference]: Start difference. First operand 146 states and 166 transitions. Second operand 9 states. [2020-10-24 02:40:27,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:27,474 INFO L93 Difference]: Finished difference Result 212 states and 257 transitions. [2020-10-24 02:40:27,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:40:27,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2020-10-24 02:40:27,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:27,477 INFO L225 Difference]: With dead ends: 212 [2020-10-24 02:40:27,477 INFO L226 Difference]: Without dead ends: 159 [2020-10-24 02:40:27,478 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:40:27,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-10-24 02:40:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2020-10-24 02:40:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-24 02:40:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2020-10-24 02:40:27,587 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 102 [2020-10-24 02:40:27,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:27,588 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2020-10-24 02:40:27,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:40:27,588 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2020-10-24 02:40:27,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2020-10-24 02:40:27,589 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:27,589 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:27,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-10-24 02:40:27,590 INFO L429 AbstractCegarLoop]: === Iteration 30 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:27,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:27,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1138222395, now seen corresponding path program 1 times [2020-10-24 02:40:27,591 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:27,591 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227423843] [2020-10-24 02:40:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:28,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:28,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:40:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:28,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:40:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:28,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:40:28,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:28,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:40:28,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:28,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:40:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 20 proven. 82 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 02:40:28,300 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1227423843] [2020-10-24 02:40:28,300 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:28,300 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-10-24 02:40:28,300 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930135089] [2020-10-24 02:40:28,301 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 02:40:28,301 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:28,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 02:40:28,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-10-24 02:40:28,302 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand 12 states. [2020-10-24 02:40:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:29,751 INFO L93 Difference]: Finished difference Result 211 states and 254 transitions. [2020-10-24 02:40:29,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 02:40:29,752 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 103 [2020-10-24 02:40:29,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:29,754 INFO L225 Difference]: With dead ends: 211 [2020-10-24 02:40:29,754 INFO L226 Difference]: Without dead ends: 158 [2020-10-24 02:40:29,756 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2020-10-24 02:40:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-24 02:40:29,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2020-10-24 02:40:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2020-10-24 02:40:29,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 173 transitions. [2020-10-24 02:40:29,828 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 173 transitions. Word has length 103 [2020-10-24 02:40:29,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:29,829 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 173 transitions. [2020-10-24 02:40:29,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 02:40:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 173 transitions. [2020-10-24 02:40:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2020-10-24 02:40:29,830 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:29,830 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:29,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2020-10-24 02:40:29,830 INFO L429 AbstractCegarLoop]: === Iteration 31 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:29,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:29,831 INFO L82 PathProgramCache]: Analyzing trace with hash -903264757, now seen corresponding path program 1 times [2020-10-24 02:40:29,831 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:29,831 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [317119455] [2020-10-24 02:40:29,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:30,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:30,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:30,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:40:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:30,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:40:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:30,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:40:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:30,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:40:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:30,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:40:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-10-24 02:40:30,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [317119455] [2020-10-24 02:40:30,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:30,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-10-24 02:40:30,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649025054] [2020-10-24 02:40:30,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-24 02:40:30,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:30,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-24 02:40:30,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2020-10-24 02:40:30,758 INFO L87 Difference]: Start difference. First operand 152 states and 173 transitions. Second operand 26 states. [2020-10-24 02:40:37,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:37,631 INFO L93 Difference]: Finished difference Result 219 states and 266 transitions. [2020-10-24 02:40:37,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 02:40:37,632 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 105 [2020-10-24 02:40:37,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:37,635 INFO L225 Difference]: With dead ends: 219 [2020-10-24 02:40:37,635 INFO L226 Difference]: Without dead ends: 216 [2020-10-24 02:40:37,636 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=409, Invalid=2041, Unknown=0, NotChecked=0, Total=2450 [2020-10-24 02:40:37,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-10-24 02:40:37,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 203. [2020-10-24 02:40:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2020-10-24 02:40:37,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 247 transitions. [2020-10-24 02:40:37,747 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 247 transitions. Word has length 105 [2020-10-24 02:40:37,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:37,747 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 247 transitions. [2020-10-24 02:40:37,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-24 02:40:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 247 transitions. [2020-10-24 02:40:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-10-24 02:40:37,749 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:37,749 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:37,749 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2020-10-24 02:40:37,749 INFO L429 AbstractCegarLoop]: === Iteration 32 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:37,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:37,750 INFO L82 PathProgramCache]: Analyzing trace with hash -530971897, now seen corresponding path program 2 times [2020-10-24 02:40:37,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:37,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1698080937] [2020-10-24 02:40:37,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:37,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:37,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:37,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:40:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:37,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:40:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:37,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:40:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:37,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:40:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:37,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:40:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:37,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-10-24 02:40:37,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 25 proven. 112 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-10-24 02:40:38,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1698080937] [2020-10-24 02:40:38,011 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:38,011 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:40:38,012 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719154556] [2020-10-24 02:40:38,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:40:38,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:38,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:40:38,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:40:38,013 INFO L87 Difference]: Start difference. First operand 203 states and 247 transitions. Second operand 10 states. [2020-10-24 02:40:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:39,120 INFO L93 Difference]: Finished difference Result 277 states and 347 transitions. [2020-10-24 02:40:39,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:40:39,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2020-10-24 02:40:39,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:39,124 INFO L225 Difference]: With dead ends: 277 [2020-10-24 02:40:39,124 INFO L226 Difference]: Without dead ends: 172 [2020-10-24 02:40:39,124 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:40:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-10-24 02:40:39,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 164. [2020-10-24 02:40:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-10-24 02:40:39,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 186 transitions. [2020-10-24 02:40:39,203 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 186 transitions. Word has length 114 [2020-10-24 02:40:39,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:39,203 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 186 transitions. [2020-10-24 02:40:39,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:40:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 186 transitions. [2020-10-24 02:40:39,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-10-24 02:40:39,204 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:39,205 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:39,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2020-10-24 02:40:39,205 INFO L429 AbstractCegarLoop]: === Iteration 33 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:39,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:39,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2136126843, now seen corresponding path program 1 times [2020-10-24 02:40:39,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:39,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [993885164] [2020-10-24 02:40:39,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:39,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:39,778 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:40:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:39,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:40:39,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:39,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:40:39,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:39,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:40:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:39,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:40:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:39,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-10-24 02:40:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:39,858 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 24 proven. 117 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-10-24 02:40:39,858 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [993885164] [2020-10-24 02:40:39,859 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:39,859 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 02:40:39,859 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134316583] [2020-10-24 02:40:39,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 02:40:39,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:39,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 02:40:39,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:40:39,860 INFO L87 Difference]: Start difference. First operand 164 states and 186 transitions. Second operand 13 states. [2020-10-24 02:40:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:41,476 INFO L93 Difference]: Finished difference Result 219 states and 261 transitions. [2020-10-24 02:40:41,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 02:40:41,477 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 115 [2020-10-24 02:40:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:41,479 INFO L225 Difference]: With dead ends: 219 [2020-10-24 02:40:41,480 INFO L226 Difference]: Without dead ends: 164 [2020-10-24 02:40:41,481 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2020-10-24 02:40:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-10-24 02:40:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2020-10-24 02:40:41,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-10-24 02:40:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 182 transitions. [2020-10-24 02:40:41,561 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 182 transitions. Word has length 115 [2020-10-24 02:40:41,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:41,561 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 182 transitions. [2020-10-24 02:40:41,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 02:40:41,561 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 182 transitions. [2020-10-24 02:40:41,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-10-24 02:40:41,562 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:41,562 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:41,562 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2020-10-24 02:40:41,563 INFO L429 AbstractCegarLoop]: === Iteration 34 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:41,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:41,563 INFO L82 PathProgramCache]: Analyzing trace with hash -53103347, now seen corresponding path program 1 times [2020-10-24 02:40:41,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:41,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [250255725] [2020-10-24 02:40:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:42,419 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:42,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:40:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:42,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:40:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:42,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:40:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:42,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:40:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:42,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:40:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:42,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-10-24 02:40:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 12 proven. 134 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2020-10-24 02:40:42,518 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [250255725] [2020-10-24 02:40:42,518 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:42,518 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-10-24 02:40:42,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721911564] [2020-10-24 02:40:42,519 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-24 02:40:42,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:42,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-24 02:40:42,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2020-10-24 02:40:42,520 INFO L87 Difference]: Start difference. First operand 162 states and 182 transitions. Second operand 28 states. [2020-10-24 02:40:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:45,004 INFO L93 Difference]: Finished difference Result 186 states and 211 transitions. [2020-10-24 02:40:45,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-24 02:40:45,005 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 116 [2020-10-24 02:40:45,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:45,007 INFO L225 Difference]: With dead ends: 186 [2020-10-24 02:40:45,007 INFO L226 Difference]: Without dead ends: 183 [2020-10-24 02:40:45,008 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=460, Invalid=2402, Unknown=0, NotChecked=0, Total=2862 [2020-10-24 02:40:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2020-10-24 02:40:45,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2020-10-24 02:40:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2020-10-24 02:40:45,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 189 transitions. [2020-10-24 02:40:45,129 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 189 transitions. Word has length 116 [2020-10-24 02:40:45,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:45,129 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 189 transitions. [2020-10-24 02:40:45,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-24 02:40:45,129 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 189 transitions. [2020-10-24 02:40:45,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2020-10-24 02:40:45,130 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:45,131 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 6, 6, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:45,131 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2020-10-24 02:40:45,131 INFO L429 AbstractCegarLoop]: === Iteration 35 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:45,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:45,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1345497531, now seen corresponding path program 2 times [2020-10-24 02:40:45,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:45,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2642787] [2020-10-24 02:40:45,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:45,373 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:45,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:40:45,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:45,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:40:45,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:45,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:40:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:45,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:40:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:45,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:40:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:45,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-10-24 02:40:45,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:45,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-10-24 02:40:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 261 backedges. 29 proven. 148 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-24 02:40:45,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2642787] [2020-10-24 02:40:45,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:45,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 02:40:45,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315640162] [2020-10-24 02:40:45,425 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:40:45,425 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:45,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:40:45,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:40:45,426 INFO L87 Difference]: Start difference. First operand 169 states and 189 transitions. Second operand 11 states. [2020-10-24 02:40:46,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:46,611 INFO L93 Difference]: Finished difference Result 227 states and 269 transitions. [2020-10-24 02:40:46,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 02:40:46,612 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 125 [2020-10-24 02:40:46,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:46,614 INFO L225 Difference]: With dead ends: 227 [2020-10-24 02:40:46,614 INFO L226 Difference]: Without dead ends: 174 [2020-10-24 02:40:46,614 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:40:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-24 02:40:46,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2020-10-24 02:40:46,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-10-24 02:40:46,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 192 transitions. [2020-10-24 02:40:46,703 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 192 transitions. Word has length 125 [2020-10-24 02:40:46,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:46,704 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 192 transitions. [2020-10-24 02:40:46,704 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:40:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 192 transitions. [2020-10-24 02:40:46,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2020-10-24 02:40:46,705 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:46,705 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:46,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2020-10-24 02:40:46,705 INFO L429 AbstractCegarLoop]: === Iteration 36 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:46,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:46,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1639331331, now seen corresponding path program 1 times [2020-10-24 02:40:46,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:46,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1921545009] [2020-10-24 02:40:46,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:47,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:47,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:40:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:47,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:40:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:47,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:40:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:47,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:40:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:47,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:40:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:47,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-10-24 02:40:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:47,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-10-24 02:40:47,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 14 proven. 168 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-10-24 02:40:47,841 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1921545009] [2020-10-24 02:40:47,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:47,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2020-10-24 02:40:47,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146748810] [2020-10-24 02:40:47,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-10-24 02:40:47,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:47,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-10-24 02:40:47,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=698, Unknown=0, NotChecked=0, Total=870 [2020-10-24 02:40:47,843 INFO L87 Difference]: Start difference. First operand 172 states and 192 transitions. Second operand 30 states. [2020-10-24 02:40:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:53,079 INFO L93 Difference]: Finished difference Result 197 states and 223 transitions. [2020-10-24 02:40:53,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-10-24 02:40:53,080 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 126 [2020-10-24 02:40:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:53,083 INFO L225 Difference]: With dead ends: 197 [2020-10-24 02:40:53,083 INFO L226 Difference]: Without dead ends: 194 [2020-10-24 02:40:53,084 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=517, Invalid=2789, Unknown=0, NotChecked=0, Total=3306 [2020-10-24 02:40:53,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-10-24 02:40:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 179. [2020-10-24 02:40:53,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-10-24 02:40:53,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 199 transitions. [2020-10-24 02:40:53,200 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 199 transitions. Word has length 126 [2020-10-24 02:40:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:53,201 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 199 transitions. [2020-10-24 02:40:53,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-10-24 02:40:53,201 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 199 transitions. [2020-10-24 02:40:53,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2020-10-24 02:40:53,202 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:40:53,202 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 7, 6, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 02:40:53,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2020-10-24 02:40:53,203 INFO L429 AbstractCegarLoop]: === Iteration 37 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:40:53,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:40:53,203 INFO L82 PathProgramCache]: Analyzing trace with hash 847892309, now seen corresponding path program 2 times [2020-10-24 02:40:53,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:40:53,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1057464721] [2020-10-24 02:40:53,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:40:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:54,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:40:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:54,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2020-10-24 02:40:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:54,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2020-10-24 02:40:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:54,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2020-10-24 02:40:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:54,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2020-10-24 02:40:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:54,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2020-10-24 02:40:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:54,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2020-10-24 02:40:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:54,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2020-10-24 02:40:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:54,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2020-10-24 02:40:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:40:54,477 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 16 proven. 200 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2020-10-24 02:40:54,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1057464721] [2020-10-24 02:40:54,478 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:40:54,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2020-10-24 02:40:54,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883023490] [2020-10-24 02:40:54,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-10-24 02:40:54,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:40:54,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-10-24 02:40:54,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2020-10-24 02:40:54,481 INFO L87 Difference]: Start difference. First operand 179 states and 199 transitions. Second operand 31 states. [2020-10-24 02:40:57,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:40:57,230 INFO L93 Difference]: Finished difference Result 179 states and 199 transitions. [2020-10-24 02:40:57,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-24 02:40:57,230 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 135 [2020-10-24 02:40:57,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:40:57,231 INFO L225 Difference]: With dead ends: 179 [2020-10-24 02:40:57,231 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 02:40:57,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 895 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=532, Invalid=2774, Unknown=0, NotChecked=0, Total=3306 [2020-10-24 02:40:57,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 02:40:57,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 02:40:57,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 02:40:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 02:40:57,233 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 135 [2020-10-24 02:40:57,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:40:57,234 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 02:40:57,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-10-24 02:40:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 02:40:57,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 02:40:57,234 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2020-10-24 02:40:57,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 02:40:57,498 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 358 DAG size of output: 325 [2020-10-24 02:40:57,907 WARN L193 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 168 [2020-10-24 02:40:58,204 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 365 DAG size of output: 322 [2020-10-24 02:40:58,547 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 367 DAG size of output: 311 [2020-10-24 02:40:59,137 WARN L193 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 356 DAG size of output: 242 [2020-10-24 02:40:59,323 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 91 [2020-10-24 02:40:59,592 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 170 [2020-10-24 02:40:59,754 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 360 DAG size of output: 315 [2020-10-24 02:41:00,155 WARN L193 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2020-10-24 02:41:00,400 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 364 DAG size of output: 303 [2020-10-24 02:41:00,704 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 182 [2020-10-24 02:41:01,007 WARN L193 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 352 DAG size of output: 283 [2020-10-24 02:41:01,407 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 428 DAG size of output: 257 [2020-10-24 02:41:01,718 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 350 DAG size of output: 237 [2020-10-24 02:41:01,882 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 79 [2020-10-24 02:41:02,161 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 119 [2020-10-24 02:41:02,539 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 308 DAG size of output: 20 [2020-10-24 02:41:02,915 WARN L193 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 45 [2020-10-24 02:41:03,414 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 302 DAG size of output: 20 [2020-10-24 02:41:04,000 WARN L193 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 293 DAG size of output: 38 [2020-10-24 02:41:04,228 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 20 [2020-10-24 02:41:06,619 WARN L193 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 223 DAG size of output: 37 [2020-10-24 02:41:06,776 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 20 [2020-10-24 02:41:08,453 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 154 DAG size of output: 37 [2020-10-24 02:41:08,691 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 297 DAG size of output: 20 [2020-10-24 02:41:08,859 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 37 [2020-10-24 02:41:09,033 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 20 [2020-10-24 02:41:15,628 WARN L193 SmtUtils]: Spent 6.59 s on a formula simplification. DAG size of input: 162 DAG size of output: 46 [2020-10-24 02:41:20,425 WARN L193 SmtUtils]: Spent 4.63 s on a formula simplification. DAG size of input: 266 DAG size of output: 37 [2020-10-24 02:41:20,675 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 22 [2020-10-24 02:41:21,658 WARN L193 SmtUtils]: Spent 911.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 37 [2020-10-24 02:41:24,141 WARN L193 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 106 DAG size of output: 37 [2020-10-24 02:41:24,146 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 02:41:24,146 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 02:41:24,146 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 02:41:24,146 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 02:41:24,146 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-24 02:41:24,146 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-24 02:41:24,146 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 02:41:24,146 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-24 02:41:24,147 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 02:41:24,147 INFO L277 CegarLoopResult]: At program point L3-5(line 3) the Hoare annotation is: true [2020-10-24 02:41:24,147 INFO L270 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-10-24 02:41:24,147 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= ~SIZE~0 |old(~SIZE~0)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 02:41:24,147 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-24 02:41:24,147 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-24 02:41:24,147 INFO L270 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-10-24 02:41:24,147 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 02:41:24,148 INFO L270 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001)) [2020-10-24 02:41:24,148 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 02:41:24,148 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 02:41:24,148 INFO L274 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2020-10-24 02:41:24,148 INFO L274 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-10-24 02:41:24,148 INFO L274 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-10-24 02:41:24,148 INFO L274 CegarLoopResult]: For program point L6-3(lines 5 7) no Hoare annotation was computed. [2020-10-24 02:41:24,148 INFO L274 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2020-10-24 02:41:24,148 INFO L270 CegarLoopResult]: At program point L35-2(lines 23 38) the Hoare annotation is: (or (let ((.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0)) (.cse0 (+ main_~l~0 1))) (and (<= .cse0 .cse1) (<= .cse1 .cse0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,149 INFO L270 CegarLoopResult]: At program point L31(lines 31 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,149 INFO L270 CegarLoopResult]: At program point L27(lines 27 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-10-24 02:41:24,149 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 16 43) the Hoare annotation is: true [2020-10-24 02:41:24,149 INFO L270 CegarLoopResult]: At program point L23(lines 23 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-10-24 02:41:24,149 INFO L270 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,149 INFO L270 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,149 INFO L270 CegarLoopResult]: At program point L19-2(line 19) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,150 INFO L270 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-10-24 02:41:24,150 INFO L270 CegarLoopResult]: At program point L40-1(lines 21 41) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-10-24 02:41:24,150 INFO L270 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 2)) 2)) 2)) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,150 INFO L270 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,150 INFO L270 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-10-24 02:41:24,151 INFO L270 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-10-24 02:41:24,151 INFO L270 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,151 INFO L270 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~v5~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,151 INFO L270 CegarLoopResult]: At program point L33(lines 33 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,151 INFO L270 CegarLoopResult]: At program point L29(lines 29 38) the Hoare annotation is: (or (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967298 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,151 INFO L270 CegarLoopResult]: At program point L25(lines 25 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-10-24 02:41:24,152 INFO L277 CegarLoopResult]: At program point L21-2(lines 21 41) the Hoare annotation is: true [2020-10-24 02:41:24,152 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-24 02:41:24,152 INFO L270 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: (or (= main_~i~0 0) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,152 INFO L270 CegarLoopResult]: At program point L17-2(line 17) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,152 INFO L270 CegarLoopResult]: At program point L17-3(line 17) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,152 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 16 43) the Hoare annotation is: true [2020-10-24 02:41:24,152 INFO L270 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 (+ (* 2 (div (+ main_~l~0 (- 1)) 2)) 1)) (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967298 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,153 INFO L270 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,153 INFO L270 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,153 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 16 43) the Hoare annotation is: true [2020-10-24 02:41:24,153 INFO L270 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (let ((.cse0 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= main_~l~0 .cse0) (<= .cse0 main_~l~0)))) [2020-10-24 02:41:24,153 INFO L270 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,153 INFO L270 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,154 INFO L270 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,154 INFO L270 CegarLoopResult]: At program point L18-3(line 18) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v2~0 0)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,154 INFO L270 CegarLoopResult]: At program point L18-4(line 18) the Hoare annotation is: (or (and (= main_~v3~0 0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~v1~0 0) (= main_~l~0 0) (= main_~v4~0 0) (= main_~v2~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,154 INFO L270 CegarLoopResult]: At program point L35(lines 35 38) the Hoare annotation is: (or (not (<= ~SIZE~0 20000001)) (let ((.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~v1~0 main_~v2~0 main_~v3~0 main_~v4~0 main_~v5~0))) (and (<= (let ((.cse2 (div main_~l~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~l~0 .cse1) 6))) (+ (* 4294967296 (div (+ main_~l~0 (* .cse0 (- 6)) .cse1) 4294967296)) (* 6 .cse0) (* 4294967296 .cse2) 1)))) main_~l~0) (<= main_~l~0 .cse3) (<= .cse3 main_~l~0))) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,154 INFO L277 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2020-10-24 02:41:24,154 INFO L270 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2020-10-24 02:41:24,154 INFO L270 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,155 INFO L270 CegarLoopResult]: At program point L9(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,155 INFO L270 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: (or (not (<= 20000001 ~SIZE~0)) (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001))) [2020-10-24 02:41:24,155 INFO L270 CegarLoopResult]: At program point L9-2(lines 8 13) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (<= ~SIZE~0 20000001)) (not (= __VERIFIER_assert_~cond 0)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:41:24,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:41:24 BoogieIcfgContainer [2020-10-24 02:41:24,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 02:41:24,177 INFO L168 Benchmark]: Toolchain (without parser) took 152490.63 ms. Allocated memory was 163.6 MB in the beginning and 327.2 MB in the end (delta: 163.6 MB). Free memory was 139.6 MB in the beginning and 183.7 MB in the end (delta: -44.1 MB). Peak memory consumption was 195.9 MB. Max. memory is 8.0 GB. [2020-10-24 02:41:24,177 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 163.6 MB. Free memory is still 137.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 02:41:24,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.02 ms. Allocated memory is still 163.6 MB. Free memory was 139.0 MB in the beginning and 129.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 02:41:24,178 INFO L168 Benchmark]: Boogie Preprocessor took 37.76 ms. Allocated memory is still 163.6 MB. Free memory was 129.3 MB in the beginning and 127.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-10-24 02:41:24,179 INFO L168 Benchmark]: RCFGBuilder took 514.21 ms. Allocated memory is still 163.6 MB. Free memory was 127.7 MB in the beginning and 143.5 MB in the end (delta: -15.7 MB). Peak memory consumption was 19.6 MB. Max. memory is 8.0 GB. [2020-10-24 02:41:24,179 INFO L168 Benchmark]: TraceAbstraction took 151638.71 ms. Allocated memory was 163.6 MB in the beginning and 327.2 MB in the end (delta: 163.6 MB). Free memory was 143.5 MB in the beginning and 183.7 MB in the end (delta: -40.2 MB). Peak memory consumption was 198.3 MB. Max. memory is 8.0 GB. [2020-10-24 02:41:24,181 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 163.6 MB. Free memory is still 137.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 288.02 ms. Allocated memory is still 163.6 MB. Free memory was 139.0 MB in the beginning and 129.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 37.76 ms. Allocated memory is still 163.6 MB. Free memory was 129.3 MB in the beginning and 127.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 514.21 ms. Allocated memory is still 163.6 MB. Free memory was 127.7 MB in the beginning and 143.5 MB in the end (delta: -15.7 MB). Peak memory consumption was 19.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 151638.71 ms. Allocated memory was 163.6 MB in the beginning and 327.2 MB in the end (delta: 163.6 MB). Free memory was 143.5 MB in the beginning and 183.7 MB in the end (delta: -40.2 MB). Peak memory consumption was 198.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (!(SIZE <= 20000001) || !(20000001 <= SIZE)) || (l <= i + j + k + v1 + v2 + v3 + v4 + v5 && i + j + k + v1 + v2 + v3 + v4 + v5 <= l) - ProcedureContractResult [Line: 3]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 16]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: ((\old(cond) == 0 || !(SIZE <= 20000001)) || !(cond == 0)) || !(20000001 <= SIZE) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 124.6s, OverallIterations: 37, TraceHistogramMax: 9, AutomataDifference: 100.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 26.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1579 SDtfs, 6378 SDslu, 3334 SDs, 0 SdLazy, 12863 SolverSat, 1229 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 69.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1075 GetRequests, 353 SyntacticMatches, 18 SemanticMatches, 704 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5308 ImplicationChecksByTransitivity, 37.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=203occurred in iteration=31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 37 MinimizatonAttempts, 427 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 61 LocationsWithAnnotation, 607 PreInvPairs, 761 NumberOfFragments, 1500 HoareAnnotationTreeSize, 607 FomulaSimplifications, 38220477361 FormulaSimplificationTreeSizeReduction, 4.9s HoareSimplificationTime, 61 FomulaSimplificationsInter, 35156 FormulaSimplificationTreeSizeReductionInter, 21.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 2891 NumberOfCodeBlocks, 2891 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2854 ConstructedInterpolants, 0 QuantifiedInterpolants, 2766733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 1 PerfectInterpolantSequences, 1209/2919 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...