/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/sumt4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 02:38:32,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 02:38:32,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 02:38:32,397 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 02:38:32,398 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 02:38:32,399 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 02:38:32,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 02:38:32,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 02:38:32,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 02:38:32,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 02:38:32,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 02:38:32,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 02:38:32,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 02:38:32,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 02:38:32,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 02:38:32,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 02:38:32,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 02:38:32,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 02:38:32,422 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 02:38:32,427 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 02:38:32,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 02:38:32,435 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 02:38:32,436 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 02:38:32,437 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 02:38:32,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 02:38:32,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 02:38:32,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 02:38:32,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 02:38:32,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 02:38:32,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 02:38:32,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 02:38:32,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 02:38:32,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 02:38:32,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 02:38:32,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 02:38:32,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 02:38:32,465 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 02:38:32,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 02:38:32,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 02:38:32,467 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 02:38:32,468 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 02:38:32,469 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:32,483 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 02:38:32,483 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 02:38:32,487 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 02:38:32,488 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 02:38:32,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 02:38:32,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 02:38:32,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 02:38:32,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 02:38:32,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 02:38:32,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 02:38:32,490 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 02:38:32,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 02:38:32,490 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 02:38:32,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 02:38:32,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 02:38:32,491 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 02:38:32,492 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 02:38:32,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 02:38:32,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 02:38:32,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 02:38:32,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 02:38:32,493 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 02:38:32,493 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:32,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 02:38:32,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 02:38:32,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 02:38:32,949 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 02:38:32,949 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 02:38:32,951 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt4.c [2020-10-24 02:38:33,041 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff23a97ae/01aa267f64fd4a6db2256a71960633bc/FLAG76f5097af [2020-10-24 02:38:33,704 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 02:38:33,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt4.c [2020-10-24 02:38:33,713 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff23a97ae/01aa267f64fd4a6db2256a71960633bc/FLAG76f5097af [2020-10-24 02:38:34,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff23a97ae/01aa267f64fd4a6db2256a71960633bc [2020-10-24 02:38:34,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 02:38:34,089 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 02:38:34,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 02:38:34,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 02:38:34,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 02:38:34,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:34" (1/1) ... [2020-10-24 02:38:34,100 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461e5515 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:34, skipping insertion in model container [2020-10-24 02:38:34,101 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:38:34" (1/1) ... [2020-10-24 02:38:34,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 02:38:34,126 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 02:38:34,306 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:38:34,317 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 02:38:34,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 02:38:34,359 INFO L208 MainTranslator]: Completed translation [2020-10-24 02:38:34,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:34 WrapperNode [2020-10-24 02:38:34,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 02:38:34,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 02:38:34,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 02:38:34,362 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 02:38:34,377 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:34" (1/1) ... [2020-10-24 02:38:34,377 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:34" (1/1) ... [2020-10-24 02:38:34,386 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:34" (1/1) ... [2020-10-24 02:38:34,387 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:34" (1/1) ... [2020-10-24 02:38:34,394 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:34" (1/1) ... [2020-10-24 02:38:34,399 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:34" (1/1) ... [2020-10-24 02:38:34,401 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:34" (1/1) ... [2020-10-24 02:38:34,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 02:38:34,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 02:38:34,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 02:38:34,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 02:38:34,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:34" (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:34,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 02:38:34,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 02:38:34,498 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 02:38:34,499 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-10-24 02:38:34,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-10-24 02:38:34,499 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 02:38:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 02:38:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 02:38:34,500 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 02:38:34,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 02:38:34,500 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-10-24 02:38:34,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-10-24 02:38:34,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-10-24 02:38:34,500 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 02:38:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 02:38:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 02:38:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 02:38:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 02:38:34,501 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 02:38:34,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 02:38:34,966 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 02:38:34,966 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-10-24 02:38:34,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:34 BoogieIcfgContainer [2020-10-24 02:38:34,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 02:38:34,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 02:38:34,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 02:38:34,975 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 02:38:34,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:38:34" (1/3) ... [2020-10-24 02:38:34,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6d5292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:34, skipping insertion in model container [2020-10-24 02:38:34,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:38:34" (2/3) ... [2020-10-24 02:38:34,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c6d5292 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:38:34, skipping insertion in model container [2020-10-24 02:38:34,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:38:34" (3/3) ... [2020-10-24 02:38:34,979 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt4.c [2020-10-24 02:38:34,992 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 02:38:34,999 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 02:38:35,014 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 02:38:35,041 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 02:38:35,041 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 02:38:35,042 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 02:38:35,042 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 02:38:35,042 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 02:38:35,042 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 02:38:35,042 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 02:38:35,042 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 02:38:35,059 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2020-10-24 02:38:35,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-24 02:38:35,069 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:35,070 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] [2020-10-24 02:38:35,070 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:35,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:35,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2124698403, now seen corresponding path program 1 times [2020-10-24 02:38:35,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:35,088 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1163678983] [2020-10-24 02:38:35,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:35,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:35,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:35,554 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:35,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1163678983] [2020-10-24 02:38:35,558 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:38:35,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-24 02:38:35,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260732380] [2020-10-24 02:38:35,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-24 02:38:35,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:35,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-24 02:38:35,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 02:38:35,595 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2020-10-24 02:38:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:35,759 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2020-10-24 02:38:35,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-24 02:38:35,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2020-10-24 02:38:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:35,772 INFO L225 Difference]: With dead ends: 61 [2020-10-24 02:38:35,772 INFO L226 Difference]: Without dead ends: 37 [2020-10-24 02:38:35,776 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 02:38:35,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-10-24 02:38:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-10-24 02:38:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-24 02:38:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2020-10-24 02:38:35,831 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 28 [2020-10-24 02:38:35,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:35,832 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2020-10-24 02:38:35,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-24 02:38:35,832 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-10-24 02:38:35,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-24 02:38:35,833 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:35,833 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] [2020-10-24 02:38:35,834 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 02:38:35,834 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:35,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1454540118, now seen corresponding path program 1 times [2020-10-24 02:38:35,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:35,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [66241482] [2020-10-24 02:38:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:36,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:36,165 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:36,166 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [66241482] [2020-10-24 02:38:36,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 02:38:36,166 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-24 02:38:36,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043375812] [2020-10-24 02:38:36,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:38:36,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:36,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:38:36,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:38:36,171 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 10 states. [2020-10-24 02:38:36,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:36,835 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2020-10-24 02:38:36,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:38:36,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-10-24 02:38:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:36,840 INFO L225 Difference]: With dead ends: 89 [2020-10-24 02:38:36,840 INFO L226 Difference]: Without dead ends: 71 [2020-10-24 02:38:36,842 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2020-10-24 02:38:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-24 02:38:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2020-10-24 02:38:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-24 02:38:36,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2020-10-24 02:38:36,862 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 28 [2020-10-24 02:38:36,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:36,863 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2020-10-24 02:38:36,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:38:36,863 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2020-10-24 02:38:36,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-24 02:38:36,864 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:36,865 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] [2020-10-24 02:38:36,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 02:38:36,865 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:36,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:36,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1716557418, now seen corresponding path program 1 times [2020-10-24 02:38:36,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:36,867 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [188138086] [2020-10-24 02:38:36,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:36,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:37,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:37,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [188138086] [2020-10-24 02:38:37,441 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:37,441 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 02:38:37,442 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782946781] [2020-10-24 02:38:37,442 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 02:38:37,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:37,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 02:38:37,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2020-10-24 02:38:37,444 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 14 states. [2020-10-24 02:38:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:40,278 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2020-10-24 02:38:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 02:38:40,279 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2020-10-24 02:38:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:40,280 INFO L225 Difference]: With dead ends: 55 [2020-10-24 02:38:40,281 INFO L226 Difference]: Without dead ends: 49 [2020-10-24 02:38:40,282 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2020-10-24 02:38:40,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-24 02:38:40,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2020-10-24 02:38:40,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-24 02:38:40,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2020-10-24 02:38:40,298 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 32 [2020-10-24 02:38:40,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:40,298 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2020-10-24 02:38:40,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 02:38:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2020-10-24 02:38:40,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-10-24 02:38:40,300 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:40,300 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] [2020-10-24 02:38:40,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 02:38:40,301 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:40,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:40,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1738014078, now seen corresponding path program 2 times [2020-10-24 02:38:40,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:40,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1290384763] [2020-10-24 02:38:40,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:40,414 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:40,439 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:40,439 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1290384763] [2020-10-24 02:38:40,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:40,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:38:40,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100352857] [2020-10-24 02:38:40,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:38:40,443 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:40,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:38:40,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:38:40,444 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 5 states. [2020-10-24 02:38:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:40,708 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2020-10-24 02:38:40,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:38:40,708 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2020-10-24 02:38:40,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:40,710 INFO L225 Difference]: With dead ends: 64 [2020-10-24 02:38:40,710 INFO L226 Difference]: Without dead ends: 49 [2020-10-24 02:38:40,713 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-10-24 02:38:40,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2020-10-24 02:38:40,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-24 02:38:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2020-10-24 02:38:40,747 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 36 [2020-10-24 02:38:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:40,748 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2020-10-24 02:38:40,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:38:40,748 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2020-10-24 02:38:40,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-24 02:38:40,751 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:40,751 INFO L422 BasicCegarLoop]: trace histogram [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:40,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 02:38:40,751 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:40,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:40,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1007706177, now seen corresponding path program 1 times [2020-10-24 02:38:40,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:40,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1065789606] [2020-10-24 02:38:40,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:41,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:41,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1065789606] [2020-10-24 02:38:41,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:41,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:38:41,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391758282] [2020-10-24 02:38:41,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:38:41,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:41,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:38:41,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:38:41,165 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 9 states. [2020-10-24 02:38:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:48,263 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2020-10-24 02:38:48,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:38:48,265 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2020-10-24 02:38:48,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:48,267 INFO L225 Difference]: With dead ends: 78 [2020-10-24 02:38:48,267 INFO L226 Difference]: Without dead ends: 63 [2020-10-24 02:38:48,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2020-10-24 02:38:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-24 02:38:48,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2020-10-24 02:38:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2020-10-24 02:38:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2020-10-24 02:38:48,300 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 37 [2020-10-24 02:38:48,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:48,301 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2020-10-24 02:38:48,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:38:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2020-10-24 02:38:48,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-24 02:38:48,305 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:48,305 INFO L422 BasicCegarLoop]: trace histogram [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:38:48,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 02:38:48,307 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:48,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:48,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1709925144, now seen corresponding path program 1 times [2020-10-24 02:38:48,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:48,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1991394052] [2020-10-24 02:38:48,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:48,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:48,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:48,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1991394052] [2020-10-24 02:38:48,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:48,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2020-10-24 02:38:48,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529427552] [2020-10-24 02:38:48,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-24 02:38:48,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:48,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-24 02:38:48,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-24 02:38:48,465 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand 5 states. [2020-10-24 02:38:48,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:48,699 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2020-10-24 02:38:48,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 02:38:48,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2020-10-24 02:38:48,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:48,701 INFO L225 Difference]: With dead ends: 62 [2020-10-24 02:38:48,701 INFO L226 Difference]: Without dead ends: 47 [2020-10-24 02:38:48,702 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:48,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-24 02:38:48,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2020-10-24 02:38:48,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-24 02:38:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-10-24 02:38:48,738 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 38 [2020-10-24 02:38:48,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:48,738 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-10-24 02:38:48,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-24 02:38:48,739 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-10-24 02:38:48,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-10-24 02:38:48,740 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:48,740 INFO L422 BasicCegarLoop]: trace histogram [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:38:48,741 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 02:38:48,741 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:48,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:48,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1515992760, now seen corresponding path program 1 times [2020-10-24 02:38:48,742 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:48,742 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [544304690] [2020-10-24 02:38:48,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:48,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:49,211 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2020-10-24 02:38:49,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:49,431 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:49,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [544304690] [2020-10-24 02:38:49,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:49,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 02:38:49,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63298756] [2020-10-24 02:38:49,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 02:38:49,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:49,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 02:38:49,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-10-24 02:38:49,435 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 16 states. [2020-10-24 02:38:52,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:52,576 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2020-10-24 02:38:52,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 02:38:52,577 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2020-10-24 02:38:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:52,579 INFO L225 Difference]: With dead ends: 70 [2020-10-24 02:38:52,579 INFO L226 Difference]: Without dead ends: 64 [2020-10-24 02:38:52,580 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2020-10-24 02:38:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-24 02:38:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2020-10-24 02:38:52,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-24 02:38:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2020-10-24 02:38:52,611 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 38 [2020-10-24 02:38:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:52,613 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2020-10-24 02:38:52,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 02:38:52,613 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2020-10-24 02:38:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-24 02:38:52,616 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:52,616 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 02:38:52,616 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 02:38:52,617 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:52,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:52,617 INFO L82 PathProgramCache]: Analyzing trace with hash 824100556, now seen corresponding path program 2 times [2020-10-24 02:38:52,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:52,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1390213617] [2020-10-24 02:38:52,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:52,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:52,796 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:52,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1390213617] [2020-10-24 02:38:52,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:52,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-10-24 02:38:52,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725606193] [2020-10-24 02:38:52,799 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 02:38:52,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:52,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 02:38:52,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 02:38:52,802 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 6 states. [2020-10-24 02:38:53,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:53,113 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2020-10-24 02:38:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 02:38:53,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-10-24 02:38:53,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:53,115 INFO L225 Difference]: With dead ends: 70 [2020-10-24 02:38:53,115 INFO L226 Difference]: Without dead ends: 55 [2020-10-24 02:38:53,116 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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:38:53,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-10-24 02:38:53,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2020-10-24 02:38:53,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-24 02:38:53,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2020-10-24 02:38:53,138 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 42 [2020-10-24 02:38:53,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:53,138 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2020-10-24 02:38:53,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 02:38:53,138 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2020-10-24 02:38:53,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-10-24 02:38:53,139 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:53,139 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 02:38:53,140 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 02:38:53,140 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:53,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:53,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1553809229, now seen corresponding path program 1 times [2020-10-24 02:38:53,141 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:53,141 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [181839089] [2020-10-24 02:38:53,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:53,543 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 26 [2020-10-24 02:38:53,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:53,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [181839089] [2020-10-24 02:38:53,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:53,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 02:38:53,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280801561] [2020-10-24 02:38:53,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:38:53,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:53,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:38:53,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:38:53,614 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 8 states. [2020-10-24 02:38:54,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:54,175 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2020-10-24 02:38:54,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:38:54,176 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2020-10-24 02:38:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:54,177 INFO L225 Difference]: With dead ends: 68 [2020-10-24 02:38:54,177 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 02:38:54,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:38:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 02:38:54,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-10-24 02:38:54,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 02:38:54,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2020-10-24 02:38:54,218 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 43 [2020-10-24 02:38:54,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:54,219 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2020-10-24 02:38:54,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:38:54,219 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2020-10-24 02:38:54,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-10-24 02:38:54,224 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:54,227 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 02:38:54,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-24 02:38:54,228 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:54,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:54,228 INFO L82 PathProgramCache]: Analyzing trace with hash -387641114, now seen corresponding path program 1 times [2020-10-24 02:38:54,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:54,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1996338103] [2020-10-24 02:38:54,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:54,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:54,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:54,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1996338103] [2020-10-24 02:38:54,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:54,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 02:38:54,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476942669] [2020-10-24 02:38:54,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 02:38:54,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:54,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 02:38:54,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2020-10-24 02:38:54,692 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 16 states. [2020-10-24 02:38:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:55,807 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2020-10-24 02:38:55,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-24 02:38:55,807 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2020-10-24 02:38:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:55,809 INFO L225 Difference]: With dead ends: 77 [2020-10-24 02:38:55,809 INFO L226 Difference]: Without dead ends: 71 [2020-10-24 02:38:55,810 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=173, Invalid=639, Unknown=0, NotChecked=0, Total=812 [2020-10-24 02:38:55,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-24 02:38:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2020-10-24 02:38:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2020-10-24 02:38:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2020-10-24 02:38:55,850 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 44 [2020-10-24 02:38:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:55,852 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2020-10-24 02:38:55,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 02:38:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2020-10-24 02:38:55,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-10-24 02:38:55,853 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:55,853 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 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:38:55,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-24 02:38:55,854 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:55,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:55,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1043519994, now seen corresponding path program 2 times [2020-10-24 02:38:55,855 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:55,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [33391795] [2020-10-24 02:38:55,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:55,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:56,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [33391795] [2020-10-24 02:38:56,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:56,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-10-24 02:38:56,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163087781] [2020-10-24 02:38:56,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-24 02:38:56,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:56,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-24 02:38:56,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-24 02:38:56,015 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 7 states. [2020-10-24 02:38:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:56,401 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2020-10-24 02:38:56,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 02:38:56,402 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2020-10-24 02:38:56,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:56,403 INFO L225 Difference]: With dead ends: 73 [2020-10-24 02:38:56,403 INFO L226 Difference]: Without dead ends: 58 [2020-10-24 02:38:56,405 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 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:38:56,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-24 02:38:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2020-10-24 02:38:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-24 02:38:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2020-10-24 02:38:56,431 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 48 [2020-10-24 02:38:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:56,431 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2020-10-24 02:38:56,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-24 02:38:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2020-10-24 02:38:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-24 02:38:56,432 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:56,433 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 02:38:56,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-24 02:38:56,433 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:56,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:56,433 INFO L82 PathProgramCache]: Analyzing trace with hash 953226053, now seen corresponding path program 1 times [2020-10-24 02:38:56,434 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:56,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1818570096] [2020-10-24 02:38:56,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:57,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:57,284 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:57,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1818570096] [2020-10-24 02:38:57,285 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:57,285 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-10-24 02:38:57,285 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781660366] [2020-10-24 02:38:57,286 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-10-24 02:38:57,286 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:57,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-24 02:38:57,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2020-10-24 02:38:57,287 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 20 states. [2020-10-24 02:38:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:38:58,797 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2020-10-24 02:38:58,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-24 02:38:58,798 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2020-10-24 02:38:58,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:38:58,799 INFO L225 Difference]: With dead ends: 72 [2020-10-24 02:38:58,800 INFO L226 Difference]: Without dead ends: 66 [2020-10-24 02:38:58,801 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2020-10-24 02:38:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-24 02:38:58,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 59. [2020-10-24 02:38:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-10-24 02:38:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2020-10-24 02:38:58,825 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 49 [2020-10-24 02:38:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:38:58,825 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2020-10-24 02:38:58,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-10-24 02:38:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2020-10-24 02:38:58,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-10-24 02:38:58,826 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:38:58,826 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 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] [2020-10-24 02:38:58,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-24 02:38:58,827 INFO L429 AbstractCegarLoop]: === Iteration 13 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:38:58,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:38:58,827 INFO L82 PathProgramCache]: Analyzing trace with hash -645360423, now seen corresponding path program 2 times [2020-10-24 02:38:58,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:38:58,828 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1905815338] [2020-10-24 02:38:58,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:38:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:59,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:38:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:38:59,840 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:38:59,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1905815338] [2020-10-24 02:38:59,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:38:59,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-10-24 02:38:59,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792298437] [2020-10-24 02:38:59,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-10-24 02:38:59,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:38:59,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-10-24 02:38:59,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2020-10-24 02:38:59,844 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 22 states. [2020-10-24 02:39:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:07,934 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2020-10-24 02:39:07,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 02:39:07,935 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2020-10-24 02:39:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:07,936 INFO L225 Difference]: With dead ends: 74 [2020-10-24 02:39:07,936 INFO L226 Difference]: Without dead ends: 68 [2020-10-24 02:39:07,937 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2020-10-24 02:39:07,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-24 02:39:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2020-10-24 02:39:07,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 02:39:07,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-10-24 02:39:07,962 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 53 [2020-10-24 02:39:07,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:07,962 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-10-24 02:39:07,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-10-24 02:39:07,962 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2020-10-24 02:39:07,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-10-24 02:39:07,963 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:07,963 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 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:07,963 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-24 02:39:07,964 INFO L429 AbstractCegarLoop]: === Iteration 14 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:07,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:07,964 INFO L82 PathProgramCache]: Analyzing trace with hash 137540678, now seen corresponding path program 3 times [2020-10-24 02:39:07,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:07,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1113645157] [2020-10-24 02:39:07,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:07,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:08,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:08,122 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:08,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1113645157] [2020-10-24 02:39:08,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:08,123 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-10-24 02:39:08,123 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359062208] [2020-10-24 02:39:08,124 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 02:39:08,124 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:08,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 02:39:08,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 02:39:08,125 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 8 states. [2020-10-24 02:39:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:10,666 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2020-10-24 02:39:10,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 02:39:10,667 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-10-24 02:39:10,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:10,668 INFO L225 Difference]: With dead ends: 78 [2020-10-24 02:39:10,668 INFO L226 Difference]: Without dead ends: 63 [2020-10-24 02:39:10,669 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-10-24 02:39:10,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-24 02:39:10,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-24 02:39:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 02:39:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2020-10-24 02:39:10,693 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 54 [2020-10-24 02:39:10,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:10,693 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2020-10-24 02:39:10,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 02:39:10,694 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2020-10-24 02:39:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-24 02:39:10,694 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:10,694 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 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] [2020-10-24 02:39:10,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-24 02:39:10,695 INFO L429 AbstractCegarLoop]: === Iteration 15 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:10,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:10,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1757228141, now seen corresponding path program 4 times [2020-10-24 02:39:10,696 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:10,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1323513772] [2020-10-24 02:39:10,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:10,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 13 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:10,876 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1323513772] [2020-10-24 02:39:10,876 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:10,876 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:39:10,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821671496] [2020-10-24 02:39:10,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:39:10,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:10,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:39:10,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:39:10,878 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand 9 states. [2020-10-24 02:39:11,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:11,480 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2020-10-24 02:39:11,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:39:11,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2020-10-24 02:39:11,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:11,484 INFO L225 Difference]: With dead ends: 85 [2020-10-24 02:39:11,484 INFO L226 Difference]: Without dead ends: 70 [2020-10-24 02:39:11,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 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:39:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-24 02:39:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2020-10-24 02:39:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-24 02:39:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2020-10-24 02:39:11,510 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 57 [2020-10-24 02:39:11,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:11,510 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2020-10-24 02:39:11,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:39:11,510 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2020-10-24 02:39:11,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-10-24 02:39:11,511 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:11,511 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 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:11,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-24 02:39:11,512 INFO L429 AbstractCegarLoop]: === Iteration 16 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:11,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:11,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1603342130, now seen corresponding path program 5 times [2020-10-24 02:39:11,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:11,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [870854730] [2020-10-24 02:39:11,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:11,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:11,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [870854730] [2020-10-24 02:39:11,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:11,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:39:11,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761109876] [2020-10-24 02:39:11,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:39:11,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:11,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:39:11,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:39:11,890 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 10 states. [2020-10-24 02:39:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:17,358 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2020-10-24 02:39:17,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 02:39:17,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2020-10-24 02:39:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:17,360 INFO L225 Difference]: With dead ends: 85 [2020-10-24 02:39:17,360 INFO L226 Difference]: Without dead ends: 70 [2020-10-24 02:39:17,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:39:17,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-24 02:39:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2020-10-24 02:39:17,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-24 02:39:17,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2020-10-24 02:39:17,392 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 58 [2020-10-24 02:39:17,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:17,393 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2020-10-24 02:39:17,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:39:17,393 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-10-24 02:39:17,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 02:39:17,394 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:17,394 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 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] [2020-10-24 02:39:17,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-24 02:39:17,394 INFO L429 AbstractCegarLoop]: === Iteration 17 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:17,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:17,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1300196793, now seen corresponding path program 6 times [2020-10-24 02:39:17,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:17,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1317376637] [2020-10-24 02:39:17,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:17,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 12 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:17,569 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1317376637] [2020-10-24 02:39:17,569 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:17,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 02:39:17,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968729386] [2020-10-24 02:39:17,570 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 02:39:17,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:17,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 02:39:17,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-24 02:39:17,571 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 9 states. [2020-10-24 02:39:18,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:18,155 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2020-10-24 02:39:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 02:39:18,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2020-10-24 02:39:18,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:18,157 INFO L225 Difference]: With dead ends: 83 [2020-10-24 02:39:18,157 INFO L226 Difference]: Without dead ends: 68 [2020-10-24 02:39:18,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 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:39:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-24 02:39:18,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2020-10-24 02:39:18,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-24 02:39:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2020-10-24 02:39:18,183 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 59 [2020-10-24 02:39:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:18,184 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2020-10-24 02:39:18,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 02:39:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2020-10-24 02:39:18,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-10-24 02:39:18,184 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:18,184 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 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] [2020-10-24 02:39:18,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-24 02:39:18,185 INFO L429 AbstractCegarLoop]: === Iteration 18 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:18,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:18,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1494129177, now seen corresponding path program 7 times [2020-10-24 02:39:18,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:18,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [942016545] [2020-10-24 02:39:18,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:19,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:19,223 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:19,223 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [942016545] [2020-10-24 02:39:19,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:19,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-10-24 02:39:19,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431788120] [2020-10-24 02:39:19,224 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-24 02:39:19,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:19,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-24 02:39:19,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2020-10-24 02:39:19,225 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 24 states. [2020-10-24 02:39:21,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:21,238 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2020-10-24 02:39:21,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-10-24 02:39:21,238 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2020-10-24 02:39:21,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:21,239 INFO L225 Difference]: With dead ends: 82 [2020-10-24 02:39:21,240 INFO L226 Difference]: Without dead ends: 76 [2020-10-24 02:39:21,241 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=229, Invalid=1663, Unknown=0, NotChecked=0, Total=1892 [2020-10-24 02:39:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-24 02:39:21,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2020-10-24 02:39:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-10-24 02:39:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2020-10-24 02:39:21,273 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 59 [2020-10-24 02:39:21,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:21,274 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2020-10-24 02:39:21,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-24 02:39:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2020-10-24 02:39:21,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-10-24 02:39:21,274 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:21,275 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 4, 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] [2020-10-24 02:39:21,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-24 02:39:21,275 INFO L429 AbstractCegarLoop]: === Iteration 19 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:21,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:21,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1004878213, now seen corresponding path program 8 times [2020-10-24 02:39:21,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:21,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1685064502] [2020-10-24 02:39:21,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:21,493 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 15 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:21,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1685064502] [2020-10-24 02:39:21,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:21,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 02:39:21,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206718822] [2020-10-24 02:39:21,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 02:39:21,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:21,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 02:39:21,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-10-24 02:39:21,508 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand 10 states. [2020-10-24 02:39:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:22,259 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2020-10-24 02:39:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 02:39:22,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2020-10-24 02:39:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:22,261 INFO L225 Difference]: With dead ends: 91 [2020-10-24 02:39:22,261 INFO L226 Difference]: Without dead ends: 76 [2020-10-24 02:39:22,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 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:39:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-10-24 02:39:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 70. [2020-10-24 02:39:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-24 02:39:22,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2020-10-24 02:39:22,288 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 63 [2020-10-24 02:39:22,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:22,289 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2020-10-24 02:39:22,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 02:39:22,289 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2020-10-24 02:39:22,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-10-24 02:39:22,290 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:22,290 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 5, 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] [2020-10-24 02:39:22,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-24 02:39:22,290 INFO L429 AbstractCegarLoop]: === Iteration 20 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:22,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:22,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1877391076, now seen corresponding path program 9 times [2020-10-24 02:39:22,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:22,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1363044796] [2020-10-24 02:39:22,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:23,253 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2020-10-24 02:39:23,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:23,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:23,537 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1363044796] [2020-10-24 02:39:23,537 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:23,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2020-10-24 02:39:23,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112128655] [2020-10-24 02:39:23,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 26 states [2020-10-24 02:39:23,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:23,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2020-10-24 02:39:23,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2020-10-24 02:39:23,540 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 26 states. [2020-10-24 02:39:25,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:25,958 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2020-10-24 02:39:25,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-10-24 02:39:25,959 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 64 [2020-10-24 02:39:25,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:25,960 INFO L225 Difference]: With dead ends: 90 [2020-10-24 02:39:25,960 INFO L226 Difference]: Without dead ends: 84 [2020-10-24 02:39:25,961 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=246, Invalid=2010, Unknown=0, NotChecked=0, Total=2256 [2020-10-24 02:39:25,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2020-10-24 02:39:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2020-10-24 02:39:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-24 02:39:25,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2020-10-24 02:39:25,990 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 64 [2020-10-24 02:39:25,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:25,990 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2020-10-24 02:39:25,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2020-10-24 02:39:25,991 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2020-10-24 02:39:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-10-24 02:39:25,991 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:25,991 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 5, 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] [2020-10-24 02:39:25,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-24 02:39:25,992 INFO L429 AbstractCegarLoop]: === Iteration 21 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:25,992 INFO L82 PathProgramCache]: Analyzing trace with hash 2144686328, now seen corresponding path program 10 times [2020-10-24 02:39:25,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:25,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1352632743] [2020-10-24 02:39:25,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:26,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:26,218 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 17 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:26,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1352632743] [2020-10-24 02:39:26,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:26,221 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 02:39:26,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918155424] [2020-10-24 02:39:26,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 02:39:26,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:26,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 02:39:26,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2020-10-24 02:39:26,224 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 11 states. [2020-10-24 02:39:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:27,126 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2020-10-24 02:39:27,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 02:39:27,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2020-10-24 02:39:27,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:27,128 INFO L225 Difference]: With dead ends: 99 [2020-10-24 02:39:27,128 INFO L226 Difference]: Without dead ends: 79 [2020-10-24 02:39:27,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2020-10-24 02:39:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-24 02:39:27,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2020-10-24 02:39:27,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-10-24 02:39:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2020-10-24 02:39:27,159 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 68 [2020-10-24 02:39:27,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:27,160 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2020-10-24 02:39:27,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 02:39:27,160 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2020-10-24 02:39:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-10-24 02:39:27,161 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:27,161 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 6, 4, 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] [2020-10-24 02:39:27,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-24 02:39:27,161 INFO L429 AbstractCegarLoop]: === Iteration 22 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:27,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:27,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1486001074, now seen corresponding path program 11 times [2020-10-24 02:39:27,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:27,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [597858070] [2020-10-24 02:39:27,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:27,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:28,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:28,607 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:28,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [597858070] [2020-10-24 02:39:28,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:28,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-10-24 02:39:28,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352683081] [2020-10-24 02:39:28,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-10-24 02:39:28,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:28,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-10-24 02:39:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2020-10-24 02:39:28,610 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand 28 states. [2020-10-24 02:39:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:31,413 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2020-10-24 02:39:31,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-10-24 02:39:31,414 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 70 [2020-10-24 02:39:31,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:31,416 INFO L225 Difference]: With dead ends: 93 [2020-10-24 02:39:31,416 INFO L226 Difference]: Without dead ends: 87 [2020-10-24 02:39:31,419 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=263, Invalid=2389, Unknown=0, NotChecked=0, Total=2652 [2020-10-24 02:39:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-24 02:39:31,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 80. [2020-10-24 02:39:31,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-24 02:39:31,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2020-10-24 02:39:31,459 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 70 [2020-10-24 02:39:31,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:31,459 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2020-10-24 02:39:31,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-10-24 02:39:31,460 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2020-10-24 02:39:31,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-10-24 02:39:31,460 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 02:39:31,460 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 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] [2020-10-24 02:39:31,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-24 02:39:31,461 INFO L429 AbstractCegarLoop]: === Iteration 23 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 02:39:31,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 02:39:31,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1116346054, now seen corresponding path program 12 times [2020-10-24 02:39:31,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 02:39:31,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1073903219] [2020-10-24 02:39:31,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 02:39:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:33,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 02:39:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 02:39:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 02:39:33,075 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1073903219] [2020-10-24 02:39:33,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 02:39:33,076 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2020-10-24 02:39:33,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215647112] [2020-10-24 02:39:33,076 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-10-24 02:39:33,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 02:39:33,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-10-24 02:39:33,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2020-10-24 02:39:33,077 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 30 states. [2020-10-24 02:39:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 02:39:36,242 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2020-10-24 02:39:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-10-24 02:39:36,242 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 74 [2020-10-24 02:39:36,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 02:39:36,243 INFO L225 Difference]: With dead ends: 80 [2020-10-24 02:39:36,243 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 02:39:36,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=281, Invalid=2799, Unknown=0, NotChecked=0, Total=3080 [2020-10-24 02:39:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 02:39:36,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 02:39:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 02:39:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 02:39:36,246 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2020-10-24 02:39:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 02:39:36,246 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 02:39:36,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-10-24 02:39:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 02:39:36,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 02:39:36,246 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-24 02:39:36,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 02:39:36,509 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 241 [2020-10-24 02:39:36,763 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 261 DAG size of output: 213 [2020-10-24 02:39:37,015 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 301 DAG size of output: 213 [2020-10-24 02:39:37,240 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 243 DAG size of output: 221 [2020-10-24 02:39:37,637 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 106 [2020-10-24 02:39:37,865 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 180 [2020-10-24 02:39:38,212 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 130 [2020-10-24 02:39:39,365 WARN L193 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 225 DAG size of output: 123 [2020-10-24 02:39:40,205 WARN L193 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 109 [2020-10-24 02:39:41,032 WARN L193 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 102 [2020-10-24 02:39:41,902 WARN L193 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 89 [2020-10-24 02:39:42,479 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 58 [2020-10-24 02:39:42,864 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 56 [2020-10-24 02:39:51,867 WARN L193 SmtUtils]: Spent 8.95 s on a formula simplification. DAG size of input: 170 DAG size of output: 81 [2020-10-24 02:39:53,660 WARN L193 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 218 DAG size of output: 127 [2020-10-24 02:39:54,091 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 62 [2020-10-24 02:39:54,100 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 3) the Hoare annotation is: true [2020-10-24 02:39:54,100 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 3) the Hoare annotation is: true [2020-10-24 02:39:54,100 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 3) the Hoare annotation is: true [2020-10-24 02:39:54,100 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) the Hoare annotation is: true [2020-10-24 02:39:54,100 INFO L277 CegarLoopResult]: At program point L3-2(line 3) the Hoare annotation is: true [2020-10-24 02:39:54,101 INFO L277 CegarLoopResult]: At program point L3-3(line 3) the Hoare annotation is: true [2020-10-24 02:39:54,101 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 02:39:54,101 INFO L277 CegarLoopResult]: At program point L3-4(line 3) the Hoare annotation is: true [2020-10-24 02:39:54,101 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 02:39:54,101 INFO L277 CegarLoopResult]: At program point L3-5(line 3) the Hoare annotation is: true [2020-10-24 02:39:54,101 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:39:54,101 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:39:54,102 INFO L277 CegarLoopResult]: At program point L3(line 3) the Hoare annotation is: true [2020-10-24 02:39:54,102 INFO L277 CegarLoopResult]: At program point L3-1(line 3) the Hoare annotation is: true [2020-10-24 02:39:54,102 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:39:54,102 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 02:39:54,102 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:39:54,102 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 02:39:54,102 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 02:39:54,102 INFO L274 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 5 7) no Hoare annotation was computed. [2020-10-24 02:39:54,102 INFO L274 CegarLoopResult]: For program point L6(line 6) no Hoare annotation was computed. [2020-10-24 02:39:54,103 INFO L274 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-10-24 02:39:54,103 INFO L274 CegarLoopResult]: For program point L6-3(lines 5 7) no Hoare annotation was computed. [2020-10-24 02:39:54,103 INFO L274 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 5 7) no Hoare annotation was computed. [2020-10-24 02:39:54,103 INFO L277 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-10-24 02:39:54,103 INFO L270 CegarLoopResult]: At program point L27(lines 27 30) the Hoare annotation is: (let ((.cse9 (div main_~l~0 4294967296))) (let ((.cse10 (* .cse9 (- 4294967296)))) (let ((.cse7 (div (+ main_~l~0 .cse10) 3)) (.cse5 (* 4294967296 (div main_~n~0 4294967296))) (.cse4 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (let ((.cse3 (<= .cse4 main_~l~0)) (.cse2 (+ .cse5 main_~l~0 1)) (.cse6 (* 4294967296 .cse9)) (.cse0 (= main_~i~0 0)) (.cse1 (= main_~j~0 0)) (.cse8 (div (+ (* .cse7 (- 3)) main_~l~0 .cse10) 4294967296))) (or (and (<= 1 main_~l~0) (= main_~k~0 0) .cse0 .cse1 (<= main_~v4~0 main_~l~0) (<= .cse2 (+ main_~n~0 main_~v4~0)) (<= main_~l~0 main_~v4~0) (<= (div main_~l~0 2) 0)) (and .cse3 (<= main_~l~0 5) (<= 5 .cse4) (<= (+ .cse5 main_~l~0 6) (+ main_~i~0 main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse6))) (and .cse3 (<= 7 .cse4) (<= .cse2 (+ main_~n~0 .cse6)) (<= (+ (* 6 .cse7) (* 8589934593 .cse8) (* 8589934592 .cse9) 2) (* 2 main_~l~0)) (<= .cse9 0) (<= main_~l~0 .cse4)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0)) (and (<= (+ .cse5 main_~l~0) (+ (* 4294967296 (div (+ main_~k~0 main_~v4~0 (- 2)) 4294967296)) main_~n~0 1)) .cse0 .cse1 (<= (+ main_~k~0 main_~v4~0) main_~l~0) (<= (+ .cse7 (* 1431655765 .cse8) (* 1431655765 .cse9)) 0) (<= 6442450942 (+ (* 3221225471 main_~l~0) (div main_~l~0 4))))))))) [2020-10-24 02:39:54,104 INFO L270 CegarLoopResult]: At program point L25(lines 25 30) the Hoare annotation is: (let ((.cse8 (div main_~l~0 4294967296))) (let ((.cse13 (* .cse8 (- 4294967296)))) (let ((.cse11 (div (+ main_~l~0 .cse13) 3)) (.cse3 (* 4294967296 (div main_~n~0 4294967296))) (.cse4 (* 4294967296 .cse8)) (.cse6 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (let ((.cse5 (<= .cse6 main_~l~0)) (.cse7 (+ main_~i~0 main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse4)) (.cse10 (+ .cse3 main_~l~0)) (.cse1 (= main_~i~0 0)) (.cse9 (= main_~j~0 0)) (.cse12 (div (+ (* .cse11 (- 3)) main_~l~0 .cse13) 4294967296)) (.cse2 (div main_~l~0 4))) (or (let ((.cse0 (+ main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse0 main_~l~0) .cse1 (<= .cse2 0) (<= (+ .cse3 main_~l~0 4) (+ main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse4)) (<= 3 main_~l~0) (<= main_~l~0 .cse0))) (and .cse5 (<= main_~l~0 5) (<= 5 .cse6) (<= (+ .cse3 main_~l~0 6) .cse7)) (and .cse5 (<= (+ .cse3 main_~l~0 1) (+ main_~n~0 .cse4)) (<= .cse8 0) (<= main_~l~0 .cse6) (<= 7 main_~l~0)) (not (<= ~SIZE~0 20000001)) (and (<= 1 main_~l~0) (= main_~k~0 0) .cse1 .cse9 (<= main_~v4~0 main_~l~0) (<= .cse10 (+ (* 4294967296 (div (+ main_~v4~0 (- 1)) 4294967296)) main_~n~0)) (<= (div main_~l~0 2) 0) (<= (+ (* 25769803776 .cse11) (* 36893488151714070528 .cse12) main_~n~0 (* 36893488151714070528 .cse8) 8569934592) (+ .cse3 (* 8589934593 main_~l~0)))) (not (<= 20000001 ~SIZE~0)) (and .cse5 (<= main_~l~0 6) (<= (+ .cse3 main_~l~0 7) .cse7) (<= 6 .cse6)) (and (<= .cse10 (+ (* 4294967296 (div (+ main_~k~0 main_~v4~0 (- 2)) 4294967296)) main_~n~0 1)) .cse1 .cse9 (<= (+ main_~k~0 main_~v4~0) main_~l~0) (<= (+ .cse11 (* 1431655765 .cse12) (* 1431655765 .cse8)) 0) (<= 6442450942 (+ (* 3221225471 main_~l~0) .cse2)))))))) [2020-10-24 02:39:54,105 INFO L270 CegarLoopResult]: At program point L27-2(lines 23 30) the Hoare annotation is: (let ((.cse11 (div main_~l~0 4294967296))) (let ((.cse4 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0)) (.cse6 (+ main_~l~0 1)) (.cse10 (* 4294967296 .cse11)) (.cse2 (* 4294967296 (div main_~n~0 4294967296)))) (let ((.cse9 (= main_~j~0 0)) (.cse8 (= main_~i~0 0)) (.cse5 (+ .cse2 main_~l~0)) (.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse10)) (.cse0 (<= .cse4 .cse6)) (.cse1 (<= .cse6 .cse4))) (or (and .cse0 .cse1 (<= main_~l~0 6) (<= (+ .cse2 main_~l~0 8) .cse3) (<= 6 main_~l~0)) (and .cse0 (<= main_~l~0 4) (<= 5 .cse4) (<= .cse5 (+ (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 5)) 4294967296)) main_~n~0 3))) (let ((.cse7 (+ main_~k~0 main_~v4~0))) (and (<= .cse6 .cse7) (<= 1 main_~l~0) .cse8 .cse9 (<= (+ .cse2 main_~l~0 2) (+ main_~k~0 main_~n~0 main_~v4~0)) (<= .cse7 .cse6) (<= main_~l~0 1))) (and (<= (+ .cse2 2) (+ main_~v4~0 main_~n~0)) (<= 1 main_~v4~0) (= main_~k~0 0) .cse8 .cse9 (= main_~l~0 0) (<= main_~v4~0 1) (<= main_~n~0 (+ .cse2 20000001))) (not (<= ~SIZE~0 20000001)) (and .cse0 (<= main_~l~0 5) (<= (+ .cse2 main_~l~0 7) .cse3) (<= 6 .cse4)) (and .cse8 (<= main_~l~0 2) (<= (+ (* 6442450944 (div main_~l~0 3)) main_~n~0 3) (+ .cse2 (* 2147483649 main_~l~0))) (<= (+ main_~j~0 main_~k~0 main_~v4~0) .cse6) (<= .cse5 (+ (* 4294967296 (div (+ main_~j~0 main_~k~0 main_~v4~0 (- 3)) 4294967296)) main_~n~0 1))) (not (<= 20000001 ~SIZE~0)) (and .cse0 (<= 4 .cse4) (<= main_~l~0 3) (<= (+ .cse2 main_~l~0 5) .cse3)) (and .cse0 (<= (+ .cse2 main_~l~0 1) (+ main_~n~0 .cse10)) .cse1 (<= 8 .cse4) (<= .cse11 0)))))) [2020-10-24 02:39:54,105 INFO L277 CegarLoopResult]: At program point mainEXIT(lines 16 35) the Hoare annotation is: true [2020-10-24 02:39:54,105 INFO L270 CegarLoopResult]: At program point L23(lines 23 30) the Hoare annotation is: (let ((.cse13 (div main_~l~0 4294967296))) (let ((.cse7 (* 4294967296 .cse13)) (.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0)) (.cse2 (* 4294967296 (div main_~n~0 4294967296)))) (let ((.cse6 (<= (div main_~l~0 4) 0)) (.cse10 (= main_~k~0 0)) (.cse5 (= main_~i~0 0)) (.cse9 (= main_~j~0 0)) (.cse8 (+ .cse2 main_~l~0)) (.cse0 (<= .cse1 main_~l~0)) (.cse3 (+ main_~i~0 main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse7))) (or (and .cse0 (<= main_~l~0 5) (<= 5 .cse1) (<= (+ .cse2 main_~l~0 6) .cse3)) (let ((.cse4 (+ main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse4 main_~l~0) .cse5 .cse6 (<= (+ .cse2 main_~l~0 4) (+ main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse7)) (<= 3 main_~l~0) (<= main_~l~0 .cse4))) (and (<= .cse8 (+ (* 4294967296 (div (+ main_~k~0 main_~v4~0 (- 2)) 4294967296)) main_~n~0 1)) .cse5 .cse9 .cse6 (<= (+ main_~k~0 main_~v4~0) main_~l~0) (<= (+ (* 6442450944 (div main_~l~0 3)) main_~n~0 3) (+ .cse2 (* 2147483649 main_~l~0)))) (and .cse10 .cse5 .cse9 (= main_~l~0 0) (= main_~v4~0 0) (<= main_~n~0 (+ .cse2 20000001)) (<= (+ .cse2 1) main_~n~0)) (and .cse0 (<= main_~l~0 4) (<= 4 .cse1) (<= .cse8 (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 4)) 4294967296)) 3))) (not (<= ~SIZE~0 20000001)) (and (<= 1 main_~l~0) .cse10 .cse5 .cse9 (<= main_~v4~0 main_~l~0) (<= .cse8 (+ (* 4294967296 (div (+ main_~v4~0 (- 1)) 4294967296)) main_~n~0)) (<= (div main_~l~0 2) 0) (<= (let ((.cse12 (* .cse13 (- 4294967296)))) (let ((.cse11 (div (+ main_~l~0 .cse12) 3))) (+ (* 25769803776 .cse11) (* 36893488151714070528 (div (+ (* .cse11 (- 3)) main_~l~0 .cse12) 4294967296)) main_~n~0 (* 36893488151714070528 .cse13) 8569934592))) (+ .cse2 (* 8589934593 main_~l~0)))) (and .cse0 (<= 7 .cse1) (<= (+ .cse2 main_~l~0 1) (+ main_~n~0 .cse7)) (<= .cse13 0) (<= main_~l~0 .cse1)) (not (<= 20000001 ~SIZE~0)) (and .cse0 (<= main_~l~0 6) (<= (+ .cse2 main_~l~0 7) .cse3) (<= 6 .cse1)))))) [2020-10-24 02:39:54,105 INFO L270 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~v4~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:39:54,106 INFO L270 CegarLoopResult]: At program point L21-2(lines 21 32) the Hoare annotation is: (let ((.cse14 (div main_~l~0 4294967296)) (.cse9 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (let ((.cse6 (* 4294967296 (div main_~n~0 4294967296))) (.cse8 (div main_~l~0 4)) (.cse11 (+ (* 4294967296 (div .cse9 4294967296)) main_~l~0)) (.cse10 (* 4294967296 .cse14))) (let ((.cse4 (< .cse11 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 .cse10 1))) (.cse5 (= main_~k~0 0)) (.cse2 (= main_~j~0 0)) (.cse1 (= main_~i~0 0)) (.cse3 (<= .cse8 0)) (.cse7 (<= .cse9 main_~l~0)) (.cse0 (+ .cse6 main_~l~0))) (or (and (<= .cse0 (+ (* 4294967296 (div (+ main_~k~0 main_~v4~0 (- 2)) 4294967296)) main_~n~0 1)) .cse1 .cse2 .cse3 (<= (+ main_~k~0 main_~v4~0) main_~l~0) (<= 2 main_~l~0) .cse4) (and .cse5 .cse1 .cse2 (= main_~l~0 0) (= main_~v4~0 0) (<= main_~n~0 (+ .cse6 20000001))) (and .cse7 (<= .cse8 1) (<= 5 .cse9) .cse4) (and .cse7 (<= main_~l~0 4) (<= 4 .cse9) (<= .cse0 (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 4)) 4294967296)) 3))) (not (<= ~SIZE~0 20000001)) (and (<= 1 main_~l~0) .cse5 .cse1 .cse2 (<= .cse0 (+ (* 4294967296 (div (+ main_~v4~0 (- 1)) 4294967296)) main_~n~0)) (<= (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 .cse10) .cse11) (<= (div main_~l~0 2) 0) (<= (let ((.cse13 (* .cse14 (- 4294967296)))) (let ((.cse12 (div (+ main_~l~0 .cse13) 3))) (+ (* 25769803776 .cse12) (* 36893488151714070528 (div (+ (* .cse12 (- 3)) main_~l~0 .cse13) 4294967296)) main_~n~0 (* 36893488151714070528 .cse14) 8569934592))) (+ .cse6 (* 8589934593 main_~l~0))) (<= main_~v4~0 (+ .cse10 4294967295))) (and (<= .cse0 (+ (* 4294967296 (div (+ main_~j~0 main_~k~0 main_~v4~0 (- 3)) 4294967296)) main_~n~0 2)) (<= (+ main_~j~0 main_~k~0 main_~v4~0) main_~l~0) .cse1 .cse3 (<= (+ (* 6442450944 (div (+ main_~l~0 (- 1)) 3)) main_~n~0 2147483652) (+ .cse6 (* 2147483649 main_~l~0)))) (not (<= 20000001 ~SIZE~0)) (and .cse7 (<= 7 .cse9) (<= .cse0 (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 8)) 4294967296)))) (<= .cse14 0) (<= main_~l~0 .cse9)))))) [2020-10-24 02:39:54,106 INFO L270 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~v4~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:39:54,106 INFO L270 CegarLoopResult]: At program point L21-3(lines 21 32) the Hoare annotation is: (or (let ((.cse1 (+ (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0) 4294967296)) main_~l~0)) (.cse0 (* 4294967296 (div main_~l~0 4294967296)))) (and (<= (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 .cse0) .cse1) (< .cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 .cse0 1)))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:39:54,106 INFO L277 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-10-24 02:39:54,106 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:39:54,106 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:39:54,106 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:39:54,106 INFO L277 CegarLoopResult]: At program point mainFINAL(lines 16 35) the Hoare annotation is: true [2020-10-24 02:39:54,107 INFO L270 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse2 (* 4294967296 (div main_~n~0 4294967296))) (.cse6 (div main_~l~0 4294967296)) (.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (let ((.cse0 (<= .cse1 main_~l~0)) (.cse3 (* 4294967296 .cse6)) (.cse7 (+ .cse2 main_~l~0 1))) (or (and .cse0 (<= main_~l~0 5) (<= 5 .cse1) (<= (+ .cse2 main_~l~0 6) (+ main_~i~0 main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse3))) (and .cse0 (<= 7 .cse1) (<= (let ((.cse5 (* .cse6 (- 4294967296)))) (let ((.cse4 (div (+ main_~l~0 .cse5) 3))) (+ (* 3 .cse4) (* 4294967298 (div (+ (* .cse4 (- 3)) main_~l~0 .cse5) 4294967296)) .cse3 1))) main_~l~0) (<= .cse7 (+ main_~n~0 .cse3)) (<= .cse6 0) (<= main_~l~0 .cse1)) (and (<= 1 main_~l~0) (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (<= main_~v4~0 main_~l~0) (<= main_~l~0 1) (<= .cse7 (+ main_~n~0 main_~v4~0)) (<= main_~l~0 main_~v4~0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))))) [2020-10-24 02:39:54,107 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 16 35) the Hoare annotation is: true [2020-10-24 02:39:54,107 INFO L270 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (let ((.cse1 (* 4294967296 (div main_~n~0 4294967296)))) (let ((.cse0 (+ .cse1 main_~l~0))) (or (and (<= .cse0 (+ (* 4294967296 (div (+ main_~k~0 main_~v4~0 (- 2)) 4294967296)) main_~n~0 1)) (= main_~i~0 0) (= main_~j~0 0) (<= (+ main_~k~0 main_~v4~0) main_~l~0) (<= main_~l~0 2) (<= (+ (* 6442450944 (div main_~l~0 3)) main_~n~0 3) (+ .cse1 (* 2147483649 main_~l~0)))) (not (<= ~SIZE~0 20000001)) (let ((.cse5 (div main_~l~0 4294967296))) (let ((.cse2 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0)) (.cse6 (* 4294967296 .cse5))) (and (<= .cse2 main_~l~0) (<= 7 .cse2) (<= (let ((.cse4 (* .cse5 (- 4294967296)))) (let ((.cse3 (div (+ main_~l~0 .cse4) 3))) (+ (* 6 .cse3) (* 8589934593 (div (+ (* .cse3 (- 3)) main_~l~0 .cse4) 4294967296)) (* 8589934592 .cse5) 2))) (* 2 main_~l~0)) (<= (+ .cse1 main_~l~0 1) (+ main_~n~0 .cse6)) (<= .cse0 (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 8)) 4294967296)))) (<= .cse5 0) (< (+ (* 4294967296 (div .cse2 4294967296)) main_~l~0) (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 .cse6 1))))) (not (<= 20000001 ~SIZE~0))))) [2020-10-24 02:39:54,107 INFO L270 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (let ((.cse4 (div main_~l~0 4294967296)) (.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (let ((.cse0 (<= .cse1 main_~l~0)) (.cse2 (* 4294967296 (div main_~n~0 4294967296))) (.cse3 (* 4294967296 .cse4))) (or (and .cse0 (<= 7 .cse1) (<= (+ .cse2 main_~l~0 1) (+ main_~n~0 .cse3)) (<= (+ .cse2 main_~l~0) (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 8)) 4294967296)))) (<= .cse4 0) (<= main_~l~0 .cse1)) (not (<= ~SIZE~0 20000001)) (let ((.cse5 (+ main_~j~0 main_~k~0 main_~v4~0))) (and (<= .cse5 main_~l~0) (<= main_~l~0 3) (= main_~i~0 0) (<= (+ .cse2 main_~l~0 4) (+ main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse3)) (<= 3 main_~l~0) (<= main_~l~0 .cse5))) (not (<= 20000001 ~SIZE~0)) (and .cse0 (<= main_~l~0 6) (<= (+ .cse2 main_~l~0 7) (+ main_~i~0 main_~j~0 main_~k~0 main_~n~0 main_~v4~0 .cse3)) (<= 6 .cse1))))) [2020-10-24 02:39:54,107 INFO L270 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse2 (* 4294967296 (div main_~n~0 4294967296))) (.cse1 (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0))) (let ((.cse0 (<= .cse1 main_~l~0)) (.cse4 (+ .cse2 main_~l~0))) (or (let ((.cse3 (div main_~l~0 4294967296))) (and .cse0 (<= 7 .cse1) (<= (+ .cse2 main_~l~0 1) (+ main_~n~0 (* 4294967296 .cse3))) (<= .cse4 (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 8)) 4294967296)))) (<= .cse3 0) (<= main_~l~0 .cse1))) (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~v4~0 0) (<= main_~n~0 (+ .cse2 20000001)) (<= (+ .cse2 1) main_~n~0)) (and .cse0 (<= main_~l~0 4) (<= 4 .cse1) (<= .cse4 (+ main_~n~0 (* 4294967296 (div (+ main_~i~0 main_~j~0 main_~k~0 main_~v4~0 (- 4)) 4294967296)) 3))) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))))) [2020-10-24 02:39:54,108 INFO L270 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (= main_~k~0 0) (= main_~i~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~v4~0 0)) (not (<= ~SIZE~0 20000001)) (not (<= 20000001 ~SIZE~0))) [2020-10-24 02:39:54,108 INFO L277 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: true [2020-10-24 02:39:54,108 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:39:54,108 INFO L277 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 13) the Hoare annotation is: true [2020-10-24 02:39:54,108 INFO L270 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-10-24 02:39:54,108 INFO L277 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 13) the Hoare annotation is: true [2020-10-24 02:39:54,108 INFO L270 CegarLoopResult]: At program point L9(lines 9 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-10-24 02:39:54,109 INFO L270 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-10-24 02:39:54,109 INFO L277 CegarLoopResult]: At program point L9-2(lines 8 13) the Hoare annotation is: true [2020-10-24 02:39:54,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 02:39:54 BoogieIcfgContainer [2020-10-24 02:39:54,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 02:39:54,146 INFO L168 Benchmark]: Toolchain (without parser) took 80061.77 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 128.2 MB in the beginning and 141.4 MB in the end (delta: -13.2 MB). Peak memory consumption was 104.0 MB. Max. memory is 8.0 GB. [2020-10-24 02:39:54,147 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 151.0 MB. Free memory is still 126.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 02:39:54,150 INFO L168 Benchmark]: CACSL2BoogieTranslator took 269.42 ms. Allocated memory is still 151.0 MB. Free memory was 127.6 MB in the beginning and 117.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-10-24 02:39:54,151 INFO L168 Benchmark]: Boogie Preprocessor took 41.81 ms. Allocated memory is still 151.0 MB. Free memory was 117.6 MB in the beginning and 116.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 02:39:54,151 INFO L168 Benchmark]: RCFGBuilder took 563.93 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 132.7 MB in the end (delta: -16.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. [2020-10-24 02:39:54,152 INFO L168 Benchmark]: TraceAbstraction took 79172.11 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 132.7 MB in the beginning and 141.4 MB in the end (delta: -8.7 MB). Peak memory consumption was 107.7 MB. Max. memory is 8.0 GB. [2020-10-24 02:39:54,157 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.34 ms. Allocated memory is still 151.0 MB. Free memory is still 126.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 269.42 ms. Allocated memory is still 151.0 MB. Free memory was 127.6 MB in the beginning and 117.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 41.81 ms. Allocated memory is still 151.0 MB. Free memory was 117.6 MB in the beginning and 116.1 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 563.93 ms. Allocated memory is still 151.0 MB. Free memory was 115.9 MB in the beginning and 132.7 MB in the end (delta: -16.8 MB). Peak memory consumption was 18.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 79172.11 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 132.7 MB in the beginning and 141.4 MB in the end (delta: -8.7 MB). Peak memory consumption was 107.7 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: (((((((((((((4294967296 * (n / 4294967296) + l <= 4294967296 * ((k + v4 + -2) / 4294967296) + n + 1 && i == 0) && j == 0) && l / 4 <= 0) && k + v4 <= l) && 2 <= l) && 4294967296 * ((i + j + k + v4) / 4294967296) + l < i + j + k + v4 + 4294967296 * (l / 4294967296) + 1) || (((((k == 0 && i == 0) && j == 0) && l == 0) && v4 == 0) && n <= 4294967296 * (n / 4294967296) + 20000001)) || (((i + j + k + v4 <= l && l / 4 <= 1) && 5 <= i + j + k + v4) && 4294967296 * ((i + j + k + v4) / 4294967296) + l < i + j + k + v4 + 4294967296 * (l / 4294967296) + 1)) || (((i + j + k + v4 <= l && l <= 4) && 4 <= i + j + k + v4) && 4294967296 * (n / 4294967296) + l <= n + 4294967296 * ((i + j + k + v4 + -4) / 4294967296) + 3)) || !(SIZE <= 20000001)) || ((((((((1 <= l && k == 0) && i == 0) && j == 0) && 4294967296 * (n / 4294967296) + l <= 4294967296 * ((v4 + -1) / 4294967296) + n) && i + j + k + v4 + 4294967296 * (l / 4294967296) <= 4294967296 * ((i + j + k + v4) / 4294967296) + l) && l / 2 <= 0) && 25769803776 * ((l + l / 4294967296 * -4294967296) / 3) + 36893488151714070528 * (((l + l / 4294967296 * -4294967296) / 3 * -3 + l + l / 4294967296 * -4294967296) / 4294967296) + n + 36893488151714070528 * (l / 4294967296) + 8569934592 <= 4294967296 * (n / 4294967296) + 8589934593 * l) && v4 <= 4294967296 * (l / 4294967296) + 4294967295)) || ((((4294967296 * (n / 4294967296) + l <= 4294967296 * ((j + k + v4 + -3) / 4294967296) + n + 2 && j + k + v4 <= l) && i == 0) && l / 4 <= 0) && 6442450944 * ((l + -1) / 3) + n + 2147483652 <= 4294967296 * (n / 4294967296) + 2147483649 * l)) || !(20000001 <= SIZE)) || ((((i + j + k + v4 <= l && 7 <= i + j + k + v4) && 4294967296 * (n / 4294967296) + l <= n + 4294967296 * ((i + j + k + v4 + -8) / 4294967296)) && l / 4294967296 <= 0) && l <= i + j + k + v4) - 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: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 61.2s, OverallIterations: 23, TraceHistogramMax: 9, AutomataDifference: 47.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 701 SDtfs, 2145 SDslu, 2192 SDs, 0 SdLazy, 7115 SolverSat, 497 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 30.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 565 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 491 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3639 ImplicationChecksByTransitivity, 23.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 163 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 48 LocationsWithAnnotation, 274 PreInvPairs, 384 NumberOfFragments, 2660 HoareAnnotationTreeSize, 274 FomulaSimplifications, 81693661 FormulaSimplificationTreeSizeReduction, 1.9s HoareSimplificationTime, 48 FomulaSimplificationsInter, 136225 FormulaSimplificationTreeSizeReductionInter, 15.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 1142 NumberOfCodeBlocks, 1142 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1119 ConstructedInterpolants, 0 QuantifiedInterpolants, 632519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 111/980 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...