/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_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-b7b32d2 [2021-02-21 20:31:08,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-21 20:31:08,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-21 20:31:08,772 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-21 20:31:08,773 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-21 20:31:08,774 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-21 20:31:08,776 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-21 20:31:08,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-21 20:31:08,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-21 20:31:08,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-21 20:31:08,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-21 20:31:08,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-21 20:31:08,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-21 20:31:08,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-21 20:31:08,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-21 20:31:08,789 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-21 20:31:08,790 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-21 20:31:08,791 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-21 20:31:08,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-21 20:31:08,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-21 20:31:08,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-21 20:31:08,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-21 20:31:08,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-21 20:31:08,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-21 20:31:08,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-21 20:31:08,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-21 20:31:08,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-21 20:31:08,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-21 20:31:08,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-21 20:31:08,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-21 20:31:08,825 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-21 20:31:08,826 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-21 20:31:08,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-21 20:31:08,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-21 20:31:08,831 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-21 20:31:08,831 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-21 20:31:08,832 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-21 20:31:08,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-21 20:31:08,833 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-21 20:31:08,834 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-21 20:31:08,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-21 20:31:08,836 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-21 20:31:08,859 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-21 20:31:08,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-21 20:31:08,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-21 20:31:08,864 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-21 20:31:08,865 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-21 20:31:08,865 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-21 20:31:08,865 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-21 20:31:08,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-21 20:31:08,866 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-21 20:31:08,866 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-21 20:31:08,867 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-21 20:31:08,867 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-21 20:31:08,868 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-21 20:31:08,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-21 20:31:08,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-21 20:31:08,868 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-21 20:31:08,869 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-21 20:31:08,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-21 20:31:08,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-21 20:31:08,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-21 20:31:08,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-21 20:31:08,870 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-21 20:31:08,870 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-21 20:31:09,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-21 20:31:09,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-21 20:31:09,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-21 20:31:09,333 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-21 20:31:09,334 INFO L275 PluginConnector]: CDTParser initialized [2021-02-21 20:31:09,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2021-02-21 20:31:09,412 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa26f4f6/3c69917ef0fc4880b0a797da17648fa7/FLAG685650461 [2021-02-21 20:31:09,967 INFO L306 CDTParser]: Found 1 translation units. [2021-02-21 20:31:09,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2021-02-21 20:31:09,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa26f4f6/3c69917ef0fc4880b0a797da17648fa7/FLAG685650461 [2021-02-21 20:31:10,364 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aaa26f4f6/3c69917ef0fc4880b0a797da17648fa7 [2021-02-21 20:31:10,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-21 20:31:10,386 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-21 20:31:10,389 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-21 20:31:10,390 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-21 20:31:10,394 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-21 20:31:10,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:31:10" (1/1) ... [2021-02-21 20:31:10,397 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1809e55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:10, skipping insertion in model container [2021-02-21 20:31:10,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 08:31:10" (1/1) ... [2021-02-21 20:31:10,406 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-21 20:31:10,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-21 20:31:10,651 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_onepoint.c[502,515] [2021-02-21 20:31:10,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:31:10,708 INFO L203 MainTranslator]: Completed pre-run [2021-02-21 20:31:10,733 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_onepoint.c[502,515] [2021-02-21 20:31:10,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-21 20:31:10,791 INFO L208 MainTranslator]: Completed translation [2021-02-21 20:31:10,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:10 WrapperNode [2021-02-21 20:31:10,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-21 20:31:10,794 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-21 20:31:10,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-21 20:31:10,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-21 20:31:10,809 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:10" (1/1) ... [2021-02-21 20:31:10,810 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:10" (1/1) ... [2021-02-21 20:31:10,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:10" (1/1) ... [2021-02-21 20:31:10,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:10" (1/1) ... [2021-02-21 20:31:10,854 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:10" (1/1) ... [2021-02-21 20:31:10,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:10" (1/1) ... [2021-02-21 20:31:10,860 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:10" (1/1) ... [2021-02-21 20:31:10,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-21 20:31:10,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-21 20:31:10,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-21 20:31:10,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-21 20:31:10,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:10" (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-21 20:31:10,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-21 20:31:10,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-21 20:31:10,977 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-21 20:31:10,977 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-02-21 20:31:10,977 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-02-21 20:31:10,977 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-02-21 20:31:10,977 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-21 20:31:10,978 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-02-21 20:31:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-21 20:31:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-21 20:31:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-21 20:31:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-21 20:31:10,978 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-21 20:31:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-21 20:31:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-02-21 20:31:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-02-21 20:31:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-21 20:31:10,979 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-02-21 20:31:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-21 20:31:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-21 20:31:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-02-21 20:31:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-02-21 20:31:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-21 20:31:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-21 20:31:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-21 20:31:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-21 20:31:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-21 20:31:11,441 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-21 20:31:11,441 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-02-21 20:31:11,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:31:11 BoogieIcfgContainer [2021-02-21 20:31:11,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-21 20:31:11,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-21 20:31:11,446 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-21 20:31:11,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-21 20:31:11,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 08:31:10" (1/3) ... [2021-02-21 20:31:11,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e07528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:31:11, skipping insertion in model container [2021-02-21 20:31:11,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 08:31:10" (2/3) ... [2021-02-21 20:31:11,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e07528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 08:31:11, skipping insertion in model container [2021-02-21 20:31:11,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 08:31:11" (3/3) ... [2021-02-21 20:31:11,453 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2021-02-21 20:31:11,461 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-21 20:31:11,466 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-21 20:31:11,485 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-21 20:31:11,511 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-21 20:31:11,511 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-21 20:31:11,511 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-02-21 20:31:11,511 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-21 20:31:11,512 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-21 20:31:11,512 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-21 20:31:11,512 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-21 20:31:11,512 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-21 20:31:11,529 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2021-02-21 20:31:11,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-02-21 20:31:11,539 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:11,540 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:11,540 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:11,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:11,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1226469690, now seen corresponding path program 1 times [2021-02-21 20:31:11,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:11,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1647829936] [2021-02-21 20:31:11,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:11,635 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:11,860 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:11,861 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:11,873 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:11,876 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:11,899 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:11,900 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:11,910 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:11,911 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:11,923 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:11,925 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:11,936 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:11,937 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:11,946 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:11,946 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:11,956 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:11,956 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:11,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:12,029 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,031 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:12,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:12,045 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,046 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:12,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-21 20:31:12,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:12,058 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,059 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:12,079 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-21 20:31:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:12,092 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:12,093 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:12,111 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-21 20:31:12,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1647829936] [2021-02-21 20:31:12,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:12,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-21 20:31:12,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316309735] [2021-02-21 20:31:12,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-21 20:31:12,121 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-21 20:31:12,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-02-21 20:31:12,137 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 10 states. [2021-02-21 20:31:13,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:13,256 INFO L93 Difference]: Finished difference Result 227 states and 263 transitions. [2021-02-21 20:31:13,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-21 20:31:13,258 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2021-02-21 20:31:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:13,270 INFO L225 Difference]: With dead ends: 227 [2021-02-21 20:31:13,270 INFO L226 Difference]: Without dead ends: 143 [2021-02-21 20:31:13,275 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-02-21 20:31:13,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-02-21 20:31:13,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 127. [2021-02-21 20:31:13,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-02-21 20:31:13,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2021-02-21 20:31:13,353 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 45 [2021-02-21 20:31:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:13,353 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2021-02-21 20:31:13,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-21 20:31:13,354 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2021-02-21 20:31:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-21 20:31:13,356 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:13,357 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:13,357 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-21 20:31:13,357 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:13,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:13,358 INFO L82 PathProgramCache]: Analyzing trace with hash 41918952, now seen corresponding path program 1 times [2021-02-21 20:31:13,358 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:13,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [516626197] [2021-02-21 20:31:13,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:13,362 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:13,537 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,538 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:13,539 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,540 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:13,549 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,551 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-02-21 20:31:13,569 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,570 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-21 20:31:13,587 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,589 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-21 20:31:13,601 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,603 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-21 20:31:13,616 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,617 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:31:13,636 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,637 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:31:13,650 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,651 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:13,662 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,662 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:13,674 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,675 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:13,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:13,745 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,746 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:13,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:13,754 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,756 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:13,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-21 20:31:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:13,765 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,766 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:13,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-21 20:31:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:13,803 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,804 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:13,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-02-21 20:31:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:13,837 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:13,838 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:13,847 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-21 20:31:13,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [516626197] [2021-02-21 20:31:13,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:13,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-02-21 20:31:13,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644174475] [2021-02-21 20:31:13,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-02-21 20:31:13,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:13,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-02-21 20:31:13,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-02-21 20:31:13,853 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 14 states. [2021-02-21 20:31:14,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:14,879 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2021-02-21 20:31:14,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-02-21 20:31:14,880 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2021-02-21 20:31:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:14,882 INFO L225 Difference]: With dead ends: 133 [2021-02-21 20:31:14,882 INFO L226 Difference]: Without dead ends: 113 [2021-02-21 20:31:14,884 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2021-02-21 20:31:14,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-02-21 20:31:14,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-02-21 20:31:14,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2021-02-21 20:31:14,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2021-02-21 20:31:14,946 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 57 [2021-02-21 20:31:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:14,947 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2021-02-21 20:31:14,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-02-21 20:31:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2021-02-21 20:31:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-02-21 20:31:14,952 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:14,953 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:14,953 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-21 20:31:14,953 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:14,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:14,964 INFO L82 PathProgramCache]: Analyzing trace with hash 411171829, now seen corresponding path program 1 times [2021-02-21 20:31:14,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:14,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660308089] [2021-02-21 20:31:14,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:14,968 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:15,048 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,049 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:15,050 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,051 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,057 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,058 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,066 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,067 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,076 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,076 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,086 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,087 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,099 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,100 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,113 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,114 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,128 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,129 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,144 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,145 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,162 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,162 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:15,163 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,163 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:15,177 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,177 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:15,191 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,192 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:15,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:15,234 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,235 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:15,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:15,238 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,239 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:15,239 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-21 20:31:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:15,243 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,243 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:15,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-21 20:31:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:15,264 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,264 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:15,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-21 20:31:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:15,270 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,270 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:15,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-21 20:31:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:15,275 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:15,276 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-02-21 20:31:15,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660308089] [2021-02-21 20:31:15,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:15,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-21 20:31:15,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109362185] [2021-02-21 20:31:15,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-21 20:31:15,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:15,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-21 20:31:15,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-02-21 20:31:15,290 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 15 states. [2021-02-21 20:31:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:17,002 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2021-02-21 20:31:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-21 20:31:17,003 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2021-02-21 20:31:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:17,006 INFO L225 Difference]: With dead ends: 184 [2021-02-21 20:31:17,006 INFO L226 Difference]: Without dead ends: 182 [2021-02-21 20:31:17,007 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2021-02-21 20:31:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-02-21 20:31:17,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 156. [2021-02-21 20:31:17,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2021-02-21 20:31:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2021-02-21 20:31:17,048 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 72 [2021-02-21 20:31:17,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:17,049 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2021-02-21 20:31:17,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-21 20:31:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2021-02-21 20:31:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-02-21 20:31:17,050 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:17,051 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:17,051 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-21 20:31:17,051 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:17,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:17,051 INFO L82 PathProgramCache]: Analyzing trace with hash -710591147, now seen corresponding path program 1 times [2021-02-21 20:31:17,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:17,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1167424611] [2021-02-21 20:31:17,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:17,054 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:17,111 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,112 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:17,113 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,114 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:17,119 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,120 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:17,127 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,128 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:17,136 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,137 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:17,147 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,147 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:17,159 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,160 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:17,177 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,182 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:17,194 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,195 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:17,208 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,209 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:17,222 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,223 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:17,224 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,224 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:17,236 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,237 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:17,263 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,264 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:17,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:17,309 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,310 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:17,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:17,313 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,313 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:17,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-21 20:31:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:17,317 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,317 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:17,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-21 20:31:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:17,335 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,335 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:17,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-21 20:31:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:17,340 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,341 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:17,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-21 20:31:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:17,345 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:17,345 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-02-21 20:31:17,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1167424611] [2021-02-21 20:31:17,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:17,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-21 20:31:17,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2635346] [2021-02-21 20:31:17,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-21 20:31:17,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:17,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-21 20:31:17,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-02-21 20:31:17,358 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand 15 states. [2021-02-21 20:31:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:19,114 INFO L93 Difference]: Finished difference Result 226 states and 247 transitions. [2021-02-21 20:31:19,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-21 20:31:19,115 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2021-02-21 20:31:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:19,118 INFO L225 Difference]: With dead ends: 226 [2021-02-21 20:31:19,118 INFO L226 Difference]: Without dead ends: 224 [2021-02-21 20:31:19,119 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2021-02-21 20:31:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-02-21 20:31:19,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 199. [2021-02-21 20:31:19,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2021-02-21 20:31:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 217 transitions. [2021-02-21 20:31:19,163 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 217 transitions. Word has length 72 [2021-02-21 20:31:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:19,164 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 217 transitions. [2021-02-21 20:31:19,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-21 20:31:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 217 transitions. [2021-02-21 20:31:19,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-02-21 20:31:19,166 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:19,166 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:19,167 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-21 20:31:19,167 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:19,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:19,167 INFO L82 PathProgramCache]: Analyzing trace with hash -562495935, now seen corresponding path program 1 times [2021-02-21 20:31:19,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:19,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [527770671] [2021-02-21 20:31:19,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:19,171 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,253 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,253 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,254 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,254 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:19,258 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,258 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:19,262 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,263 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:19,268 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,269 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:19,276 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,276 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-02-21 20:31:19,284 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,285 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-21 20:31:19,298 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,299 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-21 20:31:19,313 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,314 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-21 20:31:19,329 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,330 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:31:19,347 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,348 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:31:19,368 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,370 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:19,383 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,384 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:19,398 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,399 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,449 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,449 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,453 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,453 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,454 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-21 20:31:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,456 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,457 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-21 20:31:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,478 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,478 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:19,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-21 20:31:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,501 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,502 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-21 20:31:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,506 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,507 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-02-21 20:31:19,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:19,511 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:19,512 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:19,523 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-02-21 20:31:19,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [527770671] [2021-02-21 20:31:19,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:19,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-02-21 20:31:19,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723890599] [2021-02-21 20:31:19,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-02-21 20:31:19,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-02-21 20:31:19,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-02-21 20:31:19,526 INFO L87 Difference]: Start difference. First operand 199 states and 217 transitions. Second operand 16 states. [2021-02-21 20:31:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:20,935 INFO L93 Difference]: Finished difference Result 211 states and 231 transitions. [2021-02-21 20:31:20,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-02-21 20:31:20,936 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 84 [2021-02-21 20:31:20,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:20,938 INFO L225 Difference]: With dead ends: 211 [2021-02-21 20:31:20,938 INFO L226 Difference]: Without dead ends: 147 [2021-02-21 20:31:20,940 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=714, Unknown=0, NotChecked=0, Total=870 [2021-02-21 20:31:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-02-21 20:31:20,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 118. [2021-02-21 20:31:20,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-02-21 20:31:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2021-02-21 20:31:20,965 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 84 [2021-02-21 20:31:20,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:20,965 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2021-02-21 20:31:20,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-02-21 20:31:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2021-02-21 20:31:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-21 20:31:20,967 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:20,968 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:20,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-21 20:31:20,968 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:20,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:20,969 INFO L82 PathProgramCache]: Analyzing trace with hash 2003080282, now seen corresponding path program 2 times [2021-02-21 20:31:20,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:20,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [696694811] [2021-02-21 20:31:20,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:20,971 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:21,074 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,074 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:21,075 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,079 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,087 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,088 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,096 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,096 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,106 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,107 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,116 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,118 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,131 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,132 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,145 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,146 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,160 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,161 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,175 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,176 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,192 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,193 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,194 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,194 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,211 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,212 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,230 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,230 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,251 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,252 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,270 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,271 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,290 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,291 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:21,292 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,292 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:21,313 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,313 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:21,333 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,334 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:21,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:21,403 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,403 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:21,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:21,407 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,408 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:21,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-21 20:31:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:21,411 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,413 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:21,434 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-21 20:31:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:21,439 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,440 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:21,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-21 20:31:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:21,448 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,449 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:21,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-21 20:31:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:21,454 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,455 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:21,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-21 20:31:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:21,466 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,467 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:21,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-21 20:31:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:21,473 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:21,473 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:21,492 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-02-21 20:31:21,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [696694811] [2021-02-21 20:31:21,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:21,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-21 20:31:21,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778239739] [2021-02-21 20:31:21,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-21 20:31:21,493 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:21,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-21 20:31:21,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-21 20:31:21,495 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 20 states. [2021-02-21 20:31:23,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:23,650 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2021-02-21 20:31:23,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-02-21 20:31:23,651 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2021-02-21 20:31:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:23,653 INFO L225 Difference]: With dead ends: 173 [2021-02-21 20:31:23,654 INFO L226 Difference]: Without dead ends: 171 [2021-02-21 20:31:23,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 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-21 20:31:23,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-02-21 20:31:23,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 124. [2021-02-21 20:31:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2021-02-21 20:31:23,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2021-02-21 20:31:23,679 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 99 [2021-02-21 20:31:23,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:23,680 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2021-02-21 20:31:23,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-21 20:31:23,680 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2021-02-21 20:31:23,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-21 20:31:23,682 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:23,682 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:23,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-21 20:31:23,682 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:23,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:23,683 INFO L82 PathProgramCache]: Analyzing trace with hash 881317306, now seen corresponding path program 1 times [2021-02-21 20:31:23,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:23,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [756350034] [2021-02-21 20:31:23,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:23,686 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:23,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:23,743 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,744 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:23,745 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,745 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,751 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,752 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,761 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,762 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,770 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,771 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,781 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,781 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,792 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,793 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,805 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,805 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,820 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,821 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,835 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,837 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,852 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,854 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,856 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,858 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,875 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,876 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,895 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,895 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,915 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,917 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,936 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,937 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,956 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,957 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:23,959 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,961 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:23,977 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:23,994 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:24,010 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:24,011 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:24,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:24,055 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:24,055 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:24,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:24,058 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:24,058 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:24,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-21 20:31:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:24,061 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:24,062 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:24,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-21 20:31:24,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:24,085 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:24,086 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:24,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-21 20:31:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:24,091 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:24,091 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:24,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-21 20:31:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:24,095 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:24,096 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:24,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-21 20:31:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:24,100 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:24,100 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:24,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-21 20:31:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:24,106 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:24,107 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:24,125 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-02-21 20:31:24,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [756350034] [2021-02-21 20:31:24,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:24,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-21 20:31:24,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712635851] [2021-02-21 20:31:24,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-21 20:31:24,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:24,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-21 20:31:24,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-21 20:31:24,128 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 20 states. [2021-02-21 20:31:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:26,437 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2021-02-21 20:31:26,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-02-21 20:31:26,439 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2021-02-21 20:31:26,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:26,441 INFO L225 Difference]: With dead ends: 196 [2021-02-21 20:31:26,441 INFO L226 Difference]: Without dead ends: 194 [2021-02-21 20:31:26,442 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 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-21 20:31:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-02-21 20:31:26,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 147. [2021-02-21 20:31:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2021-02-21 20:31:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2021-02-21 20:31:26,476 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 99 [2021-02-21 20:31:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:26,477 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2021-02-21 20:31:26,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-21 20:31:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2021-02-21 20:31:26,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-21 20:31:26,479 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:26,479 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:26,479 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-21 20:31:26,479 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:26,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:26,480 INFO L82 PathProgramCache]: Analyzing trace with hash -39618822, now seen corresponding path program 2 times [2021-02-21 20:31:26,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:26,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [684590507] [2021-02-21 20:31:26,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:26,482 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:26,539 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,540 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:26,540 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,541 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,547 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,547 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,554 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,555 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,562 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,563 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,572 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,573 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,584 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,584 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,595 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,596 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,609 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,610 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,625 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,626 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,643 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,643 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,644 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,644 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,661 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,662 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,678 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,679 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,696 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,697 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,718 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,719 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,738 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,739 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:26,740 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,740 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:26,759 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,760 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:26,781 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,781 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:26,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:26,836 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,838 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:26,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:26,841 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,841 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:26,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-21 20:31:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:26,844 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,844 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:26,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-21 20:31:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:26,868 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,868 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:26,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-21 20:31:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:26,872 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,872 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:26,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-21 20:31:26,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:26,876 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,876 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:26,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-21 20:31:26,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:26,880 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,880 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:26,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-21 20:31:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:26,884 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:26,884 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-02-21 20:31:26,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [684590507] [2021-02-21 20:31:26,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:26,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2021-02-21 20:31:26,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922980293] [2021-02-21 20:31:26,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-21 20:31:26,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:26,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-21 20:31:26,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-21 20:31:26,905 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 20 states. [2021-02-21 20:31:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:29,333 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2021-02-21 20:31:29,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-02-21 20:31:29,334 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2021-02-21 20:31:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:29,336 INFO L225 Difference]: With dead ends: 213 [2021-02-21 20:31:29,337 INFO L226 Difference]: Without dead ends: 211 [2021-02-21 20:31:29,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2021-02-21 20:31:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-02-21 20:31:29,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 187. [2021-02-21 20:31:29,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2021-02-21 20:31:29,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2021-02-21 20:31:29,379 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 99 [2021-02-21 20:31:29,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:29,380 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2021-02-21 20:31:29,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-21 20:31:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2021-02-21 20:31:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-02-21 20:31:29,382 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:29,382 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:29,382 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-21 20:31:29,382 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:29,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:29,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1220663755, now seen corresponding path program 3 times [2021-02-21 20:31:29,383 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:29,383 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [223343711] [2021-02-21 20:31:29,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:29,385 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:29,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:29,449 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,450 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:29,451 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,451 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,457 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,458 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,464 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,465 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,473 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,474 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,483 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,484 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,495 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,495 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,507 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,508 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,521 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,522 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,537 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,537 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,554 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,555 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,555 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,556 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,573 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,574 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,593 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,594 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,613 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,614 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,633 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,634 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,656 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,657 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,658 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,658 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,681 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,693 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,717 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,718 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,744 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,745 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,770 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,771 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,797 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,797 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-21 20:31:29,798 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,798 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:29,818 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,818 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-21 20:31:29,838 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,839 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:29,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:29,888 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,888 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:29,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:29,891 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,891 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:29,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-21 20:31:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:29,894 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,894 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:29,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-21 20:31:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:29,921 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,922 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:29,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-21 20:31:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:29,926 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,926 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:29,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-21 20:31:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:29,930 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,930 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:29,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-21 20:31:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:29,933 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,934 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:29,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-21 20:31:29,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:29,939 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,940 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:29,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-02-21 20:31:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:29,944 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,945 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:29,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-02-21 20:31:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:29,948 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:29,949 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-02-21 20:31:29,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [223343711] [2021-02-21 20:31:29,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:29,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2021-02-21 20:31:29,984 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377157176] [2021-02-21 20:31:29,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-02-21 20:31:29,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:29,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-02-21 20:31:29,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-02-21 20:31:29,985 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand 25 states. [2021-02-21 20:31:33,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:33,621 INFO L93 Difference]: Finished difference Result 242 states and 257 transitions. [2021-02-21 20:31:33,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-02-21 20:31:33,622 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 126 [2021-02-21 20:31:33,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:33,624 INFO L225 Difference]: With dead ends: 242 [2021-02-21 20:31:33,624 INFO L226 Difference]: Without dead ends: 176 [2021-02-21 20:31:33,626 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=576, Invalid=2846, Unknown=0, NotChecked=0, Total=3422 [2021-02-21 20:31:33,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-02-21 20:31:33,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2021-02-21 20:31:33,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2021-02-21 20:31:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2021-02-21 20:31:33,661 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 126 [2021-02-21 20:31:33,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:33,661 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2021-02-21 20:31:33,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-02-21 20:31:33,661 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2021-02-21 20:31:33,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-02-21 20:31:33,663 INFO L414 BasicCegarLoop]: Found error trace [2021-02-21 20:31:33,663 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-02-21 20:31:33,663 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-21 20:31:33,663 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-21 20:31:33,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-21 20:31:33,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2141599883, now seen corresponding path program 4 times [2021-02-21 20:31:33,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-21 20:31:33,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1018501095] [2021-02-21 20:31:33,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-21 20:31:33,666 INFO L218 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-02-21 20:31:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:33,715 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,715 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:33,716 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,716 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:33,719 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,720 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:33,724 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,724 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:33,730 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,731 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:33,737 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,737 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:33,738 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,739 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-21 20:31:33,751 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,752 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-21 20:31:33,768 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,768 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-21 20:31:33,780 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,780 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:33,781 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,781 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:33,782 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,782 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:33,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-21 20:31:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:33,815 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,816 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:33,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-21 20:31:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:33,818 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,818 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:33,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-21 20:31:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:33,820 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,821 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:33,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-21 20:31:33,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:33,836 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,837 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-21 20:31:33,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-21 20:31:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:33,853 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,853 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:33,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-21 20:31:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:33,856 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,857 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:33,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-21 20:31:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:33,860 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,861 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:33,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-21 20:31:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:33,864 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,865 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:33,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-02-21 20:31:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:33,867 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,867 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:33,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-02-21 20:31:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-21 20:31:33,870 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-21 20:31:33,870 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-21 20:31:33,901 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2021-02-21 20:31:33,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1018501095] [2021-02-21 20:31:33,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-21 20:31:33,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-02-21 20:31:33,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110332352] [2021-02-21 20:31:33,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-21 20:31:33,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-21 20:31:33,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-21 20:31:33,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-02-21 20:31:33,903 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 12 states. [2021-02-21 20:31:34,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-21 20:31:34,552 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2021-02-21 20:31:34,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-21 20:31:34,553 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 126 [2021-02-21 20:31:34,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-21 20:31:34,554 INFO L225 Difference]: With dead ends: 168 [2021-02-21 20:31:34,554 INFO L226 Difference]: Without dead ends: 0 [2021-02-21 20:31:34,555 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-02-21 20:31:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-21 20:31:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-21 20:31:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-21 20:31:34,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-21 20:31:34,555 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2021-02-21 20:31:34,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-21 20:31:34,556 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-21 20:31:34,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-21 20:31:34,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-21 20:31:34,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-21 20:31:34,556 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-21 20:31:34,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-21 20:31:37,804 WARN L202 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-21 20:31:37,994 WARN L202 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 29 [2021-02-21 20:31:38,340 WARN L202 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2021-02-21 20:31:38,764 WARN L202 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-21 20:31:39,004 WARN L202 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2021-02-21 20:31:39,132 WARN L202 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 25 [2021-02-21 20:31:39,433 WARN L202 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-21 20:31:39,691 WARN L202 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2021-02-21 20:31:40,049 WARN L202 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-21 20:31:40,172 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 20 [2021-02-21 20:31:40,568 WARN L202 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-21 20:31:40,821 WARN L202 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2021-02-21 20:31:41,054 WARN L202 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2021-02-21 20:31:41,329 WARN L202 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2021-02-21 20:31:41,617 WARN L202 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2021-02-21 20:31:41,920 WARN L202 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2021-02-21 20:31:42,303 WARN L202 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2021-02-21 20:31:42,757 WARN L202 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2021-02-21 20:31:43,171 WARN L202 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2021-02-21 20:31:43,425 WARN L202 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2021-02-21 20:31:43,868 WARN L202 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2021-02-21 20:31:44,120 WARN L202 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2021-02-21 20:31:44,582 WARN L202 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2021-02-21 20:31:44,834 WARN L202 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2021-02-21 20:31:45,256 WARN L202 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2021-02-21 20:31:45,363 WARN L202 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 20 [2021-02-21 20:31:45,738 WARN L202 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-21 20:31:46,048 WARN L202 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2021-02-21 20:31:46,313 WARN L202 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2021-02-21 20:31:46,578 WARN L202 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2021-02-21 20:31:46,859 WARN L202 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2021-02-21 20:31:47,052 WARN L202 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2021-02-21 20:31:47,079 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2021-02-21 20:31:47,079 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2021-02-21 20:31:47,079 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2021-02-21 20:31:47,079 INFO L192 CegarLoopUtils]: At program point L5-4(line 5) the Hoare annotation is: true [2021-02-21 20:31:47,079 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-21 20:31:47,080 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-21 20:31:47,080 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2021-02-21 20:31:47,080 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-21 20:31:47,080 INFO L192 CegarLoopUtils]: At program point L5(line 5) the Hoare annotation is: true [2021-02-21 20:31:47,080 INFO L192 CegarLoopUtils]: At program point L5-1(line 5) the Hoare annotation is: true [2021-02-21 20:31:47,080 INFO L192 CegarLoopUtils]: At program point L5-2(line 5) the Hoare annotation is: true [2021-02-21 20:31:47,080 INFO L192 CegarLoopUtils]: At program point L5-3(line 5) the Hoare annotation is: true [2021-02-21 20:31:47,080 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-21 20:31:47,081 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-21 20:31:47,081 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-21 20:31:47,081 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-21 20:31:47,081 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-21 20:31:47,081 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2021-02-21 20:31:47,081 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-21 20:31:47,081 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-21 20:31:47,081 INFO L192 CegarLoopUtils]: At program point L8-3(lines 7 9) the Hoare annotation is: true [2021-02-21 20:31:47,081 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notEXIT(lines 7 9) the Hoare annotation is: true [2021-02-21 20:31:47,082 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 40 54) the Hoare annotation is: true [2021-02-21 20:31:47,082 INFO L192 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: true [2021-02-21 20:31:47,082 INFO L185 CegarLoopUtils]: At program point L50(line 50) 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|)) (= main_~ax~1 0) (= main_~ai~1 0))) [2021-02-21 20:31:47,082 INFO L192 CegarLoopUtils]: At program point L50-1(line 50) the Hoare annotation is: true [2021-02-21 20:31:47,082 INFO L185 CegarLoopUtils]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2021-02-21 20:31:47,082 INFO L185 CegarLoopUtils]: At program point L48-1(line 48) 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|)) (= |main_#t~mem19| 0))) [2021-02-21 20:31:47,082 INFO L185 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-21 20:31:47,083 INFO L185 CegarLoopUtils]: At program point L48-2(line 48) 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|)) (= main_~ai~1 0) (= |main_#t~mem19| 0))) [2021-02-21 20:31:47,083 INFO L185 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |main_#t~malloc17.base|)) [2021-02-21 20:31:47,083 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 40 54) the Hoare annotation is: true [2021-02-21 20:31:47,083 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-21 20:31:47,083 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-21 20:31:47,083 INFO L185 CegarLoopUtils]: At program point mainENTRY(lines 40 54) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:31:47,083 INFO L185 CegarLoopUtils]: At program point L49(line 49) 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|)) (= main_~ai~1 0))) [2021-02-21 20:31:47,084 INFO L185 CegarLoopUtils]: At program point L49-1(line 49) 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|)) (= |main_#t~mem20| 0) (= main_~ai~1 0))) [2021-02-21 20:31:47,084 INFO L185 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= .cse0 (select |#memory_int| |main_#t~malloc17.base|)))) [2021-02-21 20:31:47,084 INFO L185 CegarLoopUtils]: At program point L49-2(line 49) 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|)) (= main_~ax~1 0) (= |main_#t~mem20| 0) (= main_~ai~1 0))) [2021-02-21 20:31:47,084 INFO L185 CegarLoopUtils]: At program point L47-1(line 47) 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-21 20:31:47,084 INFO L185 CegarLoopUtils]: At program point L45(line 45) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:31:47,084 INFO L185 CegarLoopUtils]: At program point L47-2(line 47) 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-21 20:31:47,084 INFO L185 CegarLoopUtils]: At program point L45-1(line 45) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:31:47,085 INFO L185 CegarLoopUtils]: At program point L47-3(line 47) 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-21 20:31:47,085 INFO L185 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:31:47,085 INFO L185 CegarLoopUtils]: At program point L43-1(line 43) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:31:47,085 INFO L185 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:31:47,085 INFO L185 CegarLoopUtils]: At program point L41-1(line 41) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-21 20:31:47,085 INFO L185 CegarLoopUtils]: At program point L33(line 33) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:47,086 INFO L185 CegarLoopUtils]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (= |check_#t~mem13| 0)) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or (and .cse0 .cse1) .cse2 (not (<= 1 |check_#in~x|)) .cse3) (or .cse2 (and (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse0 .cse1) (not (= |check_#in~x| 0)) .cse3)))) [2021-02-21 20:31:47,086 INFO L192 CegarLoopUtils]: At program point checkENTRY(lines 16 38) the Hoare annotation is: true [2021-02-21 20:31:47,086 INFO L185 CegarLoopUtils]: At program point L33-2(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (= check_~ai~0 0)) (.cse2 (= (select |#memory_int| check_~a.base) .cse6)) (.cse3 (= |check_#t~mem13| 0)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse1 .cse2 .cse3) .cse4) (or .cse0 (and (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1 .cse2 .cse3) (not (= |check_#in~x| 0)) .cse4)))) [2021-02-21 20:31:47,086 INFO L185 CegarLoopUtils]: At program point L29(line 29) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:47,086 INFO L185 CegarLoopUtils]: At program point L29-1(line 29) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:47,086 INFO L185 CegarLoopUtils]: At program point L27(line 27) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2021-02-21 20:31:47,087 INFO L185 CegarLoopUtils]: At program point L29-2(line 29) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:47,087 INFO L185 CegarLoopUtils]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2021-02-21 20:31:47,087 INFO L185 CegarLoopUtils]: At program point L27-2(line 27) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2021-02-21 20:31:47,087 INFO L185 CegarLoopUtils]: At program point L21(line 21) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:47,088 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 ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:47,088 INFO L185 CegarLoopUtils]: At program point L17-1(line 17) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse1 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 (and .cse1 .cse2 (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or (and .cse1 .cse2 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse4)))) [2021-02-21 20:31:47,088 INFO L185 CegarLoopUtils]: At program point checkFINAL(lines 16 38) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2021-02-21 20:31:47,088 INFO L185 CegarLoopUtils]: At program point L34(line 34) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2 .cse3))))) [2021-02-21 20:31:47,088 INFO L185 CegarLoopUtils]: At program point L34-1(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)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse3 .cse4))))) [2021-02-21 20:31:47,089 INFO L185 CegarLoopUtils]: At program point L34-2(line 34) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= check_~ax~0 0)) (.cse3 (= |check_#t~mem14| 0)) (.cse5 (= check_~ai~0 0)) (.cse6 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 .cse3 (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse5 .cse6)) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse2 .cse3 .cse5 .cse6) .cse1)))) [2021-02-21 20:31:47,089 INFO L185 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:47,089 INFO L185 CegarLoopUtils]: At program point L26-1(line 26) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse9 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (= |check_#t~mem8| 0)) (.cse4 (<= .cse9 |check_#in~n|)) (.cse5 (<= .cse9 check_~n)) (.cse6 (= (select |#memory_int| check_~a.base) .cse8)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse8))) (.cse2 (not (<= 2 |check_#in~x|)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse3 .cse4 .cse5 .cse6 (= check_~x 0))) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse3 .cse4 .cse5 .cse6 (<= 1 check_~x)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse7 (+ check_~y 2))) (and (<= .cse7 check_~n) (<= .cse7 |check_#in~n|))) .cse2)))) [2021-02-21 20:31:47,089 INFO L185 CegarLoopUtils]: At program point L24(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:47,090 INFO L185 CegarLoopUtils]: At program point L26-2(lines 26 27) 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 (= |check_#t~mem8| 0)) (.cse4 (<= .cse10 |check_#in~n|)) (.cse5 (<= .cse10 check_~n)) (.cse6 (= |check_#t~mem9| 0)) (.cse7 (= (select |#memory_int| check_~a.base) .cse9)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse2 (not (<= 2 |check_#in~x|)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse3 .cse4 .cse5 .cse6 .cse7 (= check_~x 0))) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse8 (+ check_~y 2))) (and (<= .cse8 check_~n) (<= .cse8 |check_#in~n|))) .cse2)))) [2021-02-21 20:31:47,090 INFO L185 CegarLoopUtils]: At program point L26-3(line 26) the Hoare annotation is: (let ((.cse8 (+ check_~y 1)) (.cse7 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse4 (<= .cse8 |check_#in~n|)) (.cse5 (<= .cse8 check_~n)) (.cse6 (= (select |#memory_int| check_~a.base) .cse7))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 check_~n) (<= .cse3 |check_#in~n|)))) (or .cse0 (and .cse4 .cse5 .cse6 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (= |check_#t~mem8| 0) .cse4 .cse5 (= |check_#t~mem9| 0) .cse6 (= check_~x 0)))))) [2021-02-21 20:31:47,090 INFO L185 CegarLoopUtils]: At program point L26-4(line 26) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (<= .cse8 |check_#in~n|)) (.cse5 (<= .cse8 check_~n)) (.cse6 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 check_~n) (<= .cse3 |check_#in~n|)))) (or .cse0 (and .cse4 .cse5 .cse6 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse4 .cse5 .cse6 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:47,091 INFO L185 CegarLoopUtils]: At program point L26-5(line 26) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (<= .cse8 |check_#in~n|)) (.cse5 (<= .cse8 check_~n)) (.cse6 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 check_~n) (<= .cse3 |check_#in~n|)))) (or .cse0 (and .cse4 .cse5 .cse6 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse4 .cse5 .cse6 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:47,091 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 ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:47,091 INFO L185 CegarLoopUtils]: At program point L26-6(line 26) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (not (<= 2 |check_#in~x|)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse3 (<= 1 |check_#t~post10|) .cse4 .cse5 (<= 1 check_~x))) (or .cse0 (and .cse3 (= |check_#t~post10| 0) .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2)))) [2021-02-21 20:31:47,091 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 ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2021-02-21 20:31:47,092 INFO L185 CegarLoopUtils]: At program point L26-7(line 26) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse7 |check_#in~n|)) (.cse3 (<= .cse7 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (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)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|))) (not (<= 2 |check_#in~x|)))))) [2021-02-21 20:31:47,092 INFO L185 CegarLoopUtils]: At program point checkEXIT(lines 16 38) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2021-02-21 20:31:47,092 INFO L185 CegarLoopUtils]: At program point L26-9(line 26) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2021-02-21 20:31:47,092 INFO L185 CegarLoopUtils]: At program point L16(lines 16 38) 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-21 20:31:47,092 INFO L185 CegarLoopUtils]: At program point L26-10(line 26) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2021-02-21 20:31:47,093 INFO L185 CegarLoopUtils]: At program point L16-1(lines 16 38) the Hoare annotation is: (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (<= (+ check_~y 2) |check_#in~n|)) (or .cse0 (and .cse3 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1))) [2021-02-21 20:31:47,093 INFO L185 CegarLoopUtils]: At program point L26-11(lines 26 27) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse0 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse0 (<= (+ check_~y 2) check_~n) (not (<= 2 |check_#in~x|))) (or .cse1 (and .cse2 .cse3 .cse4 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse0) (or .cse1 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse0)))) [2021-02-21 20:31:47,093 INFO L185 CegarLoopUtils]: At program point L16-2(lines 16 38) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (<= (+ check_~y 2) |check_#in~n|)) (or .cse0 (and .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-21 20:31:47,093 INFO L185 CegarLoopUtils]: At program point L16-3(lines 16 38) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (<= (+ check_~y 2) |check_#in~n|)) (or .cse0 (and .cse3 .cse4 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2021-02-21 20:31:47,094 INFO L185 CegarLoopUtils]: At program point L35(line 35) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= check_~ax~0 0)) (.cse1 (= check_~ai~0 0)) (.cse2 (= (select |#memory_int| check_~a.base) .cse6)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or (and .cse0 .cse1 .cse2) .cse3 (not (<= 1 |check_#in~x|)) .cse4) (or .cse3 (and .cse0 (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1 .cse2) (not (= |check_#in~x| 0)) .cse4)))) [2021-02-21 20:31:47,094 INFO L185 CegarLoopUtils]: At program point L35-1(line 35) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= check_~ax~0 0) (= check_~ai~0 0) (= (select |#memory_int| check_~a.base) .cse0)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)))) [2021-02-21 20:31:47,094 INFO L192 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2021-02-21 20:31:47,094 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-21 20:31:47,094 INFO L185 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-21 20:31:47,094 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-21 20:31:47,094 INFO L185 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-21 20:31:47,094 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-21 20:31:47,095 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-21 20:31:47,095 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-21 20:31:47,095 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-21 20:31:47,095 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-21 20:31:47,113 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.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-21 20:31:47,116 INFO L168 Benchmark]: Toolchain (without parser) took 36741.86 ms. Allocated memory was 153.1 MB in the beginning and 331.4 MB in the end (delta: 178.3 MB). Free memory was 129.3 MB in the beginning and 245.2 MB in the end (delta: -115.9 MB). Peak memory consumption was 193.4 MB. Max. memory is 8.0 GB. [2021-02-21 20:31:47,116 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 153.1 MB. Free memory is still 128.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-21 20:31:47,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.58 ms. Allocated memory is still 153.1 MB. Free memory was 128.0 MB in the beginning and 117.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2021-02-21 20:31:47,116 INFO L168 Benchmark]: Boogie Preprocessor took 78.46 ms. Allocated memory is still 153.1 MB. Free memory was 117.9 MB in the beginning and 116.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-02-21 20:31:47,116 INFO L168 Benchmark]: RCFGBuilder took 570.41 ms. Allocated memory is still 153.1 MB. Free memory was 116.3 MB in the beginning and 130.8 MB in the end (delta: -14.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. [2021-02-21 20:31:47,117 INFO L168 Benchmark]: TraceAbstraction took 35669.56 ms. Allocated memory was 153.1 MB in the beginning and 331.4 MB in the end (delta: 178.3 MB). Free memory was 130.2 MB in the beginning and 245.2 MB in the end (delta: -114.9 MB). Peak memory consumption was 193.4 MB. Max. memory is 8.0 GB. [2021-02-21 20:31:47,118 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.19 ms. Allocated memory is still 153.1 MB. Free memory is still 128.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 403.58 ms. Allocated memory is still 153.1 MB. Free memory was 128.0 MB in the beginning and 117.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 78.46 ms. Allocated memory is still 153.1 MB. Free memory was 117.9 MB in the beginning and 116.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 570.41 ms. Allocated memory is still 153.1 MB. Free memory was 116.3 MB in the beginning and 130.8 MB in the end (delta: -14.5 MB). Peak memory consumption was 22.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 35669.56 ms. Allocated memory was 153.1 MB in the beginning and 331.4 MB in the end (delta: 178.3 MB). Free memory was 130.2 MB in the beginning and 245.2 MB in the end (delta: -114.9 MB). Peak memory consumption was 193.4 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: 40]: 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...