/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-36cd7be [2021-02-23 22:59:26,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-02-23 22:59:27,002 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-02-23 22:59:27,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-02-23 22:59:27,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-02-23 22:59:27,065 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-02-23 22:59:27,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-02-23 22:59:27,075 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-02-23 22:59:27,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-02-23 22:59:27,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-02-23 22:59:27,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-02-23 22:59:27,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-02-23 22:59:27,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-02-23 22:59:27,090 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-02-23 22:59:27,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-02-23 22:59:27,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-02-23 22:59:27,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-02-23 22:59:27,098 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-02-23 22:59:27,105 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-02-23 22:59:27,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-02-23 22:59:27,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-02-23 22:59:27,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-02-23 22:59:27,118 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-02-23 22:59:27,120 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-02-23 22:59:27,130 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-02-23 22:59:27,131 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-02-23 22:59:27,131 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-02-23 22:59:27,132 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-02-23 22:59:27,135 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-02-23 22:59:27,136 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-02-23 22:59:27,136 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-02-23 22:59:27,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-02-23 22:59:27,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-02-23 22:59:27,140 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-02-23 22:59:27,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-02-23 22:59:27,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-02-23 22:59:27,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-02-23 22:59:27,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-02-23 22:59:27,143 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-02-23 22:59:27,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-02-23 22:59:27,144 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-02-23 22:59:27,146 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2021-02-23 22:59:27,170 INFO L113 SettingsManager]: Loading preferences was successful [2021-02-23 22:59:27,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-02-23 22:59:27,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-02-23 22:59:27,175 INFO L138 SettingsManager]: * sizeof long=4 [2021-02-23 22:59:27,176 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-02-23 22:59:27,176 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-02-23 22:59:27,176 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-02-23 22:59:27,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-02-23 22:59:27,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-02-23 22:59:27,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-02-23 22:59:27,178 INFO L138 SettingsManager]: * sizeof long double=12 [2021-02-23 22:59:27,178 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-02-23 22:59:27,178 INFO L138 SettingsManager]: * Use constant arrays=true [2021-02-23 22:59:27,179 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-02-23 22:59:27,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-02-23 22:59:27,179 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2021-02-23 22:59:27,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-02-23 22:59:27,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-02-23 22:59:27,180 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-23 22:59:27,180 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-02-23 22:59:27,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-02-23 22:59:27,181 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-02-23 22:59:27,181 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2021-02-23 22:59:27,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-02-23 22:59:27,680 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-02-23 22:59:27,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-02-23 22:59:27,684 INFO L271 PluginConnector]: Initializing CDTParser... [2021-02-23 22:59:27,685 INFO L275 PluginConnector]: CDTParser initialized [2021-02-23 22:59:27,686 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-23 22:59:27,769 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47bf8d40/c33542f616e44f029bc49d98abfc5ab8/FLAGcd57d789b [2021-02-23 22:59:28,455 INFO L306 CDTParser]: Found 1 translation units. [2021-02-23 22:59:28,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2021-02-23 22:59:28,466 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47bf8d40/c33542f616e44f029bc49d98abfc5ab8/FLAGcd57d789b [2021-02-23 22:59:28,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c47bf8d40/c33542f616e44f029bc49d98abfc5ab8 [2021-02-23 22:59:28,780 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-02-23 22:59:28,795 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-02-23 22:59:28,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-02-23 22:59:28,798 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-02-23 22:59:28,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-02-23 22:59:28,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 10:59:28" (1/1) ... [2021-02-23 22:59:28,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@215df84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:28, skipping insertion in model container [2021-02-23 22:59:28,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.02 10:59:28" (1/1) ... [2021-02-23 22:59:28,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-02-23 22:59:28,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-02-23 22:59:28,988 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-23 22:59:29,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 22:59:29,039 INFO L203 MainTranslator]: Completed pre-run [2021-02-23 22:59:29,059 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-23 22:59:29,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-02-23 22:59:29,124 INFO L208 MainTranslator]: Completed translation [2021-02-23 22:59:29,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:29 WrapperNode [2021-02-23 22:59:29,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-02-23 22:59:29,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-02-23 22:59:29,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-02-23 22:59:29,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-02-23 22:59:29,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:29" (1/1) ... [2021-02-23 22:59:29,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:29" (1/1) ... [2021-02-23 22:59:29,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:29" (1/1) ... [2021-02-23 22:59:29,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:29" (1/1) ... [2021-02-23 22:59:29,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:29" (1/1) ... [2021-02-23 22:59:29,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:29" (1/1) ... [2021-02-23 22:59:29,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:29" (1/1) ... [2021-02-23 22:59:29,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-02-23 22:59:29,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-02-23 22:59:29,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-02-23 22:59:29,221 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-02-23 22:59:29,226 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-02-23 22:59:29,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-02-23 22:59:29,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-02-23 22:59:29,360 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-02-23 22:59:29,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-02-23 22:59:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-02-23 22:59:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2021-02-23 22:59:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-02-23 22:59:29,361 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2021-02-23 22:59:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2021-02-23 22:59:29,362 INFO L130 BoogieDeclarations]: Found specification of procedure free [2021-02-23 22:59:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-02-23 22:59:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-02-23 22:59:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-02-23 22:59:29,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-02-23 22:59:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-02-23 22:59:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-02-23 22:59:29,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2021-02-23 22:59:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure check [2021-02-23 22:59:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-02-23 22:59:29,365 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-02-23 22:59:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-02-23 22:59:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2021-02-23 22:59:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-02-23 22:59:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-02-23 22:59:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-02-23 22:59:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-02-23 22:59:29,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-02-23 22:59:30,031 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-02-23 22:59:30,031 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-02-23 22:59:30,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 10:59:30 BoogieIcfgContainer [2021-02-23 22:59:30,034 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-02-23 22:59:30,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-02-23 22:59:30,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-02-23 22:59:30,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-02-23 22:59:30,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.02 10:59:28" (1/3) ... [2021-02-23 22:59:30,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168da9be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 10:59:30, skipping insertion in model container [2021-02-23 22:59:30,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.02 10:59:29" (2/3) ... [2021-02-23 22:59:30,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@168da9be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.02 10:59:30, skipping insertion in model container [2021-02-23 22:59:30,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.02 10:59:30" (3/3) ... [2021-02-23 22:59:30,045 INFO L111 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2021-02-23 22:59:30,052 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-02-23 22:59:30,057 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-02-23 22:59:30,076 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-02-23 22:59:30,111 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-02-23 22:59:30,112 INFO L377 AbstractCegarLoop]: Hoare is true [2021-02-23 22:59:30,112 INFO L378 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2021-02-23 22:59:30,112 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-02-23 22:59:30,112 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-02-23 22:59:30,112 INFO L381 AbstractCegarLoop]: Difference is false [2021-02-23 22:59:30,112 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-02-23 22:59:30,113 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-02-23 22:59:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states. [2021-02-23 22:59:30,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-02-23 22:59:30,148 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:30,148 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-23 22:59:30,149 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:30,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:30,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1226469690, now seen corresponding path program 1 times [2021-02-23 22:59:30,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:30,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1302007408] [2021-02-23 22:59:30,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:30,435 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,437 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:30,445 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,447 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:30,470 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,472 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:30,490 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,491 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:30,505 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,506 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:30,522 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,525 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:30,538 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,539 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:30,573 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,577 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:30,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:30,647 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,648 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:30,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:30,656 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,656 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:30,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-23 22:59:30,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:30,662 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,663 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:30,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 22:59:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:30,683 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:30,684 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-02-23 22:59:30,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1302007408] [2021-02-23 22:59:30,701 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 22:59:30,701 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-02-23 22:59:30,702 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892069103] [2021-02-23 22:59:30,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-02-23 22:59:30,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:30,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-02-23 22:59:30,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-02-23 22:59:30,723 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 10 states. [2021-02-23 22:59:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:31,896 INFO L93 Difference]: Finished difference Result 227 states and 263 transitions. [2021-02-23 22:59:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-02-23 22:59:31,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2021-02-23 22:59:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:31,909 INFO L225 Difference]: With dead ends: 227 [2021-02-23 22:59:31,910 INFO L226 Difference]: Without dead ends: 143 [2021-02-23 22:59:31,915 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2021-02-23 22:59:31,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2021-02-23 22:59:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 127. [2021-02-23 22:59:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2021-02-23 22:59:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2021-02-23 22:59:31,996 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 45 [2021-02-23 22:59:31,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:31,997 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2021-02-23 22:59:31,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2021-02-23 22:59:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2021-02-23 22:59:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-02-23 22:59:32,000 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:32,000 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-23 22:59:32,001 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-02-23 22:59:32,001 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:32,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:32,002 INFO L82 PathProgramCache]: Analyzing trace with hash 41918952, now seen corresponding path program 1 times [2021-02-23 22:59:32,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:32,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1344021955] [2021-02-23 22:59:32,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:32,167 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,170 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:32,171 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,172 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:32,176 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,179 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-02-23 22:59:32,193 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,194 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-23 22:59:32,204 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,205 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-23 22:59:32,215 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,215 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-23 22:59:32,229 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,229 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 22:59:32,242 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,244 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 22:59:32,261 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,261 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:32,273 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,273 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:32,285 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,286 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:32,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:32,330 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,331 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:32,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:32,335 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,336 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:32,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-23 22:59:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:32,341 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,341 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:32,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 22:59:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:32,364 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,364 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:32,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-02-23 22:59:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:32,388 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:32,389 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-02-23 22:59:32,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1344021955] [2021-02-23 22:59:32,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 22:59:32,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-02-23 22:59:32,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453029613] [2021-02-23 22:59:32,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-02-23 22:59:32,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:32,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-02-23 22:59:32,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2021-02-23 22:59:32,401 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand 14 states. [2021-02-23 22:59:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:33,453 INFO L93 Difference]: Finished difference Result 133 states and 142 transitions. [2021-02-23 22:59:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-02-23 22:59:33,454 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2021-02-23 22:59:33,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:33,459 INFO L225 Difference]: With dead ends: 133 [2021-02-23 22:59:33,460 INFO L226 Difference]: Without dead ends: 113 [2021-02-23 22:59:33,461 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-23 22:59:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2021-02-23 22:59:33,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2021-02-23 22:59:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2021-02-23 22:59:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 121 transitions. [2021-02-23 22:59:33,526 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 121 transitions. Word has length 57 [2021-02-23 22:59:33,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:33,527 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 121 transitions. [2021-02-23 22:59:33,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-02-23 22:59:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 121 transitions. [2021-02-23 22:59:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-02-23 22:59:33,533 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:33,533 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-23 22:59:33,534 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-02-23 22:59:33,534 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:33,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:33,536 INFO L82 PathProgramCache]: Analyzing trace with hash 411171829, now seen corresponding path program 1 times [2021-02-23 22:59:33,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:33,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2067697894] [2021-02-23 22:59:33,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:33,645 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,645 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:33,646 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,647 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,654 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,655 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,662 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,663 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,672 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,673 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,683 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,684 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,697 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,698 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,711 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,713 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,727 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,728 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,744 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,744 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,762 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,780 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:33,782 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,782 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:33,796 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,796 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:33,811 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,812 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:33,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:33,861 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,862 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:33,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:33,879 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,880 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:33,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-23 22:59:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:33,891 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,891 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:33,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 22:59:33,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:33,911 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,912 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:33,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-23 22:59:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:33,918 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,918 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:33,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-23 22:59:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:33,924 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:33,924 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:33,935 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-02-23 22:59:33,935 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2067697894] [2021-02-23 22:59:33,935 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 22:59:33,935 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2021-02-23 22:59:33,936 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215171588] [2021-02-23 22:59:33,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-23 22:59:33,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:33,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-23 22:59:33,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2021-02-23 22:59:33,938 INFO L87 Difference]: Start difference. First operand 113 states and 121 transitions. Second operand 15 states. [2021-02-23 22:59:35,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:35,746 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2021-02-23 22:59:35,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-02-23 22:59:35,752 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2021-02-23 22:59:35,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:35,754 INFO L225 Difference]: With dead ends: 184 [2021-02-23 22:59:35,754 INFO L226 Difference]: Without dead ends: 182 [2021-02-23 22:59:35,755 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-23 22:59:35,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-02-23 22:59:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 156. [2021-02-23 22:59:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2021-02-23 22:59:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 169 transitions. [2021-02-23 22:59:35,822 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 169 transitions. Word has length 72 [2021-02-23 22:59:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:35,823 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 169 transitions. [2021-02-23 22:59:35,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-23 22:59:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 169 transitions. [2021-02-23 22:59:35,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-02-23 22:59:35,834 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:35,834 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-23 22:59:35,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-02-23 22:59:35,835 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:35,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:35,836 INFO L82 PathProgramCache]: Analyzing trace with hash -710591147, now seen corresponding path program 1 times [2021-02-23 22:59:35,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:35,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1109056552] [2021-02-23 22:59:35,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:35,919 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:35,920 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:35,921 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:35,921 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:35,927 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:35,928 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:35,935 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:35,936 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:35,944 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:35,945 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:35,955 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:35,956 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:35,966 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:35,967 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:35,985 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:35,986 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:35,999 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:36,000 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:36,014 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:36,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:36,028 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:36,029 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:36,030 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:36,030 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:36,041 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:36,042 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:36,053 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:36,054 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:36,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:36,098 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:36,099 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:36,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:36,103 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:36,103 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:36,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-23 22:59:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:36,107 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:36,108 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:36,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 22:59:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:36,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:36,126 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:36,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-23 22:59:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:36,131 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:36,132 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:36,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-23 22:59:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:36,142 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:36,143 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-02-23 22:59:36,152 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1109056552] [2021-02-23 22:59:36,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-02-23 22:59:36,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-02-23 22:59:36,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443501577] [2021-02-23 22:59:36,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-02-23 22:59:36,154 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:36,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-02-23 22:59:36,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2021-02-23 22:59:36,155 INFO L87 Difference]: Start difference. First operand 156 states and 169 transitions. Second operand 15 states. [2021-02-23 22:59:37,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:37,922 INFO L93 Difference]: Finished difference Result 226 states and 247 transitions. [2021-02-23 22:59:37,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-02-23 22:59:37,923 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 72 [2021-02-23 22:59:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:37,925 INFO L225 Difference]: With dead ends: 226 [2021-02-23 22:59:37,926 INFO L226 Difference]: Without dead ends: 224 [2021-02-23 22:59:37,927 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-23 22:59:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-02-23 22:59:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 199. [2021-02-23 22:59:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2021-02-23 22:59:37,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 217 transitions. [2021-02-23 22:59:37,988 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 217 transitions. Word has length 72 [2021-02-23 22:59:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:37,988 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 217 transitions. [2021-02-23 22:59:37,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2021-02-23 22:59:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 217 transitions. [2021-02-23 22:59:37,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-02-23 22:59:37,990 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:37,991 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-23 22:59:37,991 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-02-23 22:59:37,991 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:37,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:37,992 INFO L82 PathProgramCache]: Analyzing trace with hash -562495935, now seen corresponding path program 1 times [2021-02-23 22:59:37,992 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:37,992 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1287275289] [2021-02-23 22:59:37,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:38,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:38,057 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,058 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:38,058 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,059 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:38,063 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,063 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:38,068 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,069 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:38,075 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,076 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:38,084 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,085 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-02-23 22:59:38,094 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,095 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-23 22:59:38,109 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,112 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-23 22:59:38,126 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,127 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-23 22:59:38,147 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,148 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 22:59:38,164 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,164 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 22:59:38,181 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,182 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:38,196 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,197 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:38,212 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,213 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:38,251 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:38,258 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,258 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:38,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:38,262 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,263 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:38,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-23 22:59:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:38,266 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,267 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:38,283 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 22:59:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:38,289 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,290 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:38,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-23 22:59:38,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:38,313 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,313 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:38,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-23 22:59:38,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:38,317 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,318 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:38,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-02-23 22:59:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:38,323 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:38,323 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:38,336 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-02-23 22:59:38,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1287275289] [2021-02-23 22:59:38,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 22:59:38,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2021-02-23 22:59:38,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793858915] [2021-02-23 22:59:38,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-02-23 22:59:38,338 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:38,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-02-23 22:59:38,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2021-02-23 22:59:38,339 INFO L87 Difference]: Start difference. First operand 199 states and 217 transitions. Second operand 16 states. [2021-02-23 22:59:39,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:39,827 INFO L93 Difference]: Finished difference Result 211 states and 231 transitions. [2021-02-23 22:59:39,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-02-23 22:59:39,828 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 84 [2021-02-23 22:59:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:39,830 INFO L225 Difference]: With dead ends: 211 [2021-02-23 22:59:39,831 INFO L226 Difference]: Without dead ends: 147 [2021-02-23 22:59:39,832 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-23 22:59:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-02-23 22:59:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 118. [2021-02-23 22:59:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2021-02-23 22:59:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2021-02-23 22:59:39,857 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 84 [2021-02-23 22:59:39,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:39,857 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2021-02-23 22:59:39,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2021-02-23 22:59:39,858 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2021-02-23 22:59:39,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-23 22:59:39,859 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:39,859 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-23 22:59:39,860 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-02-23 22:59:39,860 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:39,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:39,861 INFO L82 PathProgramCache]: Analyzing trace with hash 2003080282, now seen corresponding path program 2 times [2021-02-23 22:59:39,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:39,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2037916922] [2021-02-23 22:59:39,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:39,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:39,935 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:39,935 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:39,936 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:39,937 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:39,943 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:39,944 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:39,951 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:39,952 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:39,961 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:39,962 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:39,971 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:39,972 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:39,983 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:39,984 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:39,997 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,000 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:40,013 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,014 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:40,046 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,047 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:40,066 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,067 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:40,068 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,069 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:40,088 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,089 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:40,116 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,118 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:40,139 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,140 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:40,160 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,161 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:40,182 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,183 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:40,184 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,184 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:40,199 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,199 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:40,216 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,216 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,274 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,275 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,278 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,278 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-23 22:59:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,281 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,281 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 22:59:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,304 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,305 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-23 22:59:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,309 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,309 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-23 22:59:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,313 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,314 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-23 22:59:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,318 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,318 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-23 22:59:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:40,322 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:40,322 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:40,343 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-02-23 22:59:40,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2037916922] [2021-02-23 22:59:40,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 22:59:40,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-02-23 22:59:40,344 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812589394] [2021-02-23 22:59:40,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-23 22:59:40,345 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:40,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-23 22:59:40,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-23 22:59:40,346 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 20 states. [2021-02-23 22:59:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:42,484 INFO L93 Difference]: Finished difference Result 173 states and 184 transitions. [2021-02-23 22:59:42,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-02-23 22:59:42,484 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2021-02-23 22:59:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:42,487 INFO L225 Difference]: With dead ends: 173 [2021-02-23 22:59:42,487 INFO L226 Difference]: Without dead ends: 171 [2021-02-23 22:59:42,488 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-23 22:59:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2021-02-23 22:59:42,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 124. [2021-02-23 22:59:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2021-02-23 22:59:42,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 133 transitions. [2021-02-23 22:59:42,512 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 133 transitions. Word has length 99 [2021-02-23 22:59:42,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:42,513 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 133 transitions. [2021-02-23 22:59:42,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-23 22:59:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 133 transitions. [2021-02-23 22:59:42,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-23 22:59:42,514 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:42,515 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-23 22:59:42,515 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-02-23 22:59:42,515 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:42,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:42,516 INFO L82 PathProgramCache]: Analyzing trace with hash 881317306, now seen corresponding path program 1 times [2021-02-23 22:59:42,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:42,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [120264730] [2021-02-23 22:59:42,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:42,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,570 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,571 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,572 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,572 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,579 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,579 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,587 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,587 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,596 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,597 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,606 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,607 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,618 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,619 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,631 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,632 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,649 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,649 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,666 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,666 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,683 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,685 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,689 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,690 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,708 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,709 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,728 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,729 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,748 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,750 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,773 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,774 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,799 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,799 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:42,801 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,802 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:42,822 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,823 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:42,844 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,844 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,891 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,902 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,902 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,907 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,908 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-23 22:59:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,917 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,918 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 22:59:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,943 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,943 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-23 22:59:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,951 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,952 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-23 22:59:42,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,956 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,957 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-23 22:59:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,967 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,967 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-23 22:59:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:42,971 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:42,972 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:42,993 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-02-23 22:59:42,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [120264730] [2021-02-23 22:59:42,994 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 22:59:42,994 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-02-23 22:59:42,994 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462225188] [2021-02-23 22:59:42,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-23 22:59:42,995 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:42,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-23 22:59:42,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-23 22:59:42,996 INFO L87 Difference]: Start difference. First operand 124 states and 133 transitions. Second operand 20 states. [2021-02-23 22:59:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:45,339 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2021-02-23 22:59:45,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-02-23 22:59:45,340 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2021-02-23 22:59:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:45,342 INFO L225 Difference]: With dead ends: 196 [2021-02-23 22:59:45,342 INFO L226 Difference]: Without dead ends: 194 [2021-02-23 22:59:45,344 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-23 22:59:45,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-02-23 22:59:45,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 147. [2021-02-23 22:59:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2021-02-23 22:59:45,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2021-02-23 22:59:45,376 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 99 [2021-02-23 22:59:45,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:45,377 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2021-02-23 22:59:45,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-23 22:59:45,377 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2021-02-23 22:59:45,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-02-23 22:59:45,378 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:45,379 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-23 22:59:45,379 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-02-23 22:59:45,379 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash -39618822, now seen corresponding path program 2 times [2021-02-23 22:59:45,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:45,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1022874661] [2021-02-23 22:59:45,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,436 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,437 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,437 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,438 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,444 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,445 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,452 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,453 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,461 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,462 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,472 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,472 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,490 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,491 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,504 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,507 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,522 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,523 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,536 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,537 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,552 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,553 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,553 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,554 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,569 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,570 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,593 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,594 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,622 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,623 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,645 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,645 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,675 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,676 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:45,677 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,678 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:45,705 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,705 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:45,725 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,726 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,795 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,796 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,799 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,800 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-23 22:59:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,808 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,809 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 22:59:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,851 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,852 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-23 22:59:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,864 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,865 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-23 22:59:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,870 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,871 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-23 22:59:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,879 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,879 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-23 22:59:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:45,886 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:45,886 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:45,924 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-02-23 22:59:45,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1022874661] [2021-02-23 22:59:45,925 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 22:59:45,925 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2021-02-23 22:59:45,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996225972] [2021-02-23 22:59:45,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-02-23 22:59:45,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:45,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-02-23 22:59:45,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2021-02-23 22:59:45,931 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand 20 states. [2021-02-23 22:59:48,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:48,302 INFO L93 Difference]: Finished difference Result 213 states and 228 transitions. [2021-02-23 22:59:48,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-02-23 22:59:48,302 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 99 [2021-02-23 22:59:48,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:48,305 INFO L225 Difference]: With dead ends: 213 [2021-02-23 22:59:48,305 INFO L226 Difference]: Without dead ends: 211 [2021-02-23 22:59:48,306 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-23 22:59:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-02-23 22:59:48,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 187. [2021-02-23 22:59:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2021-02-23 22:59:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 200 transitions. [2021-02-23 22:59:48,348 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 200 transitions. Word has length 99 [2021-02-23 22:59:48,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:48,348 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 200 transitions. [2021-02-23 22:59:48,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2021-02-23 22:59:48,348 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 200 transitions. [2021-02-23 22:59:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-02-23 22:59:48,350 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:48,351 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-23 22:59:48,351 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-02-23 22:59:48,351 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:48,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:48,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1220663755, now seen corresponding path program 3 times [2021-02-23 22:59:48,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:48,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [859904743] [2021-02-23 22:59:48,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:48,434 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,436 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:48,436 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,437 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,443 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,444 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,450 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,451 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,460 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,460 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,470 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,471 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,481 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,482 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,494 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,494 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,507 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,508 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,523 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,524 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,542 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,543 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,544 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,544 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,564 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,564 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,586 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,587 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,610 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,611 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,641 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,642 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,668 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,668 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,669 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,669 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,694 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,695 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,719 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,720 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,748 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,749 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,778 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,779 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,808 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,808 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-02-23 22:59:48,809 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,810 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:48,833 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,833 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-02-23 22:59:48,859 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,859 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:48,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:48,922 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,923 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:48,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:48,926 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,926 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:48,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-23 22:59:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:48,929 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,930 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:48,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 22:59:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:48,958 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,958 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:48,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-23 22:59:48,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:48,962 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,962 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:48,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-23 22:59:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:48,968 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,969 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:48,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-23 22:59:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:48,973 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,974 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:48,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-23 22:59:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:48,977 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,978 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:48,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-02-23 22:59:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:48,982 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,982 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:48,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-02-23 22:59:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:48,986 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:48,987 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 37 proven. 37 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-02-23 22:59:49,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [859904743] [2021-02-23 22:59:49,020 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 22:59:49,020 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-02-23 22:59:49,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893870119] [2021-02-23 22:59:49,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2021-02-23 22:59:49,021 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:49,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-02-23 22:59:49,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2021-02-23 22:59:49,022 INFO L87 Difference]: Start difference. First operand 187 states and 200 transitions. Second operand 25 states. [2021-02-23 22:59:52,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:52,757 INFO L93 Difference]: Finished difference Result 242 states and 257 transitions. [2021-02-23 22:59:52,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2021-02-23 22:59:52,761 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 126 [2021-02-23 22:59:52,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:52,764 INFO L225 Difference]: With dead ends: 242 [2021-02-23 22:59:52,764 INFO L226 Difference]: Without dead ends: 176 [2021-02-23 22:59:52,766 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=576, Invalid=2846, Unknown=0, NotChecked=0, Total=3422 [2021-02-23 22:59:52,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2021-02-23 22:59:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2021-02-23 22:59:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2021-02-23 22:59:52,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2021-02-23 22:59:52,796 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 126 [2021-02-23 22:59:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:52,796 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2021-02-23 22:59:52,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2021-02-23 22:59:52,797 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2021-02-23 22:59:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2021-02-23 22:59:52,798 INFO L414 BasicCegarLoop]: Found error trace [2021-02-23 22:59:52,798 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-23 22:59:52,799 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-02-23 22:59:52,799 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-02-23 22:59:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-02-23 22:59:52,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2141599883, now seen corresponding path program 4 times [2021-02-23 22:59:52,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-02-23 22:59:52,800 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2045962590] [2021-02-23 22:59:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-02-23 22:59:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:52,862 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,863 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:52,863 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,864 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:52,867 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,867 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:52,872 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,872 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:52,877 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,878 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:52,884 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,885 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:52,886 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,887 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-02-23 22:59:52,900 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,900 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-02-23 22:59:52,913 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,913 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-02-23 22:59:52,925 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,926 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:52,927 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,927 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:52,927 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,928 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:52,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-02-23 22:59:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:52,965 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,966 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:52,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-02-23 22:59:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:52,970 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,970 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:52,971 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-02-23 22:59:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:52,974 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,974 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:52,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-02-23 22:59:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:52,992 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:52,993 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 6 [2021-02-23 22:59:53,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2021-02-23 22:59:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:53,012 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:53,013 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:53,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2021-02-23 22:59:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:53,019 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:53,019 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:53,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2021-02-23 22:59:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:53,023 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:53,023 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:53,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-02-23 22:59:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:53,027 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:53,028 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:53,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-02-23 22:59:53,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:53,037 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:53,038 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:53,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2021-02-23 22:59:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-02-23 22:59:53,043 WARN L141 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-02-23 22:59:53,043 WARN L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-02-23 22:59:53,081 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 53 proven. 10 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-02-23 22:59:53,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2045962590] [2021-02-23 22:59:53,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2021-02-23 22:59:53,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2021-02-23 22:59:53,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99854607] [2021-02-23 22:59:53,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-02-23 22:59:53,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-02-23 22:59:53,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-02-23 22:59:53,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2021-02-23 22:59:53,085 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 12 states. [2021-02-23 22:59:53,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-02-23 22:59:53,829 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2021-02-23 22:59:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-02-23 22:59:53,830 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 126 [2021-02-23 22:59:53,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-02-23 22:59:53,831 INFO L225 Difference]: With dead ends: 168 [2021-02-23 22:59:53,831 INFO L226 Difference]: Without dead ends: 0 [2021-02-23 22:59:53,832 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2021-02-23 22:59:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-02-23 22:59:53,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-02-23 22:59:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2021-02-23 22:59:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-02-23 22:59:53,833 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 126 [2021-02-23 22:59:53,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-02-23 22:59:53,833 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-02-23 22:59:53,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-02-23 22:59:53,833 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-02-23 22:59:53,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-02-23 22:59:53,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-02-23 22:59:53,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-02-23 22:59:57,383 WARN L202 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-23 22:59:57,557 WARN L202 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 29 [2021-02-23 22:59:57,888 WARN L202 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 40 [2021-02-23 22:59:58,266 WARN L202 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-23 22:59:58,514 WARN L202 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2021-02-23 22:59:58,638 WARN L202 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 25 [2021-02-23 22:59:58,983 WARN L202 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-23 22:59:59,219 WARN L202 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2021-02-23 22:59:59,579 WARN L202 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-23 22:59:59,698 WARN L202 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 20 [2021-02-23 23:00:00,090 WARN L202 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-23 23:00:00,340 WARN L202 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2021-02-23 23:00:00,537 WARN L202 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2021-02-23 23:00:00,826 WARN L202 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2021-02-23 23:00:01,125 WARN L202 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2021-02-23 23:00:01,474 WARN L202 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 43 [2021-02-23 23:00:01,893 WARN L202 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 51 [2021-02-23 23:00:02,371 WARN L202 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 49 [2021-02-23 23:00:02,812 WARN L202 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 52 [2021-02-23 23:00:03,065 WARN L202 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2021-02-23 23:00:03,486 WARN L202 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2021-02-23 23:00:03,746 WARN L202 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 35 [2021-02-23 23:00:04,238 WARN L202 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 51 [2021-02-23 23:00:04,516 WARN L202 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2021-02-23 23:00:04,974 WARN L202 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 48 [2021-02-23 23:00:05,082 WARN L202 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 20 [2021-02-23 23:00:05,487 WARN L202 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2021-02-23 23:00:05,792 WARN L202 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2021-02-23 23:00:06,135 WARN L202 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 38 [2021-02-23 23:00:06,444 WARN L202 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2021-02-23 23:00:06,728 WARN L202 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 42 [2021-02-23 23:00:06,918 WARN L202 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 40 [2021-02-23 23:00:06,947 INFO L189 CegarLoopUtils]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2021-02-23 23:00:06,947 INFO L189 CegarLoopUtils]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2021-02-23 23:00:06,947 INFO L189 CegarLoopUtils]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2021-02-23 23:00:06,947 INFO L192 CegarLoopUtils]: At program point L5-4(line 5) the Hoare annotation is: true [2021-02-23 23:00:06,948 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-23 23:00:06,948 INFO L192 CegarLoopUtils]: At program point L-1-1(line -1) the Hoare annotation is: true [2021-02-23 23:00:06,948 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line 5) the Hoare annotation is: true [2021-02-23 23:00:06,948 INFO L185 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#t~string6.offset)| |#t~string6.offset|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |#t~string7.offset| |old(#t~string7.offset)|) (= |old(#t~string7.base)| |#t~string7.base|) (= |old(#valid)| |#valid|)) [2021-02-23 23:00:06,948 INFO L192 CegarLoopUtils]: At program point L5(line 5) the Hoare annotation is: true [2021-02-23 23:00:06,948 INFO L192 CegarLoopUtils]: At program point L5-1(line 5) the Hoare annotation is: true [2021-02-23 23:00:06,948 INFO L192 CegarLoopUtils]: At program point L5-2(line 5) the Hoare annotation is: true [2021-02-23 23:00:06,949 INFO L192 CegarLoopUtils]: At program point L5-3(line 5) the Hoare annotation is: true [2021-02-23 23:00:06,949 INFO L192 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-02-23 23:00:06,949 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-02-23 23:00:06,949 INFO L192 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-02-23 23:00:06,949 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-02-23 23:00:06,949 INFO L192 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-02-23 23:00:06,949 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 7 9) the Hoare annotation is: true [2021-02-23 23:00:06,949 INFO L192 CegarLoopUtils]: At program point L8(line 8) the Hoare annotation is: true [2021-02-23 23:00:06,950 INFO L192 CegarLoopUtils]: At program point L8-1(line 8) the Hoare annotation is: true [2021-02-23 23:00:06,950 INFO L192 CegarLoopUtils]: At program point L8-3(lines 7 9) the Hoare annotation is: true [2021-02-23 23:00:06,950 INFO L192 CegarLoopUtils]: At program point assume_abort_if_notEXIT(lines 7 9) the Hoare annotation is: true [2021-02-23 23:00:06,950 INFO L192 CegarLoopUtils]: At program point mainEXIT(lines 40 54) the Hoare annotation is: true [2021-02-23 23:00:06,950 INFO L192 CegarLoopUtils]: At program point L52(line 52) the Hoare annotation is: true [2021-02-23 23:00:06,950 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-23 23:00:06,950 INFO L192 CegarLoopUtils]: At program point L50-1(line 50) the Hoare annotation is: true [2021-02-23 23:00:06,951 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-23 23:00:06,951 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-23 23:00:06,951 INFO L185 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-23 23:00:06,951 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-23 23:00:06,951 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-23 23:00:06,951 INFO L192 CegarLoopUtils]: At program point mainFINAL(lines 40 54) the Hoare annotation is: true [2021-02-23 23:00:06,952 INFO L185 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-23 23:00:06,952 INFO L185 CegarLoopUtils]: At program point L42-1(line 42) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2021-02-23 23:00:06,952 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-23 23:00:06,952 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-23 23:00:06,952 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-23 23:00:06,952 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-23 23:00:06,953 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-23 23:00:06,953 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-23 23:00:06,953 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-23 23:00:06,953 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-23 23:00:06,953 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-23 23:00:06,953 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-23 23:00:06,954 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-23 23:00:06,954 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-23 23:00:06,954 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-23 23:00:06,954 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-23 23:00:06,954 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-23 23:00:06,954 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-23 23:00:06,955 INFO L192 CegarLoopUtils]: At program point checkENTRY(lines 16 38) the Hoare annotation is: true [2021-02-23 23:00:06,955 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-23 23:00:06,955 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-23 23:00:06,955 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-23 23:00:06,955 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-23 23:00:06,956 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-23 23:00:06,956 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-23 23:00:06,956 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-23 23:00:06,956 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-23 23:00:06,957 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-23 23:00:06,957 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-23 23:00:06,957 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-23 23:00:06,957 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-23 23:00:06,957 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-23 23:00:06,958 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-23 23:00:06,958 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-23 23:00:06,958 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-23 23:00:06,959 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-23 23:00:06,959 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-23 23:00:06,959 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-23 23:00:06,959 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-23 23:00:06,960 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-23 23:00:06,960 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-23 23:00:06,960 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-23 23:00:06,960 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-23 23:00:06,961 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-23 23:00:06,961 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-23 23:00:06,961 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-23 23:00:06,961 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-23 23:00:06,961 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-23 23:00:06,962 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-23 23:00:06,962 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-23 23:00:06,962 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-23 23:00:06,962 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-23 23:00:06,963 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-23 23:00:06,963 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-23 23:00:06,963 INFO L192 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 10 12) the Hoare annotation is: true [2021-02-23 23:00:06,963 INFO L185 CegarLoopUtils]: At program point L11(line 11) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-23 23:00:06,963 INFO L185 CegarLoopUtils]: At program point L11-1(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-23 23:00:06,963 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-23 23:00:06,963 INFO L185 CegarLoopUtils]: At program point L11-2(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-23 23:00:06,964 INFO L185 CegarLoopUtils]: At program point L11-4(lines 10 12) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-02-23 23:00:06,964 INFO L185 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-02-23 23:00:06,964 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2021-02-23 23:00:06,964 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-02-23 23:00:06,964 INFO L185 CegarLoopUtils]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2021-02-23 23:00:06,987 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-23 23:00:06,993 INFO L168 Benchmark]: Toolchain (without parser) took 38210.68 ms. Allocated memory was 157.3 MB in the beginning and 339.7 MB in the end (delta: 182.5 MB). Free memory was 132.8 MB in the beginning and 252.1 MB in the end (delta: -119.3 MB). Peak memory consumption was 200.3 MB. Max. memory is 8.0 GB. [2021-02-23 23:00:06,993 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 157.3 MB. Free memory is still 140.7 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-02-23 23:00:06,995 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.39 ms. Allocated memory is still 157.3 MB. Free memory was 131.7 MB in the beginning and 120.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-02-23 23:00:06,996 INFO L168 Benchmark]: Boogie Preprocessor took 92.66 ms. Allocated memory is still 157.3 MB. Free memory was 120.9 MB in the beginning and 119.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2021-02-23 23:00:06,996 INFO L168 Benchmark]: RCFGBuilder took 813.90 ms. Allocated memory is still 157.3 MB. Free memory was 119.2 MB in the beginning and 125.4 MB in the end (delta: -6.1 MB). Peak memory consumption was 11.0 MB. Max. memory is 8.0 GB. [2021-02-23 23:00:06,996 INFO L168 Benchmark]: TraceAbstraction took 36954.92 ms. Allocated memory was 157.3 MB in the beginning and 339.7 MB in the end (delta: 182.5 MB). Free memory was 124.7 MB in the beginning and 252.1 MB in the end (delta: -127.3 MB). Peak memory consumption was 192.5 MB. Max. memory is 8.0 GB. [2021-02-23 23:00:06,999 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.21 ms. Allocated memory is still 157.3 MB. Free memory is still 140.7 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 328.39 ms. Allocated memory is still 157.3 MB. Free memory was 131.7 MB in the beginning and 120.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 92.66 ms. Allocated memory is still 157.3 MB. Free memory was 120.9 MB in the beginning and 119.2 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 813.90 ms. Allocated memory is still 157.3 MB. Free memory was 119.2 MB in the beginning and 125.4 MB in the end (delta: -6.1 MB). Peak memory consumption was 11.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 36954.92 ms. Allocated memory was 157.3 MB in the beginning and 339.7 MB in the end (delta: 182.5 MB). Free memory was 124.7 MB in the beginning and 252.1 MB in the end (delta: -127.3 MB). Peak memory consumption was 192.5 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...