/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-36cd7be [2021-02-23 17:58:24,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-23 17:58:24,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-23 17:58:24,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-23 17:58:24,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-23 17:58:24,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-23 17:58:24,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-23 17:58:24,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-23 17:58:24,592 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-23 17:58:24,594 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-23 17:58:24,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-23 17:58:24,601 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-23 17:58:24,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-23 17:58:24,607 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-23 17:58:24,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-23 17:58:24,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-23 17:58:24,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-23 17:58:24,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-23 17:58:24,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-23 17:58:24,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-23 17:58:24,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-23 17:58:24,637 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-23 17:58:24,639 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-23 17:58:24,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-23 17:58:24,645 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-23 17:58:24,646 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-23 17:58:24,646 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-23 17:58:24,647 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-23 17:58:24,648 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-23 17:58:24,649 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-23 17:58:24,649 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-23 17:58:24,650 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-23 17:58:24,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-23 17:58:24,653 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-23 17:58:24,654 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-23 17:58:24,654 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-23 17:58:24,655 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-23 17:58:24,655 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-23 17:58:24,656 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-23 17:58:24,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-23 17:58:24,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-23 17:58:24,659 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-23 17:58:24,673 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-23 17:58:24,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-23 17:58:24,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-23 17:58:24,675 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-23 17:58:24,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-23 17:58:24,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-23 17:58:24,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-23 17:58:24,676 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-23 17:58:24,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-23 17:58:24,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-23 17:58:24,677 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-23 17:58:24,677 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-23 17:58:24,677 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-23 17:58:24,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-23 17:58:24,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-23 17:58:24,678 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-23 17:58:24,678 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-23 17:58:24,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-23 17:58:24,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-23 17:58:24,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-23 17:58:24,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-23 17:58:24,680 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-23 17:58:24,680 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-02-23 17:58:25,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-23 17:58:25,125 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-23 17:58:25,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-23 17:58:25,129 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-23 17:58:25,130 INFO L275 PluginConnector]: CDTParser initialized [2021-02-23 17:58:25,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec.c [2021-02-23 17:58:25,222 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c151dc6/b6ef827237dd4c2eaa19cbeea7f4f6ae/FLAGbd4fce978 [2021-02-23 17:58:25,819 INFO L306 CDTParser]: Found 1 translation units. [2021-02-23 17:58:25,820 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c [2021-02-23 17:58:25,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c151dc6/b6ef827237dd4c2eaa19cbeea7f4f6ae/FLAGbd4fce978 [2021-02-23 17:58:26,222 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/82c151dc6/b6ef827237dd4c2eaa19cbeea7f4f6ae [2021-02-23 17:58:26,225 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-23 17:58:26,240 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-23 17:58:26,248 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-23 17:58:26,248 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-23 17:58:26,253 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-23 17:58:26,254 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 05:58:26" (1/1) ... [2021-02-23 17:58:26,255 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45e89564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 05:58:26, skipping insertion in model container [2021-02-23 17:58:26,255 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 05:58:26" (1/1) ... [2021-02-23 17:58:26,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-23 17:58:26,283 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-23 17:58:26,511 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c[493,506] [2021-02-23 17:58:26,539 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 17:58:26,559 INFO L203 MainTranslator]: Completed pre-run [2021-02-23 17:58:26,575 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec.c[493,506] [2021-02-23 17:58:26,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 17:58:26,626 INFO L208 MainTranslator]: Completed translation [2021-02-23 17:58:26,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 05:58:26 WrapperNode [2021-02-23 17:58:26,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-23 17:58:26,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-23 17:58:26,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-23 17:58:26,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-23 17:58:26,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 05:58:26" (1/1) ... [2021-02-23 17:58:26,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 05:58:26" (1/1) ... [2021-02-23 17:58:26,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 05:58:26" (1/1) ... [2021-02-23 17:58:26,665 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 05:58:26" (1/1) ... [2021-02-23 17:58:26,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 05:58:26" (1/1) ... [2021-02-23 17:58:26,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 05:58:26" (1/1) ... [2021-02-23 17:58:26,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 05:58:26" (1/1) ... [2021-02-23 17:58:26,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-23 17:58:26,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-23 17:58:26,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-23 17:58:26,709 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-23 17:58:26,711 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 05:58:26" (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 [2021-02-23 17:58:26,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-23 17:58:26,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-23 17:58:26,810 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-23 17:58:26,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-02-23 17:58:26,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-02-23 17:58:26,811 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-02-23 17:58:26,811 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-23 17:58:26,811 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-02-23 17:58:26,811 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-23 17:58:26,811 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-23 17:58:26,811 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-23 17:58:26,812 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-23 17:58:26,812 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-23 17:58:26,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-23 17:58:26,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-02-23 17:58:26,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-02-23 17:58:26,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-23 17:58:26,813 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-02-23 17:58:26,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-23 17:58:26,813 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-23 17:58:26,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-02-23 17:58:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-02-23 17:58:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-23 17:58:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-23 17:58:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-23 17:58:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-23 17:58:26,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-23 17:58:27,223 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-23 17:58:27,223 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-02-23 17:58:27,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 05:58:27 BoogieIcfgContainer [2021-02-23 17:58:27,226 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-23 17:58:27,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-23 17:58:27,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-23 17:58:27,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-23 17:58:27,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 05:58:26" (1/3) ... [2021-02-23 17:58:27,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc4bbd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 05:58:27, skipping insertion in model container [2021-02-23 17:58:27,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 05:58:26" (2/3) ... [2021-02-23 17:58:27,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc4bbd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 05:58:27, skipping insertion in model container [2021-02-23 17:58:27,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 05:58:27" (3/3) ... [2021-02-23 17:58:27,235 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec.c [2021-02-23 17:58:27,242 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-23 17:58:27,247 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-23 17:58:27,266 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-23 17:58:27,291 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-23 17:58:27,291 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-23 17:58:27,291 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-23 17:58:27,292 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-23 17:58:27,292 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-23 17:58:27,292 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-23 17:58:27,292 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-23 17:58:27,292 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-23 17:58:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2021-02-23 17:58:27,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-02-23 17:58:27,320 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 17:58:27,322 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 17:58:27,322 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 17:58:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 17:58:27,329 INFO L82 PathProgramCache]: Analyzing trace with hash 2141980220, now seen corresponding path program 1 times [2021-02-23 17:58:27,338 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 17:58:27,339 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265074403] [2021-02-23 17:58:27,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 17:58:27,420 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 17:58:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:27,651 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:27,654 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:27,667 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:27,671 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:27,707 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:27,711 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:27,745 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:27,748 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:27,769 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:27,771 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:27,787 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:27,788 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:27,799 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:27,800 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:27,815 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:27,818 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:27,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 17:58:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:27,973 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:27,974 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:27,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 17:58:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:27,991 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:27,992 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:28,015 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 17:58:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:28,029 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:28,030 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 17:58:28,053 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265074403] [2021-02-23 17:58:28,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 17:58:28,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-23 17:58:28,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654879234] [2021-02-23 17:58:28,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-23 17:58:28,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 17:58:28,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-23 17:58:28,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-02-23 17:58:28,083 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 10 states. [2021-02-23 17:58:29,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 17:58:29,182 INFO L93 Difference]: Finished difference Result 215 states and 247 transitions. [2021-02-23 17:58:29,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-23 17:58:29,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2021-02-23 17:58:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 17:58:29,195 INFO L225 Difference]: With dead ends: 215 [2021-02-23 17:58:29,195 INFO L226 Difference]: Without dead ends: 128 [2021-02-23 17:58:29,201 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-02-23 17:58:29,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-02-23 17:58:29,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 113. [2021-02-23 17:58:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2021-02-23 17:58:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2021-02-23 17:58:29,277 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 36 [2021-02-23 17:58:29,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 17:58:29,278 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2021-02-23 17:58:29,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-23 17:58:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2021-02-23 17:58:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-23 17:58:29,281 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 17:58:29,281 INFO L422 BasicCegarLoop]: trace histogram [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, 1] [2021-02-23 17:58:29,281 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-23 17:58:29,282 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 17:58:29,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 17:58:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash 572347764, now seen corresponding path program 1 times [2021-02-23 17:58:29,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 17:58:29,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [601451518] [2021-02-23 17:58:29,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 17:58:29,287 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 17:58:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:29,434 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:29,435 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:29,435 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:29,436 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 17:58:29,439 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:29,440 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 17:58:29,444 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:29,444 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 17:58:29,453 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:29,454 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-23 17:58:29,468 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:29,469 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-23 17:58:29,504 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:29,507 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 17:58:29,523 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:29,524 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:29,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 17:58:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:29,590 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:29,590 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:29,591 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 17:58:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:29,603 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:29,603 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:29,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 17:58:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:29,645 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:29,646 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 17:58:29,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 17:58:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:29,672 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:29,673 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:29,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 17:58:29,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [601451518] [2021-02-23 17:58:29,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 17:58:29,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-02-23 17:58:29,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355821448] [2021-02-23 17:58:29,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-02-23 17:58:29,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 17:58:29,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-02-23 17:58:29,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2021-02-23 17:58:29,692 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 11 states. [2021-02-23 17:58:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 17:58:30,591 INFO L93 Difference]: Finished difference Result 178 states and 190 transitions. [2021-02-23 17:58:30,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-23 17:58:30,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2021-02-23 17:58:30,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 17:58:30,594 INFO L225 Difference]: With dead ends: 178 [2021-02-23 17:58:30,594 INFO L226 Difference]: Without dead ends: 108 [2021-02-23 17:58:30,597 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2021-02-23 17:58:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-02-23 17:58:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2021-02-23 17:58:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2021-02-23 17:58:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2021-02-23 17:58:30,630 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 57 [2021-02-23 17:58:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 17:58:30,630 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2021-02-23 17:58:30,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2021-02-23 17:58:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2021-02-23 17:58:30,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-23 17:58:30,635 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 17:58:30,635 INFO L422 BasicCegarLoop]: trace histogram [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, 1] [2021-02-23 17:58:30,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-23 17:58:30,636 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 17:58:30,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 17:58:30,637 INFO L82 PathProgramCache]: Analyzing trace with hash -2023865644, now seen corresponding path program 1 times [2021-02-23 17:58:30,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 17:58:30,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [920146196] [2021-02-23 17:58:30,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 17:58:30,644 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 17:58:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:30,762 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,763 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:30,764 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,765 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:30,772 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,773 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:30,780 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,781 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:30,790 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,791 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:30,802 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,805 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:30,817 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,818 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:30,835 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,836 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:30,851 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,852 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:30,873 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,876 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:30,892 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,892 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:30,893 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,894 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:30,907 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,908 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:30,923 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,924 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:30,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 17:58:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:30,973 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,973 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:30,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 17:58:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:30,977 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:30,978 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:30,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 17:58:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:30,999 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:31,000 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:31,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 17:58:31,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:31,005 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:31,006 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 17:58:31,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [920146196] [2021-02-23 17:58:31,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 17:58:31,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-23 17:58:31,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417929042] [2021-02-23 17:58:31,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-23 17:58:31,016 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 17:58:31,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-23 17:58:31,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-02-23 17:58:31,017 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 15 states. [2021-02-23 17:58:32,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 17:58:32,932 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2021-02-23 17:58:32,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-23 17:58:32,932 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2021-02-23 17:58:32,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 17:58:32,936 INFO L225 Difference]: With dead ends: 174 [2021-02-23 17:58:32,936 INFO L226 Difference]: Without dead ends: 172 [2021-02-23 17:58:32,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2021-02-23 17:58:32,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2021-02-23 17:58:32,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 152. [2021-02-23 17:58:32,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2021-02-23 17:58:32,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2021-02-23 17:58:32,981 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 57 [2021-02-23 17:58:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 17:58:32,982 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2021-02-23 17:58:32,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-23 17:58:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2021-02-23 17:58:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-02-23 17:58:32,985 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 17:58:32,985 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 17:58:32,986 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-23 17:58:32,986 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 17:58:32,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 17:58:32,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1959749596, now seen corresponding path program 1 times [2021-02-23 17:58:32,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 17:58:32,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2032064269] [2021-02-23 17:58:32,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 17:58:32,989 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 17:58:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:33,079 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,079 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:33,080 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,081 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,096 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,097 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,107 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,108 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,118 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,121 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,133 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,135 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,148 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,149 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,164 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,166 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,182 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,197 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,199 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,201 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,202 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,220 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,221 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,240 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,240 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,259 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,260 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,279 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,280 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,301 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,302 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:33,303 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,303 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:33,319 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,320 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:33,338 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,338 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:33,378 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 17:58:33,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:33,385 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,386 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:33,386 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 17:58:33,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:33,390 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,390 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:33,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 17:58:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:33,415 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,416 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:33,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 17:58:33,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:33,422 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,423 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:33,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-23 17:58:33,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:33,428 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:33,429 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 17:58:33,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2032064269] [2021-02-23 17:58:33,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 17:58:33,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-23 17:58:33,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878597829] [2021-02-23 17:58:33,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-23 17:58:33,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 17:58:33,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-23 17:58:33,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-23 17:58:33,448 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 20 states. [2021-02-23 17:58:36,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 17:58:36,445 INFO L93 Difference]: Finished difference Result 238 states and 260 transitions. [2021-02-23 17:58:36,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-02-23 17:58:36,445 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2021-02-23 17:58:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 17:58:36,449 INFO L225 Difference]: With dead ends: 238 [2021-02-23 17:58:36,449 INFO L226 Difference]: Without dead ends: 236 [2021-02-23 17:58:36,451 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2021-02-23 17:58:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-02-23 17:58:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 198. [2021-02-23 17:58:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2021-02-23 17:58:36,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 214 transitions. [2021-02-23 17:58:36,526 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 214 transitions. Word has length 78 [2021-02-23 17:58:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 17:58:36,528 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 214 transitions. [2021-02-23 17:58:36,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-23 17:58:36,528 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 214 transitions. [2021-02-23 17:58:36,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2021-02-23 17:58:36,539 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 17:58:36,540 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1] [2021-02-23 17:58:36,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-23 17:58:36,540 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 17:58:36,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 17:58:36,541 INFO L82 PathProgramCache]: Analyzing trace with hash -636463812, now seen corresponding path program 2 times [2021-02-23 17:58:36,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 17:58:36,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1580694278] [2021-02-23 17:58:36,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 17:58:36,545 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 17:58:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:36,690 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,691 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:36,692 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,693 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,699 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,700 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,707 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,709 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,718 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,719 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,730 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,731 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,743 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,744 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,757 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,758 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,773 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,773 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,787 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,788 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,808 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,811 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,813 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,814 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,834 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,835 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,856 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,856 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,880 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,881 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,903 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,905 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,929 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,930 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:36,934 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,935 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:36,954 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,957 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:36,976 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:36,977 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:37,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 17:58:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:37,040 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:37,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:37,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 17:58:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:37,051 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:37,051 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:37,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 17:58:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:37,076 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:37,076 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:37,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 17:58:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:37,087 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:37,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:37,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-23 17:58:37,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:37,095 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:37,095 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 17:58:37,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1580694278] [2021-02-23 17:58:37,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 17:58:37,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-23 17:58:37,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518128111] [2021-02-23 17:58:37,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-23 17:58:37,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 17:58:37,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-23 17:58:37,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-23 17:58:37,132 INFO L87 Difference]: Start difference. First operand 198 states and 214 transitions. Second operand 20 states. [2021-02-23 17:58:39,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 17:58:39,957 INFO L93 Difference]: Finished difference Result 281 states and 307 transitions. [2021-02-23 17:58:39,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-02-23 17:58:39,957 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 78 [2021-02-23 17:58:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 17:58:39,960 INFO L225 Difference]: With dead ends: 281 [2021-02-23 17:58:39,961 INFO L226 Difference]: Without dead ends: 279 [2021-02-23 17:58:39,962 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2021-02-23 17:58:39,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2021-02-23 17:58:40,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 243. [2021-02-23 17:58:40,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2021-02-23 17:58:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 264 transitions. [2021-02-23 17:58:40,006 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 264 transitions. Word has length 78 [2021-02-23 17:58:40,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 17:58:40,006 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 264 transitions. [2021-02-23 17:58:40,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-23 17:58:40,006 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 264 transitions. [2021-02-23 17:58:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-02-23 17:58:40,008 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 17:58:40,008 INFO L422 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-23 17:58:40,008 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-23 17:58:40,008 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 17:58:40,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 17:58:40,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1871950108, now seen corresponding path program 1 times [2021-02-23 17:58:40,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 17:58:40,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [410780703] [2021-02-23 17:58:40,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 17:58:40,011 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 17:58:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:40,053 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,054 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:40,054 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,055 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 17:58:40,058 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,059 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 17:58:40,063 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,064 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 17:58:40,069 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,069 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 17:58:40,078 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,078 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-02-23 17:58:40,085 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,086 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-23 17:58:40,100 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,101 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-23 17:58:40,116 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,117 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-23 17:58:40,134 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,134 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 17:58:40,150 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,151 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 17:58:40,168 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,169 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:40,184 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,184 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:40,199 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,200 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:40,241 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 17:58:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:40,261 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,264 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:40,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 17:58:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:40,268 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,268 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:40,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 17:58:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:40,288 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,289 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 17:58:40,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 17:58:40,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:40,310 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,311 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:40,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-02-23 17:58:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:40,315 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,316 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:40,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-02-23 17:58:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:40,320 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:40,321 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-02-23 17:58:40,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [410780703] [2021-02-23 17:58:40,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 17:58:40,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-02-23 17:58:40,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661105455] [2021-02-23 17:58:40,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-02-23 17:58:40,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 17:58:40,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-02-23 17:58:40,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-02-23 17:58:40,353 INFO L87 Difference]: Start difference. First operand 243 states and 264 transitions. Second operand 16 states. [2021-02-23 17:58:41,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 17:58:41,896 INFO L93 Difference]: Finished difference Result 257 states and 281 transitions. [2021-02-23 17:58:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-02-23 17:58:41,897 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2021-02-23 17:58:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 17:58:41,899 INFO L225 Difference]: With dead ends: 257 [2021-02-23 17:58:41,899 INFO L226 Difference]: Without dead ends: 157 [2021-02-23 17:58:41,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2021-02-23 17:58:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2021-02-23 17:58:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 133. [2021-02-23 17:58:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2021-02-23 17:58:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 137 transitions. [2021-02-23 17:58:41,923 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 137 transitions. Word has length 77 [2021-02-23 17:58:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 17:58:41,923 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 137 transitions. [2021-02-23 17:58:41,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-02-23 17:58:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 137 transitions. [2021-02-23 17:58:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-23 17:58:41,925 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 17:58:41,925 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2021-02-23 17:58:41,925 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-23 17:58:41,925 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 17:58:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 17:58:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash -177855180, now seen corresponding path program 2 times [2021-02-23 17:58:41,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 17:58:41,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [638282442] [2021-02-23 17:58:41,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 17:58:41,928 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 17:58:41,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:41,987 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:41,987 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:41,988 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:41,989 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:41,995 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:41,995 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,002 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,003 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,011 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,012 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,021 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,022 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,032 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,033 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,045 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,045 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,058 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,059 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,073 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,074 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,092 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,094 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,096 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,097 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,114 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,115 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,136 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,137 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,159 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,160 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,184 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,185 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,209 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,211 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,211 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,212 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,236 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,239 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,268 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,269 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,298 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,299 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,328 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,329 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,358 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,359 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:42,359 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,359 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:42,383 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,383 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:42,409 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,409 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:42,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 17:58:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:42,469 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,471 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:42,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 17:58:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:42,474 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,475 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:42,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 17:58:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:42,503 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,504 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:42,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 17:58:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:42,512 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,512 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:42,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-23 17:58:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:42,527 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,527 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:42,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-02-23 17:58:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:42,534 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:42,534 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:42,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 17:58:42,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [638282442] [2021-02-23 17:58:42,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 17:58:42,560 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-02-23 17:58:42,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020319557] [2021-02-23 17:58:42,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-02-23 17:58:42,560 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 17:58:42,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-02-23 17:58:42,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-02-23 17:58:42,562 INFO L87 Difference]: Start difference. First operand 133 states and 137 transitions. Second operand 25 states. [2021-02-23 17:58:46,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 17:58:46,184 INFO L93 Difference]: Finished difference Result 180 states and 185 transitions. [2021-02-23 17:58:46,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2021-02-23 17:58:46,186 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2021-02-23 17:58:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 17:58:46,189 INFO L225 Difference]: With dead ends: 180 [2021-02-23 17:58:46,189 INFO L226 Difference]: Without dead ends: 118 [2021-02-23 17:58:46,191 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=632, Invalid=3028, Unknown=0, NotChecked=0, Total=3660 [2021-02-23 17:58:46,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-02-23 17:58:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 112. [2021-02-23 17:58:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2021-02-23 17:58:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2021-02-23 17:58:46,210 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 99 [2021-02-23 17:58:46,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 17:58:46,210 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2021-02-23 17:58:46,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-02-23 17:58:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2021-02-23 17:58:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-23 17:58:46,212 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 17:58:46,212 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1] [2021-02-23 17:58:46,212 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-23 17:58:46,212 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 17:58:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 17:58:46,213 INFO L82 PathProgramCache]: Analyzing trace with hash 852518516, now seen corresponding path program 3 times [2021-02-23 17:58:46,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 17:58:46,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1237448015] [2021-02-23 17:58:46,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 17:58:46,215 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-23 17:58:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:46,272 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,272 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:46,273 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,274 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,280 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,281 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,288 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,289 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,298 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,299 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,309 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,310 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,323 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,323 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,337 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,338 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,353 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,354 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,369 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,370 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,388 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,389 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,390 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,391 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,408 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,409 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,429 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,430 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,450 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,451 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,471 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,472 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,492 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,493 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,493 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,494 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,516 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,517 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,541 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,543 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,567 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,567 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,591 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,592 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,624 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,625 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 17:58:46,625 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,626 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:46,652 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,653 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 17:58:46,681 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,682 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:46,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 17:58:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:46,749 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,749 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:46,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 17:58:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:46,754 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,755 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:46,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2021-02-23 17:58:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:46,783 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,783 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:46,783 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-02-23 17:58:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:46,787 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,788 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:46,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2021-02-23 17:58:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:46,792 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,792 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:46,793 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-02-23 17:58:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 17:58:46,796 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 17:58:46,797 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 17:58:46,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-02-23 17:58:46,819 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1237448015] [2021-02-23 17:58:46,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 17:58:46,820 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-02-23 17:58:46,820 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731436516] [2021-02-23 17:58:46,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-02-23 17:58:46,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 17:58:46,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-02-23 17:58:46,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-02-23 17:58:46,822 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 25 states. [2021-02-23 17:58:50,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 17:58:50,122 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2021-02-23 17:58:50,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-02-23 17:58:50,123 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 99 [2021-02-23 17:58:50,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 17:58:50,124 INFO L225 Difference]: With dead ends: 125 [2021-02-23 17:58:50,124 INFO L226 Difference]: Without dead ends: 0 [2021-02-23 17:58:50,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=569, Invalid=2737, Unknown=0, NotChecked=0, Total=3306 [2021-02-23 17:58:50,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-23 17:58:50,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-23 17:58:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-23 17:58:50,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-23 17:58:50,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2021-02-23 17:58:50,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 17:58:50,128 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-23 17:58:50,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-02-23 17:58:50,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-23 17:58:50,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-23 17:58:50,128 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-23 17:58:50,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-23 17:58:52,826 WARN L202 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-23 17:58:52,967 WARN L202 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 29 [2021-02-23 17:58:53,166 WARN L202 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 40 [2021-02-23 17:58:53,358 WARN L202 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2021-02-23 17:58:53,705 WARN L202 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 45 [2021-02-23 17:58:53,958 WARN L202 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-23 17:58:54,237 WARN L202 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 44 [2021-02-23 17:58:54,510 WARN L202 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-23 17:58:54,867 WARN L202 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 50 [2021-02-23 17:58:55,077 WARN L202 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 17:58:55,318 WARN L202 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 17:58:55,634 WARN L202 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 46 [2021-02-23 17:58:55,884 WARN L202 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-23 17:58:56,149 WARN L202 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 47 [2021-02-23 17:58:56,354 WARN L202 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 17:58:56,655 WARN L202 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-23 17:58:56,913 WARN L202 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-23 17:58:57,129 WARN L202 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 17:58:57,438 WARN L202 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 49 [2021-02-23 17:58:57,608 WARN L202 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 33 [2021-02-23 17:58:57,783 WARN L202 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2021-02-23 17:58:58,070 WARN L202 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-23 17:58:58,381 WARN L202 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 51 [2021-02-23 17:58:58,595 WARN L202 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 17:58:58,902 WARN L202 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 51 [2021-02-23 17:58:59,194 WARN L202 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 47 [2021-02-23 17:58:59,408 WARN L202 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 17:58:59,713 WARN L202 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2021-02-23 17:59:00,065 WARN L202 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-23 17:59:00,231 WARN L202 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 39 [2021-02-23 17:59:00,536 WARN L202 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2021-02-23 17:59:00,773 WARN L202 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 17:59:01,026 WARN L202 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2021-02-23 17:59:01,241 WARN L202 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 29 [2021-02-23 17:59:01,529 WARN L202 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 45 [2021-02-23 17:59:01,796 WARN L202 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 43 [2021-02-23 17:59:02,097 WARN L202 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2021-02-23 17:59:02,325 WARN L202 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 40 [2021-02-23 17:59:02,587 WARN L202 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 42 [2021-02-23 17:59:02,592 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2021-02-23 17:59:02,592 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2021-02-23 17:59:02,592 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2021-02-23 17:59:02,592 INFO L192 CegarLoopUtils]: At program point L5-4(line 5) the Hoare annotation is: true [2021-02-23 17:59:02,592 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-23 17:59:02,593 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-23 17:59:02,593 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2021-02-23 17:59:02,593 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#t~string6.offset)| |#t~string6.offset|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string7.offset| |old(#t~string7.offset)|) (= |old(#t~string7.base)| |#t~string7.base|) (= |old(#valid)| |#valid|)) [2021-02-23 17:59:02,593 INFO L192 CegarLoopUtils]: At program point L5(line 5) the Hoare annotation is: true [2021-02-23 17:59:02,593 INFO L192 CegarLoopUtils]: At program point L5-1(line 5) the Hoare annotation is: true [2021-02-23 17:59:02,593 INFO L192 CegarLoopUtils]: At program point L5-2(line 5) the Hoare annotation is: true [2021-02-23 17:59:02,593 INFO L192 CegarLoopUtils]: At program point L5-3(line 5) the Hoare annotation is: true [2021-02-23 17:59:02,593 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-23 17:59:02,593 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-23 17:59:02,594 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-23 17:59:02,594 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-23 17:59:02,594 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-23 17:59:02,594 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2021-02-23 17:59:02,594 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-23 17:59:02,594 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-23 17:59:02,594 INFO L192 CegarLoopUtils]: At program point L8-3(lines 7 9) the Hoare annotation is: true [2021-02-23 17:59:02,594 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notEXIT(lines 7 9) the Hoare annotation is: true [2021-02-23 17:59:02,594 INFO L185 CegarLoopUtils]: At program point mainENTRY(lines 41 50) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-23 17:59:02,594 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 41 50) the Hoare annotation is: true [2021-02-23 17:59:02,595 INFO L192 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: true [2021-02-23 17:59:02,595 INFO L192 CegarLoopUtils]: At program point L48-1(line 48) the Hoare annotation is: true [2021-02-23 17:59:02,595 INFO L185 CegarLoopUtils]: 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) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2021-02-23 17:59:02,595 INFO L185 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-23 17:59:02,595 INFO L192 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: true [2021-02-23 17:59:02,595 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 41 50) the Hoare annotation is: true [2021-02-23 17:59:02,595 INFO L185 CegarLoopUtils]: At program point L44(line 44) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-23 17:59:02,596 INFO L185 CegarLoopUtils]: At program point L45-1(line 45) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc17.base|)) [2021-02-23 17:59:02,596 INFO L192 CegarLoopUtils]: At program point L46-2(line 46) the Hoare annotation is: true [2021-02-23 17:59:02,596 INFO L185 CegarLoopUtils]: At program point L44-1(line 44) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-23 17:59:02,596 INFO L192 CegarLoopUtils]: At program point L46-3(line 46) the Hoare annotation is: true [2021-02-23 17:59:02,596 INFO L185 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-23 17:59:02,596 INFO L185 CegarLoopUtils]: At program point L42-1(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-23 17:59:02,597 INFO L185 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 17:59:02,597 INFO L185 CegarLoopUtils]: At program point L35-2(line 35) the Hoare annotation is: (let ((.cse8 ((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|) .cse8))) (.cse2 (= check_~ax~0 0)) (.cse3 (= |check_#t~mem15| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse8)) (.cse6 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 .cse6) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (let ((.cse7 (+ check_~y 1))) (and .cse2 .cse3 (<= .cse7 |check_#in~n|) .cse4 (<= .cse7 check_~n) .cse5 .cse6)))))) [2021-02-23 17:59:02,597 INFO L185 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 17:59:02,597 INFO L192 CegarLoopUtils]: At program point checkENTRY(lines 16 39) the Hoare annotation is: true [2021-02-23 17:59:02,597 INFO L185 CegarLoopUtils]: At program point L25(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 17:59:02,598 INFO L185 CegarLoopUtils]: At program point L25-1(line 25) 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|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 .cse4 (= check_~x 0))) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-23 17:59:02,598 INFO L185 CegarLoopUtils]: At program point L23(line 23) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 17:59:02,598 INFO L185 CegarLoopUtils]: At program point L25-2(lines 25 26) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 (= |check_#t~mem9| 0) .cse4 (= check_~x 0)))))) [2021-02-23 17:59:02,599 INFO L185 CegarLoopUtils]: At program point L25-3(line 25) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 (= |check_#t~mem9| 0) .cse4 (= check_~x 0)))))) [2021-02-23 17:59:02,599 INFO L185 CegarLoopUtils]: At program point L25-4(line 25) 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|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse2 .cse3 .cse4 (= check_~x 0))) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-23 17:59:02,599 INFO L185 CegarLoopUtils]: At program point L25-5(line 25) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 17:59:02,599 INFO L185 CegarLoopUtils]: At program point L25-6(line 25) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 (= |check_#t~post10| 0) .cse4 (= check_~x 0))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 .cse5 .cse1 (and .cse2 (<= 1 |check_#t~post10|) .cse3 .cse4 (<= 1 check_~x)))))) [2021-02-23 17:59:02,600 INFO L185 CegarLoopUtils]: At program point L25-7(line 25) 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|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 (= |check_#t~post10| 0) .cse4 (<= 1 check_~x))) (or .cse0 (and .cse2 (<= 1 |check_#t~post10|) .cse3 .cse4 (<= 2 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-23 17:59:02,600 INFO L185 CegarLoopUtils]: At program point L17(line 17) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 17:59:02,600 INFO L185 CegarLoopUtils]: At program point L17-1(line 17) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse2 (<= .cse7 |check_#in~n|)) (.cse3 (<= .cse7 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 (= (select |#memory_int| check_~a.base) .cse4) (<= 1 check_~x)) .cse5 .cse1) (or (and .cse2 .cse3 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))))))) [2021-02-23 17:59:02,601 INFO L185 CegarLoopUtils]: At program point L25-9(line 25) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x))) .cse4 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 17:59:02,601 INFO L185 CegarLoopUtils]: At program point L25-10(line 25) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x))) .cse4 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 17:59:02,601 INFO L185 CegarLoopUtils]: At program point L25-11(lines 25 26) the Hoare annotation is: (let ((.cse9 ((as const (Array Int Int)) 0)) (.cse10 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse10 |check_#in~n|)) (.cse4 (<= .cse10 check_~n)) (.cse2 (<= 2 check_~x)) (.cse5 (= (select |#memory_int| check_~a.base) .cse9)) (.cse6 (<= 1 check_~x)) (.cse7 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse8 (<= (+ check_~y 2) check_~n))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 .cse6) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 .cse5 .cse2) .cse7 .cse1 (and .cse8 .cse5 .cse6)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse7 .cse1 .cse8)))) [2021-02-23 17:59:02,601 INFO L185 CegarLoopUtils]: At program point checkFINAL(lines 16 39) the Hoare annotation is: (let ((.cse2 ((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|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 17:59:02,602 INFO L185 CegarLoopUtils]: At program point L36(line 36) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse2 (= check_~ax~0 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (<= 1 check_~x)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse4 .cse5) .cse1) (or (let ((.cse6 (+ check_~y 1))) (and .cse2 (<= .cse6 |check_#in~n|) .cse3 (<= .cse6 check_~n) .cse4 .cse5)) .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 17:59:02,602 INFO L185 CegarLoopUtils]: At program point L36-1(line 36) the Hoare annotation is: (let ((.cse2 ((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|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) (and (= check_~ax~0 0) (= check_~ai~0 0) (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)) .cse1)))) [2021-02-23 17:59:02,602 INFO L185 CegarLoopUtils]: At program point L34(line 34) the Hoare annotation is: (let ((.cse6 ((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|) .cse6))) (.cse2 (= |check_#t~mem14| 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse5 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (let ((.cse3 (+ check_~y 1))) (and .cse2 (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) .cse4 .cse5)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse4 .cse5))))) [2021-02-23 17:59:02,602 INFO L185 CegarLoopUtils]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse7 ((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|) .cse7))) (.cse2 (= |check_#t~mem14| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse6 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse3 (+ check_~y 1))) (and .cse2 (<= .cse3 |check_#in~n|) .cse4 (<= .cse3 check_~n) .cse5 .cse6)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse4 .cse5 .cse6))))) [2021-02-23 17:59:02,602 INFO L185 CegarLoopUtils]: 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|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 17:59:02,603 INFO L185 CegarLoopUtils]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 17:59:02,603 INFO L185 CegarLoopUtils]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 17:59:02,603 INFO L185 CegarLoopUtils]: At program point L28(line 28) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 17:59:02,603 INFO L185 CegarLoopUtils]: At program point L28-1(line 28) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 17:59:02,604 INFO L185 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0))) (let ((.cse4 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x))) .cse4 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 17:59:02,604 INFO L185 CegarLoopUtils]: At program point L28-2(line 28) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) .cse3 .cse4)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 17:59:02,604 INFO L185 CegarLoopUtils]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse2 .cse1 (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 check_~n) (<= .cse3 |check_#in~n|)))) (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 .cse2 .cse1 (let ((.cse4 (+ check_~y 1))) (and (<= (+ |check_#t~post11| 1) check_~n) (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (= (select |#memory_int| check_~a.base) .cse5) (<= 1 check_~x))))))) [2021-02-23 17:59:02,604 INFO L185 CegarLoopUtils]: At program point L26-2(line 26) the Hoare annotation is: (let ((.cse2 ((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|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and (<= (+ |check_#t~post11| 1) check_~n) (<= (+ check_~y 2) check_~n) (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)))))) [2021-02-23 17:59:02,605 INFO L185 CegarLoopUtils]: At program point L20(line 20) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 17:59:02,605 INFO L185 CegarLoopUtils]: At program point L20-1(line 20) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse5 (not (<= 1 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse8 |check_#in~n|)) (.cse3 (<= .cse8 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) .cse5 .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse5 .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|)))) (or .cse0 (and .cse2 .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 17:59:02,605 INFO L185 CegarLoopUtils]: At program point checkEXIT(lines 16 39) the Hoare annotation is: (let ((.cse2 ((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|) .cse2)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and (= (select |#memory_int| check_~a.base) .cse2) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-23 17:59:02,605 INFO L185 CegarLoopUtils]: At program point L16(lines 16 39) 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)))) [2021-02-23 17:59:02,605 INFO L185 CegarLoopUtils]: At program point L16-1(lines 16 39) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= (+ check_~y 1) |check_#in~n|)) (.cse3 (not (<= 1 |check_#in~x|))) (.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 (and .cse2 (<= 1 check_~x)) .cse3 .cse1) (or .cse0 (and .cse2 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse3 .cse1 (<= (+ check_~y 2) |check_#in~n|)))) [2021-02-23 17:59:02,606 INFO L185 CegarLoopUtils]: At program point L16-2(lines 16 39) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= (+ check_~y 1) |check_#in~n|)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5)) (.cse4 (not (<= 1 |check_#in~x|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (and .cse2 .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 .cse1 (<= (+ check_~y 2) |check_#in~n|)) (or .cse0 (and .cse2 .cse3 (<= 1 check_~x)) .cse4 .cse1)))) [2021-02-23 17:59:02,606 INFO L185 CegarLoopUtils]: At program point L35(line 35) the Hoare annotation is: (let ((.cse6 ((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|) .cse6))) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse6)) (.cse4 (<= 1 check_~x))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) .cse2 (<= .cse5 check_~n) .cse3 .cse4)))))) [2021-02-23 17:59:02,606 INFO L185 CegarLoopUtils]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= |check_#t~mem15| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse7)) (.cse5 (<= 1 check_~x)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5)) (or .cse0 (let ((.cse6 (+ check_~y 1))) (and .cse2 (<= .cse6 |check_#in~n|) .cse3 (<= .cse6 check_~n) .cse4 .cse5)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-23 17:59:02,606 INFO L192 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2021-02-23 17:59:02,606 INFO L185 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-23 17:59:02,606 INFO L185 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-23 17:59:02,607 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-23 17:59:02,607 INFO L185 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-23 17:59:02,607 INFO L185 CegarLoopUtils]: At program point L11-4(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-23 17:59:02,607 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-23 17:59:02,607 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-23 17:59:02,607 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-02-23 17:59:02,607 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-02-23 17:59:02,623 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:240) 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.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:558) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-02-23 17:59:02,626 INFO L168 Benchmark]: Toolchain (without parser) took 36398.72 ms. Allocated memory was 154.1 MB in the beginning and 348.1 MB in the end (delta: 194.0 MB). Free memory was 129.1 MB in the beginning and 302.5 MB in the end (delta: -173.3 MB). Peak memory consumption was 202.4 MB. Max. memory is 8.0 GB. [2021-02-23 17:59:02,626 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 154.1 MB. Free memory was 132.5 MB in the beginning and 132.4 MB in the end (delta: 97.1 kB). There was no memory consumed. Max. memory is 8.0 GB. [2021-02-23 17:59:02,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.86 ms. Allocated memory is still 154.1 MB. Free memory was 128.1 MB in the beginning and 118.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-02-23 17:59:02,635 INFO L168 Benchmark]: Boogie Preprocessor took 75.30 ms. Allocated memory is still 154.1 MB. Free memory was 118.1 MB in the beginning and 116.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-02-23 17:59:02,635 INFO L168 Benchmark]: RCFGBuilder took 521.09 ms. Allocated memory is still 154.1 MB. Free memory was 116.4 MB in the beginning and 94.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. [2021-02-23 17:59:02,635 INFO L168 Benchmark]: TraceAbstraction took 35397.36 ms. Allocated memory was 154.1 MB in the beginning and 348.1 MB in the end (delta: 194.0 MB). Free memory was 94.3 MB in the beginning and 302.5 MB in the end (delta: -208.1 MB). Peak memory consumption was 167.8 MB. Max. memory is 8.0 GB. [2021-02-23 17:59:02,637 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 154.1 MB. Free memory was 132.5 MB in the beginning and 132.4 MB in the end (delta: 97.1 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 379.86 ms. Allocated memory is still 154.1 MB. Free memory was 128.1 MB in the beginning and 118.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 75.30 ms. Allocated memory is still 154.1 MB. Free memory was 118.1 MB in the beginning and 116.5 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 521.09 ms. Allocated memory is still 154.1 MB. Free memory was 116.4 MB in the beginning and 94.8 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 35397.36 ms. Allocated memory was 154.1 MB in the beginning and 348.1 MB in the end (delta: 194.0 MB). Free memory was 94.3 MB in the beginning and 302.5 MB in the end (delta: -208.1 MB). Peak memory consumption was 167.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 7]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 41]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 10]: 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:240) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...