/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-72570d3 [2020-08-22 18:57:22,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-08-22 18:57:22,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-08-22 18:57:22,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-08-22 18:57:22,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-08-22 18:57:22,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-08-22 18:57:22,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-08-22 18:57:22,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-08-22 18:57:22,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-08-22 18:57:22,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-08-22 18:57:22,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-08-22 18:57:22,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-08-22 18:57:22,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-08-22 18:57:22,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-08-22 18:57:22,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-08-22 18:57:22,264 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-08-22 18:57:22,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-08-22 18:57:22,265 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-08-22 18:57:22,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-08-22 18:57:22,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-08-22 18:57:22,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-08-22 18:57:22,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-08-22 18:57:22,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-08-22 18:57:22,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-08-22 18:57:22,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-08-22 18:57:22,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-08-22 18:57:22,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-08-22 18:57:22,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-08-22 18:57:22,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-08-22 18:57:22,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-08-22 18:57:22,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-08-22 18:57:22,279 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-08-22 18:57:22,280 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-08-22 18:57:22,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-08-22 18:57:22,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-08-22 18:57:22,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-08-22 18:57:22,282 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-08-22 18:57:22,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-08-22 18:57:22,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-08-22 18:57:22,284 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-08-22 18:57:22,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-08-22 18:57:22,285 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-08-22 18:57:22,295 INFO L113 SettingsManager]: Loading preferences was successful [2020-08-22 18:57:22,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-08-22 18:57:22,297 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-08-22 18:57:22,297 INFO L138 SettingsManager]: * sizeof long=4 [2020-08-22 18:57:22,297 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-08-22 18:57:22,297 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-08-22 18:57:22,297 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-08-22 18:57:22,298 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-08-22 18:57:22,298 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-08-22 18:57:22,298 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-08-22 18:57:22,298 INFO L138 SettingsManager]: * sizeof long double=12 [2020-08-22 18:57:22,298 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-08-22 18:57:22,299 INFO L138 SettingsManager]: * Use constant arrays=true [2020-08-22 18:57:22,299 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-08-22 18:57:22,299 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-08-22 18:57:22,299 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-08-22 18:57:22,299 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-08-22 18:57:22,300 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-08-22 18:57:22,300 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-08-22 18:57:22,300 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-08-22 18:57:22,300 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-08-22 18:57:22,300 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-08-22 18:57:22,301 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-08-22 18:57:22,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-08-22 18:57:22,657 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-08-22 18:57:22,661 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-08-22 18:57:22,663 INFO L271 PluginConnector]: Initializing CDTParser... [2020-08-22 18:57:22,663 INFO L275 PluginConnector]: CDTParser initialized [2020-08-22 18:57:22,664 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-08-22 18:57:22,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d118401/55a51a5e63f144f8a5ba99da70a3d10a/FLAG4fa34b789 [2020-08-22 18:57:23,203 INFO L306 CDTParser]: Found 1 translation units. [2020-08-22 18:57:23,204 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-08-22 18:57:23,213 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d118401/55a51a5e63f144f8a5ba99da70a3d10a/FLAG4fa34b789 [2020-08-22 18:57:23,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90d118401/55a51a5e63f144f8a5ba99da70a3d10a [2020-08-22 18:57:23,545 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-08-22 18:57:23,547 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-08-22 18:57:23,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-08-22 18:57:23,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-08-22 18:57:23,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-08-22 18:57:23,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:57:23" (1/1) ... [2020-08-22 18:57:23,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1da4c468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:23, skipping insertion in model container [2020-08-22 18:57:23,557 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.08 06:57:23" (1/1) ... [2020-08-22 18:57:23,566 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-08-22 18:57:23,592 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-08-22 18:57:23,827 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 18:57:23,845 INFO L203 MainTranslator]: Completed pre-run [2020-08-22 18:57:23,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-08-22 18:57:23,889 INFO L208 MainTranslator]: Completed translation [2020-08-22 18:57:23,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:23 WrapperNode [2020-08-22 18:57:23,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-08-22 18:57:23,890 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-08-22 18:57:23,890 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-08-22 18:57:23,891 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-08-22 18:57:23,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:23" (1/1) ... [2020-08-22 18:57:23,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:23" (1/1) ... [2020-08-22 18:57:24,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:23" (1/1) ... [2020-08-22 18:57:24,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:23" (1/1) ... [2020-08-22 18:57:24,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:23" (1/1) ... [2020-08-22 18:57:24,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:23" (1/1) ... [2020-08-22 18:57:24,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:23" (1/1) ... [2020-08-22 18:57:24,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-08-22 18:57:24,050 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-08-22 18:57:24,050 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-08-22 18:57:24,050 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-08-22 18:57:24,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:23" (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-08-22 18:57:24,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-08-22 18:57:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-08-22 18:57:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-08-22 18:57:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-08-22 18:57:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-08-22 18:57:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-08-22 18:57:24,115 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-08-22 18:57:24,115 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-08-22 18:57:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-08-22 18:57:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-08-22 18:57:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-08-22 18:57:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-08-22 18:57:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-08-22 18:57:24,116 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-08-22 18:57:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-08-22 18:57:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-08-22 18:57:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-08-22 18:57:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-08-22 18:57:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-08-22 18:57:24,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-08-22 18:57:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-08-22 18:57:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-08-22 18:57:24,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-08-22 18:57:24,482 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-08-22 18:57:24,482 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-08-22 18:57:24,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:57:24 BoogieIcfgContainer [2020-08-22 18:57:24,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-08-22 18:57:24,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-08-22 18:57:24,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-08-22 18:57:24,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-08-22 18:57:24,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.08 06:57:23" (1/3) ... [2020-08-22 18:57:24,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af2199d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:57:24, skipping insertion in model container [2020-08-22 18:57:24,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.08 06:57:23" (2/3) ... [2020-08-22 18:57:24,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af2199d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.08 06:57:24, skipping insertion in model container [2020-08-22 18:57:24,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.08 06:57:24" (3/3) ... [2020-08-22 18:57:24,498 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-08-22 18:57:24,509 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-08-22 18:57:24,517 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-08-22 18:57:24,532 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-08-22 18:57:24,554 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-08-22 18:57:24,555 INFO L376 AbstractCegarLoop]: Hoare is true [2020-08-22 18:57:24,555 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-08-22 18:57:24,555 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-08-22 18:57:24,555 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-08-22 18:57:24,555 INFO L380 AbstractCegarLoop]: Difference is false [2020-08-22 18:57:24,556 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-08-22 18:57:24,556 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-08-22 18:57:24,575 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-08-22 18:57:24,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-08-22 18:57:24,586 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:24,587 INFO L422 BasicCegarLoop]: trace histogram [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-08-22 18:57:24,587 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:24,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:24,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1228919024, now seen corresponding path program 1 times [2020-08-22 18:57:24,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:24,603 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1366589349] [2020-08-22 18:57:24,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:24,664 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:24,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:25,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:25,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:25,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 18:57:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:25,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 18:57:25,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 18:57:25,088 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1366589349] [2020-08-22 18:57:25,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:25,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-08-22 18:57:25,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126065591] [2020-08-22 18:57:25,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-08-22 18:57:25,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:25,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-08-22 18:57:25,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-08-22 18:57:25,117 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 10 states. [2020-08-22 18:57:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:26,126 INFO L93 Difference]: Finished difference Result 221 states and 257 transitions. [2020-08-22 18:57:26,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-08-22 18:57:26,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-08-22 18:57:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:26,145 INFO L225 Difference]: With dead ends: 221 [2020-08-22 18:57:26,145 INFO L226 Difference]: Without dead ends: 138 [2020-08-22 18:57:26,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-08-22 18:57:26,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-08-22 18:57:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2020-08-22 18:57:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-08-22 18:57:26,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2020-08-22 18:57:26,238 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 40 [2020-08-22 18:57:26,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:26,239 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2020-08-22 18:57:26,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-08-22 18:57:26,240 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2020-08-22 18:57:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-08-22 18:57:26,244 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:26,245 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:57:26,245 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-08-22 18:57:26,246 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:26,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:26,246 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393660, now seen corresponding path program 1 times [2020-08-22 18:57:26,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:26,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [259535033] [2020-08-22 18:57:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:26,255 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:26,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:26,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:26,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:26,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 18:57:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:26,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 18:57:26,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:26,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-08-22 18:57:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-08-22 18:57:26,668 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [259535033] [2020-08-22 18:57:26,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:26,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-08-22 18:57:26,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509841557] [2020-08-22 18:57:26,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-08-22 18:57:26,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:26,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-08-22 18:57:26,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-08-22 18:57:26,671 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 13 states. [2020-08-22 18:57:27,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:27,605 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2020-08-22 18:57:27,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-08-22 18:57:27,606 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-08-22 18:57:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:27,608 INFO L225 Difference]: With dead ends: 128 [2020-08-22 18:57:27,609 INFO L226 Difference]: Without dead ends: 108 [2020-08-22 18:57:27,614 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2020-08-22 18:57:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-08-22 18:57:27,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-08-22 18:57:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-08-22 18:57:27,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2020-08-22 18:57:27,653 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 52 [2020-08-22 18:57:27,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:27,654 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2020-08-22 18:57:27,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-08-22 18:57:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-08-22 18:57:27,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-22 18:57:27,660 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:27,661 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:57:27,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-08-22 18:57:27,665 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:27,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1709597342, now seen corresponding path program 1 times [2020-08-22 18:57:27,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:27,674 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [167311568] [2020-08-22 18:57:27,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:27,678 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:27,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:27,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:27,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 18:57:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:27,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 18:57:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:27,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 18:57:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:27,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 18:57:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:27,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-22 18:57:27,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [167311568] [2020-08-22 18:57:27,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:27,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-08-22 18:57:27,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844923008] [2020-08-22 18:57:27,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 18:57:27,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:27,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 18:57:27,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-08-22 18:57:27,986 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 15 states. [2020-08-22 18:57:29,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:29,440 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2020-08-22 18:57:29,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-08-22 18:57:29,441 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-08-22 18:57:29,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:29,443 INFO L225 Difference]: With dead ends: 179 [2020-08-22 18:57:29,444 INFO L226 Difference]: Without dead ends: 177 [2020-08-22 18:57:29,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-08-22 18:57:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-08-22 18:57:29,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2020-08-22 18:57:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-08-22 18:57:29,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2020-08-22 18:57:29,486 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 67 [2020-08-22 18:57:29,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:29,489 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2020-08-22 18:57:29,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 18:57:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2020-08-22 18:57:29,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-08-22 18:57:29,499 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:29,499 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:57:29,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-08-22 18:57:29,500 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:29,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:29,500 INFO L82 PathProgramCache]: Analyzing trace with hash 587834366, now seen corresponding path program 1 times [2020-08-22 18:57:29,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:29,501 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2058602946] [2020-08-22 18:57:29,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:29,504 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:29,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:29,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:29,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:29,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 18:57:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:29,755 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 18:57:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:29,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 18:57:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:29,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 18:57:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:29,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-22 18:57:29,774 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2058602946] [2020-08-22 18:57:29,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:29,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-08-22 18:57:29,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584008393] [2020-08-22 18:57:29,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 18:57:29,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:29,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 18:57:29,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-08-22 18:57:29,776 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 15 states. [2020-08-22 18:57:31,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:31,258 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2020-08-22 18:57:31,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-08-22 18:57:31,259 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-08-22 18:57:31,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:31,262 INFO L225 Difference]: With dead ends: 221 [2020-08-22 18:57:31,262 INFO L226 Difference]: Without dead ends: 219 [2020-08-22 18:57:31,263 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2020-08-22 18:57:31,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-08-22 18:57:31,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 194. [2020-08-22 18:57:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-08-22 18:57:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2020-08-22 18:57:31,327 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 67 [2020-08-22 18:57:31,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:31,328 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2020-08-22 18:57:31,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 18:57:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2020-08-22 18:57:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-08-22 18:57:31,329 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:31,330 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:57:31,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-08-22 18:57:31,330 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:31,331 INFO L82 PathProgramCache]: Analyzing trace with hash 687369648, now seen corresponding path program 1 times [2020-08-22 18:57:31,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:31,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [541882076] [2020-08-22 18:57:31,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:31,333 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:31,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:31,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:31,489 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 18:57:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:31,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 18:57:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:31,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 18:57:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:31,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 18:57:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:31,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-08-22 18:57:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:31,549 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-08-22 18:57:31,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [541882076] [2020-08-22 18:57:31,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:31,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-08-22 18:57:31,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360912343] [2020-08-22 18:57:31,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-08-22 18:57:31,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:31,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-08-22 18:57:31,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-08-22 18:57:31,552 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand 15 states. [2020-08-22 18:57:32,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:32,357 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2020-08-22 18:57:32,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-08-22 18:57:32,358 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-08-22 18:57:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:32,360 INFO L225 Difference]: With dead ends: 206 [2020-08-22 18:57:32,361 INFO L226 Difference]: Without dead ends: 142 [2020-08-22 18:57:32,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-08-22 18:57:32,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-08-22 18:57:32,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2020-08-22 18:57:32,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-08-22 18:57:32,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2020-08-22 18:57:32,380 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 79 [2020-08-22 18:57:32,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:32,381 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2020-08-22 18:57:32,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-08-22 18:57:32,381 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2020-08-22 18:57:32,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-08-22 18:57:32,382 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:32,383 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:57:32,383 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-08-22 18:57:32,383 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:32,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:32,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1486199216, now seen corresponding path program 2 times [2020-08-22 18:57:32,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:32,384 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [74775713] [2020-08-22 18:57:32,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:32,404 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:32,713 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:32,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:32,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 18:57:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:32,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 18:57:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:32,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 18:57:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:32,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 18:57:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:32,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-08-22 18:57:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:32,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-08-22 18:57:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-08-22 18:57:32,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [74775713] [2020-08-22 18:57:32,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:32,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-08-22 18:57:32,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695179121] [2020-08-22 18:57:32,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-08-22 18:57:32,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:32,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-08-22 18:57:32,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-08-22 18:57:32,771 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 20 states. [2020-08-22 18:57:34,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:34,453 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2020-08-22 18:57:34,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-08-22 18:57:34,454 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-08-22 18:57:34,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:34,456 INFO L225 Difference]: With dead ends: 168 [2020-08-22 18:57:34,456 INFO L226 Difference]: Without dead ends: 166 [2020-08-22 18:57:34,457 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2020-08-22 18:57:34,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-08-22 18:57:34,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2020-08-22 18:57:34,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-08-22 18:57:34,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2020-08-22 18:57:34,476 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 94 [2020-08-22 18:57:34,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:34,477 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2020-08-22 18:57:34,477 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-08-22 18:57:34,477 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2020-08-22 18:57:34,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-08-22 18:57:34,478 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:34,478 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:57:34,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-08-22 18:57:34,479 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:34,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:34,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1687005104, now seen corresponding path program 1 times [2020-08-22 18:57:34,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:34,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [271985646] [2020-08-22 18:57:34,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:34,482 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:34,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:34,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:34,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:34,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 18:57:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:34,854 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 18:57:34,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:34,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 18:57:34,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:34,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 18:57:34,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:34,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-08-22 18:57:34,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:34,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-08-22 18:57:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:34,899 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-08-22 18:57:34,900 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [271985646] [2020-08-22 18:57:34,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:34,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-08-22 18:57:34,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488480771] [2020-08-22 18:57:34,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-08-22 18:57:34,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:34,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-08-22 18:57:34,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-08-22 18:57:34,903 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 20 states. [2020-08-22 18:57:36,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:36,575 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2020-08-22 18:57:36,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-08-22 18:57:36,578 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-08-22 18:57:36,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:36,580 INFO L225 Difference]: With dead ends: 191 [2020-08-22 18:57:36,581 INFO L226 Difference]: Without dead ends: 189 [2020-08-22 18:57:36,582 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2020-08-22 18:57:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-08-22 18:57:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 142. [2020-08-22 18:57:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-08-22 18:57:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2020-08-22 18:57:36,603 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 94 [2020-08-22 18:57:36,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:36,604 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2020-08-22 18:57:36,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-08-22 18:57:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2020-08-22 18:57:36,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-08-22 18:57:36,606 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:36,606 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:57:36,606 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-08-22 18:57:36,607 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:36,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:36,607 INFO L82 PathProgramCache]: Analyzing trace with hash 766068976, now seen corresponding path program 2 times [2020-08-22 18:57:36,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:36,608 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1193089672] [2020-08-22 18:57:36,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:36,610 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:36,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:36,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:36,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 18:57:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:36,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 18:57:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:36,947 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 18:57:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:36,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 18:57:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:36,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-08-22 18:57:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:36,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-08-22 18:57:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:36,977 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-08-22 18:57:36,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1193089672] [2020-08-22 18:57:36,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:36,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2020-08-22 18:57:36,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626586654] [2020-08-22 18:57:36,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-08-22 18:57:36,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:36,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-08-22 18:57:36,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-08-22 18:57:36,980 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 20 states. [2020-08-22 18:57:38,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:38,748 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2020-08-22 18:57:38,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-08-22 18:57:38,749 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-08-22 18:57:38,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:38,751 INFO L225 Difference]: With dead ends: 208 [2020-08-22 18:57:38,751 INFO L226 Difference]: Without dead ends: 206 [2020-08-22 18:57:38,752 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2020-08-22 18:57:38,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-08-22 18:57:38,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2020-08-22 18:57:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-08-22 18:57:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 195 transitions. [2020-08-22 18:57:38,776 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 195 transitions. Word has length 94 [2020-08-22 18:57:38,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:38,776 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 195 transitions. [2020-08-22 18:57:38,777 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-08-22 18:57:38,777 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 195 transitions. [2020-08-22 18:57:38,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-22 18:57:38,779 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:38,779 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:57:38,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-08-22 18:57:38,779 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:38,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:38,780 INFO L82 PathProgramCache]: Analyzing trace with hash 888595646, now seen corresponding path program 3 times [2020-08-22 18:57:38,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:38,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1672642093] [2020-08-22 18:57:38,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:38,783 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:39,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:39,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:39,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 18:57:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:39,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 18:57:39,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:39,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 18:57:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:39,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 18:57:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:39,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-08-22 18:57:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:39,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-08-22 18:57:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:39,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 18:57:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:39,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 18:57:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:39,332 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-22 18:57:39,333 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1672642093] [2020-08-22 18:57:39,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:39,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2020-08-22 18:57:39,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681728215] [2020-08-22 18:57:39,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-08-22 18:57:39,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:39,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-08-22 18:57:39,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2020-08-22 18:57:39,338 INFO L87 Difference]: Start difference. First operand 182 states and 195 transitions. Second operand 25 states. [2020-08-22 18:57:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:41,883 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2020-08-22 18:57:41,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-08-22 18:57:41,884 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-08-22 18:57:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:41,887 INFO L225 Difference]: With dead ends: 237 [2020-08-22 18:57:41,887 INFO L226 Difference]: Without dead ends: 171 [2020-08-22 18:57:41,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=576, Invalid=2846, Unknown=0, NotChecked=0, Total=3422 [2020-08-22 18:57:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-08-22 18:57:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2020-08-22 18:57:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-08-22 18:57:41,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-08-22 18:57:41,914 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 121 [2020-08-22 18:57:41,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:41,915 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-08-22 18:57:41,915 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-08-22 18:57:41,915 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-08-22 18:57:41,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-08-22 18:57:41,916 INFO L414 BasicCegarLoop]: Found error trace [2020-08-22 18:57:41,917 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-08-22 18:57:41,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-08-22 18:57:41,918 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-08-22 18:57:41,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-08-22 18:57:41,918 INFO L82 PathProgramCache]: Analyzing trace with hash -32340482, now seen corresponding path program 4 times [2020-08-22 18:57:41,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-08-22 18:57:41,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2115883747] [2020-08-22 18:57:41,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-08-22 18:57:41,923 INFO L288 leratedInterpolation]: No loops in this trace, falling back to nested interpolation [2020-08-22 18:57:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:42,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-08-22 18:57:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:42,011 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-08-22 18:57:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:42,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-08-22 18:57:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:42,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-08-22 18:57:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:42,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-08-22 18:57:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:42,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-08-22 18:57:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:42,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-08-22 18:57:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:42,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-08-22 18:57:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:42,053 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-08-22 18:57:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:42,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-08-22 18:57:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-08-22 18:57:42,072 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2020-08-22 18:57:42,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2115883747] [2020-08-22 18:57:42,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-08-22 18:57:42,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-08-22 18:57:42,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048731559] [2020-08-22 18:57:42,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-08-22 18:57:42,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-08-22 18:57:42,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-08-22 18:57:42,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-08-22 18:57:42,075 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 11 states. [2020-08-22 18:57:42,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-08-22 18:57:42,448 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2020-08-22 18:57:42,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-08-22 18:57:42,449 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 121 [2020-08-22 18:57:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-08-22 18:57:42,450 INFO L225 Difference]: With dead ends: 163 [2020-08-22 18:57:42,451 INFO L226 Difference]: Without dead ends: 0 [2020-08-22 18:57:42,452 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-08-22 18:57:42,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-08-22 18:57:42,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-08-22 18:57:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-08-22 18:57:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-08-22 18:57:42,453 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2020-08-22 18:57:42,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-08-22 18:57:42,454 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-08-22 18:57:42,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-08-22 18:57:42,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-08-22 18:57:42,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-08-22 18:57:42,454 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-08-22 18:57:42,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-08-22 18:57:44,651 WARN L193 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-08-22 18:57:44,823 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2020-08-22 18:57:45,164 WARN L193 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-08-22 18:57:45,366 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2020-08-22 18:57:45,486 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-08-22 18:57:45,699 WARN L193 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-08-22 18:57:45,896 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-08-22 18:57:46,156 WARN L193 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 18:57:46,461 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-08-22 18:57:46,768 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2020-08-22 18:57:47,107 WARN L193 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2020-08-22 18:57:47,224 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-08-22 18:57:47,559 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2020-08-22 18:57:47,800 WARN L193 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2020-08-22 18:57:48,091 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2020-08-22 18:57:48,389 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-08-22 18:57:48,656 WARN L193 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-08-22 18:57:48,845 WARN L193 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2020-08-22 18:57:49,076 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-08-22 18:57:49,274 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2020-08-22 18:57:49,557 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 18:57:49,828 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 18:57:50,002 WARN L193 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2020-08-22 18:57:50,376 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 18:57:50,567 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2020-08-22 18:57:50,879 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 18:57:51,165 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-08-22 18:57:51,355 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-08-22 18:57:51,617 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2020-08-22 18:57:51,635 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 18:57:51,635 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-08-22 18:57:51,635 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-08-22 18:57:51,635 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:51,636 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-08-22 18:57:51,636 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-08-22 18:57:51,636 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-08-22 18:57:51,636 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-08-22 18:57:51,636 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-08-22 18:57:51,636 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-08-22 18:57:51,636 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-08-22 18:57:51,636 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-08-22 18:57:51,636 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-08-22 18:57:51,637 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-08-22 18:57:51,637 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 38 52) the Hoare annotation is: true [2020-08-22 18:57:51,637 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-08-22 18:57:51,637 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (<= main_~ai~1 main_~ax~1) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 18:57:51,637 INFO L271 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: true [2020-08-22 18:57:51,637 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 18:57:51,637 INFO L264 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0) (= |main_#t~mem12| 0))) [2020-08-22 18:57:51,638 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 38 52) the Hoare annotation is: true [2020-08-22 18:57:51,638 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-08-22 18:57:51,638 INFO L264 CegarLoopResult]: At program point L46-2(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0) (= |main_#t~mem12| 0))) [2020-08-22 18:57:51,638 INFO L264 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: (= (select |#memory_int| |main_#t~malloc10.base|) ((as const (Array Int Int)) 0)) [2020-08-22 18:57:51,638 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:51,638 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:51,639 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 38 52) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:51,639 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 18:57:51,639 INFO L264 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (= (select |#memory_int| main_~a~0.base) .cse0) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 18:57:51,639 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 18:57:51,639 INFO L264 CegarLoopResult]: At program point L47-2(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (= (select |#memory_int| main_~a~0.base) .cse0) (<= main_~ai~1 main_~ax~1) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 18:57:51,639 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 18:57:51,639 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:51,639 INFO L264 CegarLoopResult]: At program point L45-2(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 18:57:51,639 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:51,640 INFO L264 CegarLoopResult]: At program point L45-3(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-08-22 18:57:51,640 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:51,640 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:51,640 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:51,640 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-08-22 18:57:51,641 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= check_~ax~0 0)) (.cse1 (= check_~ai~0 0)) (.cse2 (= (select |#memory_int| check_~a.base) .cse6)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or (and .cse0 .cse1 .cse2) .cse3 (not (<= 1 |check_#in~x|)) .cse4) (or .cse3 (and .cse0 (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1 .cse2) (not (= |check_#in~x| 0)) .cse4)))) [2020-08-22 18:57:51,641 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= check_~ax~0 0) (= check_~ai~0 0) (= (select |#memory_int| check_~a.base) .cse0)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)))) [2020-08-22 18:57:51,641 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 36) the Hoare annotation is: true [2020-08-22 18:57:51,641 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,642 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= |check_#t~mem6| 0)) (.cse1 (= (select |#memory_int| check_~a.base) .cse5)) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or (and .cse0 .cse1) .cse2 (not (<= 1 |check_#in~x|)) .cse3) (or .cse2 (and .cse0 (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1) (not (= |check_#in~x| 0)) .cse3)))) [2020-08-22 18:57:51,642 INFO L264 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse2 (= |check_#t~mem6| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse6)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse4 .cse5)) (or (and .cse2 .cse4 .cse5) .cse0 (not (<= 1 |check_#in~x|)) .cse1)))) [2020-08-22 18:57:51,642 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,642 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,643 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-08-22 18:57:51,643 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,643 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-08-22 18:57:51,643 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-08-22 18:57:51,643 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,644 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,644 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse1 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 (and .cse1 .cse2 (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or (and .cse1 .cse2 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse4)))) [2020-08-22 18:57:51,644 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-08-22 18:57:51,644 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2 .cse3))))) [2020-08-22 18:57:51,645 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse1 (= |check_#t~mem7| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (and .cse1 (or (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse3 .cse4) (not (= |check_#in~x| 0)) .cse5) (or (and .cse1 .cse3 .cse4) .cse0 (not (<= 1 |check_#in~x|)) .cse5)))) [2020-08-22 18:57:51,645 INFO L264 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (= check_~ax~0 0)) (.cse2 (= |check_#t~mem7| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse6 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 (and .cse1 .cse2 (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse4 .cse5) (not (= |check_#in~x| 0)) .cse6) (or .cse0 (and .cse1 .cse2 .cse4 .cse5) (not (<= 1 |check_#in~x|)) .cse6)))) [2020-08-22 18:57:51,645 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,646 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse9 (+ check_~y 1))) (let ((.cse6 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse9 |check_#in~n|)) (.cse3 (<= .cse9 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse8)) (.cse5 (= |check_#t~mem1| 0)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse8)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5 (<= 1 check_~x))) (or .cse0 .cse1 .cse6 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse7 (+ check_~y 2))) (and (<= .cse7 check_~n) (<= .cse7 |check_#in~n|))) .cse6) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,646 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,646 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 25) the Hoare annotation is: (let ((.cse10 (+ check_~y 1)) (.cse9 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse3 (<= .cse10 |check_#in~n|)) (.cse4 (<= .cse10 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse9)) (.cse6 (= |check_#t~mem2| 0)) (.cse7 (= |check_#t~mem1| 0))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 .cse6 .cse7 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse8 (+ check_~y 2))) (and (<= .cse8 check_~n) (<= .cse8 |check_#in~n|))) .cse2) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 check_~x)))))) [2020-08-22 18:57:51,646 INFO L264 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (not (<= 2 |check_#in~x|)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse3 .cse4 .cse5 (= |check_#t~mem2| 0) (= |check_#t~mem1| 0) (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2)))) [2020-08-22 18:57:51,647 INFO L264 CegarLoopResult]: At program point L24-4(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= |check_#t~mem1| 0) (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,647 INFO L264 CegarLoopResult]: At program point L24-5(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,647 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-08-22 18:57:51,648 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,648 INFO L264 CegarLoopResult]: At program point L24-6(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse4 (<= .cse8 |check_#in~n|)) (.cse5 (<= .cse8 check_~n)) (.cse6 (= (select |#memory_int| check_~a.base) .cse7)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 check_~n) (<= .cse3 |check_#in~n|))) .cse2) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse4 (<= 1 |check_#t~post3|) .cse5 .cse6 (<= 1 check_~x)) .cse1) (or (and (= |check_#t~post3| 0) .cse4 .cse5 .cse6 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,648 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-08-22 18:57:51,649 INFO L264 CegarLoopResult]: At program point L24-7(line 24) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse1 (<= .cse7 |check_#in~n|)) (.cse2 (<= .cse7 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse6)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (and (= |check_#t~post3| 0) .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse4) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|))) (not (<= 2 |check_#in~x|))) (or (and .cse1 (<= 1 |check_#t~post3|) .cse2 .cse3 (<= 2 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse4)))) [2020-08-22 18:57:51,649 INFO L264 CegarLoopResult]: At program point L24-9(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-08-22 18:57:51,649 INFO L264 CegarLoopResult]: At program point L14(lines 14 36) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (= check_~x 0)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (<= 1 check_~x)))) [2020-08-22 18:57:51,649 INFO L264 CegarLoopResult]: At program point L24-10(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-08-22 18:57:51,649 INFO L264 CegarLoopResult]: At program point L14-1(lines 14 36) the Hoare annotation is: (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (<= (+ check_~y 2) |check_#in~n|) .cse2) (or .cse0 (and .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1))) [2020-08-22 18:57:51,650 INFO L264 CegarLoopResult]: At program point L24-11(lines 24 25) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse0 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse0 (<= (+ check_~y 2) check_~n) (not (<= 2 |check_#in~x|))) (or .cse1 (and .cse2 .cse3 .cse4 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse0) (or .cse1 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse0)))) [2020-08-22 18:57:51,650 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (<= (+ check_~y 2) |check_#in~n|)) (or (and .cse3 .cse4 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2020-08-22 18:57:51,650 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (<= (+ check_~y 2) |check_#in~n|)) (or (and .cse3 .cse4 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2020-08-22 18:57:51,650 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-08-22 18:57:51,651 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-08-22 18:57:51,651 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-08-22 18:57:51,651 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-08-22 18:57:51,651 INFO L264 CegarLoopResult]: At program point L9-3(lines 8 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-08-22 18:57:51,651 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-08-22 18:57:51,651 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-08-22 18:57:51,651 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-08-22 18:57:51,652 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-08-22 18:57:51,669 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-08-22 18:57:51,673 INFO L168 Benchmark]: Toolchain (without parser) took 28126.83 ms. Allocated memory was 138.4 MB in the beginning and 432.0 MB in the end (delta: 293.6 MB). Free memory was 103.0 MB in the beginning and 118.9 MB in the end (delta: -15.8 MB). Peak memory consumption was 297.4 MB. Max. memory is 7.1 GB. [2020-08-22 18:57:51,674 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-08-22 18:57:51,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.00 ms. Allocated memory is still 138.4 MB. Free memory was 102.6 MB in the beginning and 91.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-08-22 18:57:51,676 INFO L168 Benchmark]: Boogie Preprocessor took 158.93 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 91.9 MB in the beginning and 179.1 MB in the end (delta: -87.1 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2020-08-22 18:57:51,676 INFO L168 Benchmark]: RCFGBuilder took 439.12 ms. Allocated memory is still 201.9 MB. Free memory was 179.1 MB in the beginning and 157.3 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2020-08-22 18:57:51,677 INFO L168 Benchmark]: TraceAbstraction took 27181.31 ms. Allocated memory was 201.9 MB in the beginning and 432.0 MB in the end (delta: 230.2 MB). Free memory was 156.6 MB in the beginning and 118.9 MB in the end (delta: 37.7 MB). Peak memory consumption was 287.6 MB. Max. memory is 7.1 GB. [2020-08-22 18:57:51,681 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 342.00 ms. Allocated memory is still 138.4 MB. Free memory was 102.6 MB in the beginning and 91.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 158.93 ms. Allocated memory was 138.4 MB in the beginning and 201.9 MB in the end (delta: 63.4 MB). Free memory was 91.9 MB in the beginning and 179.1 MB in the end (delta: -87.1 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 439.12 ms. Allocated memory is still 201.9 MB. Free memory was 179.1 MB in the beginning and 157.3 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27181.31 ms. Allocated memory was 201.9 MB in the beginning and 432.0 MB in the end (delta: 230.2 MB). Free memory was 156.6 MB in the beginning and 118.9 MB in the end (delta: 37.7 MB). Peak memory consumption was 287.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: 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 - ProcedureContractResult [Line: 5]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 38]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...