/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -s ../../../trunk/examples/settings/gemcutter/SleepMap-ConcreteSmt-VarAbsGlobalSmt.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.dpor-95ec559 [2023-01-11 13:44:04,185 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-11 13:44:04,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-11 13:44:04,223 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-11 13:44:04,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-11 13:44:04,226 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-11 13:44:04,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-11 13:44:04,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-11 13:44:04,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-11 13:44:04,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-11 13:44:04,239 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-11 13:44:04,240 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-11 13:44:04,240 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-11 13:44:04,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-11 13:44:04,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-11 13:44:04,242 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-11 13:44:04,243 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-11 13:44:04,243 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-11 13:44:04,245 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-11 13:44:04,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-11 13:44:04,247 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-11 13:44:04,250 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-11 13:44:04,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-11 13:44:04,251 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-11 13:44:04,257 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-11 13:44:04,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-11 13:44:04,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-11 13:44:04,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-11 13:44:04,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-11 13:44:04,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-11 13:44:04,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-11 13:44:04,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-11 13:44:04,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-11 13:44:04,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-11 13:44:04,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-11 13:44:04,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-11 13:44:04,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-11 13:44:04,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-11 13:44:04,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-11 13:44:04,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-11 13:44:04,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-11 13:44:04,270 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/SleepMap-ConcreteSmt-VarAbsGlobalSmt.epf [2023-01-11 13:44:04,304 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-11 13:44:04,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-11 13:44:04,305 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-01-11 13:44:04,305 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-01-11 13:44:04,305 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-11 13:44:04,306 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-11 13:44:04,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-11 13:44:04,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-11 13:44:04,306 INFO L138 SettingsManager]: * Use SBE=true [2023-01-11 13:44:04,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-11 13:44:04,307 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-11 13:44:04,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-11 13:44:04,307 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-11 13:44:04,307 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-11 13:44:04,307 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-11 13:44:04,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-11 13:44:04,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-11 13:44:04,307 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-11 13:44:04,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-11 13:44:04,308 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-11 13:44:04,308 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-11 13:44:04,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-11 13:44:04,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-11 13:44:04,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-11 13:44:04,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-11 13:44:04,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-11 13:44:04,309 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-11 13:44:04,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-11 13:44:04,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-11 13:44:04,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-11 13:44:04,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-11 13:44:04,309 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-01-11 13:44:04,309 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-01-11 13:44:04,309 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-01-11 13:44:04,310 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-01-11 13:44:04,310 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_ERROR_LOCATION [2023-01-11 13:44:04,310 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES [2023-01-11 13:44:04,310 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-11 13:44:04,310 INFO L138 SettingsManager]: * Number of independence relations to use for POR=2 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: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION [2023-01-11 13:44:04,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-11 13:44:04,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-11 13:44:04,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-11 13:44:04,560 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-11 13:44:04,561 INFO L275 PluginConnector]: CDTParser initialized [2023-01-11 13:44:04,561 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-01-11 13:44:05,729 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-11 13:44:05,909 INFO L351 CDTParser]: Found 1 translation units. [2023-01-11 13:44:05,910 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2023-01-11 13:44:05,914 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dec4c989a/046eeaf939ee42fb985c6aa80c25828b/FLAGd29b80665 [2023-01-11 13:44:05,924 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dec4c989a/046eeaf939ee42fb985c6aa80c25828b [2023-01-11 13:44:05,925 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-11 13:44:05,926 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-11 13:44:05,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-11 13:44:05,927 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-11 13:44:05,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-11 13:44:05,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:44:05" (1/1) ... [2023-01-11 13:44:05,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d607333 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:05, skipping insertion in model container [2023-01-11 13:44:05,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 01:44:05" (1/1) ... [2023-01-11 13:44:05,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-11 13:44:05,962 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-11 13:44:06,110 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3107,3120] [2023-01-11 13:44:06,117 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-11 13:44:06,124 INFO L203 MainTranslator]: Completed pre-run [2023-01-11 13:44:06,143 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3107,3120] [2023-01-11 13:44:06,147 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-11 13:44:06,153 WARN L663 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-11 13:44:06,153 WARN L663 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-11 13:44:06,159 INFO L208 MainTranslator]: Completed translation [2023-01-11 13:44:06,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:06 WrapperNode [2023-01-11 13:44:06,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-11 13:44:06,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-11 13:44:06,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-11 13:44:06,160 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-11 13:44:06,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:06" (1/1) ... [2023-01-11 13:44:06,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:06" (1/1) ... [2023-01-11 13:44:06,194 INFO L138 Inliner]: procedures = 25, calls = 52, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 164 [2023-01-11 13:44:06,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-11 13:44:06,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-11 13:44:06,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-11 13:44:06,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-11 13:44:06,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:06" (1/1) ... [2023-01-11 13:44:06,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:06" (1/1) ... [2023-01-11 13:44:06,217 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:06" (1/1) ... [2023-01-11 13:44:06,218 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:06" (1/1) ... [2023-01-11 13:44:06,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:06" (1/1) ... [2023-01-11 13:44:06,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:06" (1/1) ... [2023-01-11 13:44:06,232 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:06" (1/1) ... [2023-01-11 13:44:06,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:06" (1/1) ... [2023-01-11 13:44:06,235 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-11 13:44:06,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-11 13:44:06,236 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-11 13:44:06,236 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-11 13:44:06,237 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:06" (1/1) ... [2023-01-11 13:44:06,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-11 13:44:06,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 13:44:06,260 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-11 13:44:06,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-11 13:44:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-11 13:44:06,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-11 13:44:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-11 13:44:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-11 13:44:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-11 13:44:06,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-11 13:44:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-11 13:44:06,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-11 13:44:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-11 13:44:06,288 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-11 13:44:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-11 13:44:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-11 13:44:06,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-11 13:44:06,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-11 13:44:06,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-11 13:44:06,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-11 13:44:06,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-11 13:44:06,290 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-11 13:44:06,374 INFO L236 CfgBuilder]: Building ICFG [2023-01-11 13:44:06,376 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-11 13:44:06,666 INFO L277 CfgBuilder]: Performing block encoding [2023-01-11 13:44:06,748 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-11 13:44:06,748 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-11 13:44:06,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:44:06 BoogieIcfgContainer [2023-01-11 13:44:06,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-11 13:44:06,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-11 13:44:06,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-11 13:44:06,756 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-11 13:44:06,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 01:44:05" (1/3) ... [2023-01-11 13:44:06,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589b549f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:44:06, skipping insertion in model container [2023-01-11 13:44:06,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 01:44:06" (2/3) ... [2023-01-11 13:44:06,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589b549f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 01:44:06, skipping insertion in model container [2023-01-11 13:44:06,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 01:44:06" (3/3) ... [2023-01-11 13:44:06,758 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2023-01-11 13:44:06,765 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-01-11 13:44:06,774 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-11 13:44:06,774 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-11 13:44:06,774 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-11 13:44:06,871 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-01-11 13:44:06,906 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 13:44:06,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-01-11 13:44:06,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 13:44:06,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-01-11 13:44:06,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-01-11 13:44:06,968 INFO L100 denceProviderFactory]: Independence Relation #2: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 13:44:06,979 INFO L164 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 2 independence relations. [2023-01-11 13:44:06,979 WARN L167 artialOrderCegarLoop]: Attention: Unsuitable combinations of independence relations may be unsound! [2023-01-11 13:44:06,980 WARN L168 artialOrderCegarLoop]: Only combine independence relations if you are sure the combination is sound. [2023-01-11 13:44:06,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2023-01-11 13:44:06,992 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6992e141, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-01-11 13:44:06,993 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-01-11 13:44:07,432 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:44:07,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:44:07,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1889506229, now seen corresponding path program 1 times [2023-01-11 13:44:07,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:44:07,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469955594] [2023-01-11 13:44:07,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:07,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:44:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-01-11 13:44:07,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:44:07,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469955594] [2023-01-11 13:44:07,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469955594] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 13:44:07,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 13:44:07,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-11 13:44:07,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073962965] [2023-01-11 13:44:07,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 13:44:07,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-11 13:44:07,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:44:07,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-11 13:44:07,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-11 13:44:07,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:07,760 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:44:07,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.0) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:44:07,761 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:07,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-11 13:44:07,832 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:44:07,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:44:07,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1719277181, now seen corresponding path program 1 times [2023-01-11 13:44:07,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:44:07,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853956773] [2023-01-11 13:44:07,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:07,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:44:07,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:08,707 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:44:08,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:44:08,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853956773] [2023-01-11 13:44:08,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853956773] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 13:44:08,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182079309] [2023-01-11 13:44:08,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:08,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:44:08,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 13:44:08,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 13:44:08,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-11 13:44:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:08,848 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 6 conjunts are in the unsatisfiable core [2023-01-11 13:44:08,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 13:44:08,970 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:44:08,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 13:44:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:44:09,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182079309] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 13:44:09,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 13:44:09,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2023-01-11 13:44:09,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890819027] [2023-01-11 13:44:09,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 13:44:09,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-11 13:44:09,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:44:09,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-11 13:44:09,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-01-11 13:44:09,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:09,034 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:44:09,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 12.090909090909092) internal successors, (133), 11 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:44:09,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:09,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:09,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:09,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:09,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-11 13:44:09,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-01-11 13:44:09,610 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:44:09,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:44:09,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1613083260, now seen corresponding path program 2 times [2023-01-11 13:44:09,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:44:09,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651316847] [2023-01-11 13:44:09,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:09,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:44:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:09,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-11 13:44:09,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:44:09,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651316847] [2023-01-11 13:44:09,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651316847] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 13:44:09,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 13:44:09,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-11 13:44:09,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59302555] [2023-01-11 13:44:09,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 13:44:09,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-11 13:44:09,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:44:09,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-11 13:44:09,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-11 13:44:09,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:09,820 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:44:09,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:44:09,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:09,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:09,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:10,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:10,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-11 13:44:10,055 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:44:10,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:44:10,055 INFO L85 PathProgramCache]: Analyzing trace with hash 839121752, now seen corresponding path program 3 times [2023-01-11 13:44:10,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:44:10,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318324117] [2023-01-11 13:44:10,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:10,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:44:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:44:10,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:44:10,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318324117] [2023-01-11 13:44:10,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318324117] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 13:44:10,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463877135] [2023-01-11 13:44:10,227 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-11 13:44:10,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:44:10,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 13:44:10,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 13:44:10,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-11 13:44:10,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-11 13:44:10,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-11 13:44:10,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-11 13:44:10,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 13:44:10,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:44:10,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 13:44:10,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:44:10,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463877135] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 13:44:10,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 13:44:10,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2023-01-11 13:44:10,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70364422] [2023-01-11 13:44:10,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 13:44:10,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-01-11 13:44:10,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:44:10,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-01-11 13:44:10,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-01-11 13:44:10,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:10,588 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:44:10,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:44:10,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:10,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:10,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:10,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:10,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:10,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:10,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:10,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:10,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-11 13:44:11,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:44:11,172 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:44:11,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:44:11,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1066791976, now seen corresponding path program 4 times [2023-01-11 13:44:11,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:44:11,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410230217] [2023-01-11 13:44:11,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:11,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:44:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:44:11,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:44:11,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410230217] [2023-01-11 13:44:11,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410230217] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 13:44:11,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 13:44:11,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-01-11 13:44:11,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190838611] [2023-01-11 13:44:11,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 13:44:11,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-11 13:44:11,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:44:11,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-11 13:44:11,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-01-11 13:44:11,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:11,428 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:44:11,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:44:11,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:11,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:11,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:11,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:11,429 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:11,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:11,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:11,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:11,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:11,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:44:11,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-11 13:44:11,827 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:44:11,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:44:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash -605056044, now seen corresponding path program 1 times [2023-01-11 13:44:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:44:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434000102] [2023-01-11 13:44:11,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:44:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:12,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-11 13:44:12,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:44:12,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434000102] [2023-01-11 13:44:12,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434000102] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 13:44:12,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661580544] [2023-01-11 13:44:12,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:12,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:44:12,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 13:44:12,271 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 13:44:12,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-11 13:44:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:12,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 67 conjunts are in the unsatisfiable core [2023-01-11 13:44:12,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 13:44:12,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-11 13:44:12,460 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-01-11 13:44:12,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-01-11 13:44:12,495 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-01-11 13:44:12,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2023-01-11 13:44:12,985 INFO L321 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2023-01-11 13:44:12,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 25 [2023-01-11 13:44:13,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-11 13:44:13,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-11 13:44:13,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-11 13:44:13,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-11 13:44:13,893 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2023-01-11 13:44:13,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:44:13,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 13:44:14,693 WARN L837 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~front~0) (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4))) (.cse2 (+ c_~queue~0.offset (* c_~back~0 4)))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (<= (+ c_~sum~0 (select .cse0 .cse1)) 1) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse3 .cse1))) (not (= (select .cse3 .cse2) 1))))))) (< c_~front~0 0)) is different from false [2023-01-11 13:44:14,865 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse2 (+ c_~queue~0.offset (* c_~back~0 4))) (.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse0 .cse1))) (not (= (select .cse0 .cse2) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (not (= (select .cse3 .cse2) 1)) (<= (+ c_~sum~0 (select .cse3 .cse1)) 1)))))) (<= c_~n~0 c_~front~0) (< c_~front~0 0)) is different from false [2023-01-11 13:44:15,698 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 13:44:15,698 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2023-01-11 13:44:15,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 13:44:15,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2636 treesize of output 2520 [2023-01-11 13:44:15,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 13:44:15,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 218 treesize of output 218 [2023-01-11 13:44:15,799 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 13:44:15,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 194 [2023-01-11 13:44:15,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 13:44:15,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 169 [2023-01-11 13:44:16,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 13:44:16,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 56 [2023-01-11 13:44:16,252 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-01-11 13:44:16,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 644 treesize of output 616 [2023-01-11 13:44:16,286 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-01-11 13:44:16,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 296 treesize of output 252 [2023-01-11 13:44:16,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:44:16,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 170 [2023-01-11 13:44:16,317 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2023-01-11 13:44:16,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 181 treesize of output 161 [2023-01-11 13:44:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:44:17,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661580544] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 13:44:17,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 13:44:17,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 30, 27] total 59 [2023-01-11 13:44:17,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927521017] [2023-01-11 13:44:17,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 13:44:17,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-01-11 13:44:17,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:44:17,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-01-11 13:44:17,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=694, Invalid=2447, Unknown=59, NotChecked=222, Total=3422 [2023-01-11 13:44:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:17,589 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:44:17,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 4.864406779661017) internal successors, (287), 59 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:44:17,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:17,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:17,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:17,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:17,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:44:17,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:17,673 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~front~0 4)) (.cse10 (* c_~back~0 4))) (let ((.cse0 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse9 .cse10))) (.cse4 (+ c_~queue~0.offset .cse9)) (.cse1 (<= c_~n~0 c_~front~0)) (.cse2 (< c_~front~0 0))) (and (or .cse0 .cse1 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_9|) 0))) (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse2) (or .cse1 (let ((.cse3 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse4)))) (and (<= .cse3 1) (<= 0 .cse3))) .cse2) (or .cse1 (let ((.cse7 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse5 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ (select .cse5 .cse6) c_~sum~0) 1) (not (= (select .cse5 .cse7) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse8 .cse7) 1)) (<= 0 (+ (select .cse8 .cse6) c_~sum~0))))))) .cse2) (or .cse0 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2) (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2) (or .cse1 (let ((.cse12 (+ .cse10 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse13 (+ .cse9 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse11 .cse12) 1)) (<= (+ c_~sum~0 (select .cse11 .cse13)) 1)))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse14 .cse12) 1)) (<= 0 (+ c_~sum~0 (select .cse14 .cse13)))))))) .cse2) (or (let ((.cse16 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse17 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= (+ c_~sum~0 (select .cse15 .cse16)) 1) (not (= (select .cse15 .cse17) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse18 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse18 .cse16))) (not (= (select .cse18 .cse17) 1))))))) .cse1 .cse2) (or (let ((.cse20 (+ c_~queue~0.offset .cse10))) (and (forall ((v_ArrVal_138 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (not (= (select .cse19 .cse20) 1)) (<= (+ c_~sum~0 (select .cse19 .cse4)) 1)))) (forall ((v_ArrVal_138 (Array Int Int))) (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (not (= (select .cse21 .cse20) 1)) (<= 0 (+ c_~sum~0 (select .cse21 .cse4)))))))) .cse1 .cse2) (= c_~sum~0 0)))) is different from false [2023-01-11 13:44:23,552 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~front~0 4)) (.cse11 (* c_~back~0 4))) (let ((.cse1 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_9| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc19#1.base_9|) 0)))) (.cse0 (and (<= c_~sum~0 0) (<= 0 (+ c_~sum~0 1)) (= .cse10 .cse11))) (.cse5 (+ c_~queue~0.offset .cse10)) (.cse3 (<= c_~n~0 c_~front~0)) (.cse2 (< c_~front~0 0))) (and (<= 1 |c_thread2Thread1of1ForFork0_~cond~1#1|) (or .cse0 (< 0 c_~front~0) .cse1 .cse2) (or .cse0 .cse3 .cse1 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse2) (or .cse3 (let ((.cse4 (+ c_~sum~0 (select (select |c_#memory_int| c_~queue~0.base) .cse5)))) (and (<= .cse4 1) (<= 0 .cse4))) .cse2) (or .cse3 (let ((.cse8 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse7 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (<= (+ (select .cse6 .cse7) c_~sum~0) 1) (not (= (select .cse6 .cse8) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse9 .cse8) 1)) (<= 0 (+ (select .cse9 .cse7) c_~sum~0))))))) .cse2) (<= c_~v_assert~0 1) (or .cse0 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse2) (= c_~sum~0 1) (<= |c_thread2Thread1of1ForFork0_~cond~1#1| 1) (<= (div |c_thread1Thread1of1ForFork2_~cond~0#1| 256) 0) (<= 1 |c_thread1Thread1of1ForFork2_~cond~0#1|) (or .cse0 (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3 .cse2) (<= 1 c_~v_assert~0) (or .cse3 (let ((.cse13 (+ .cse11 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse14 (+ .cse10 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse12 .cse13) 1)) (<= (+ c_~sum~0 (select .cse12 .cse14)) 1)))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse15 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= (select .cse15 .cse13) 1)) (<= 0 (+ c_~sum~0 (select .cse15 .cse14)))))))) .cse2) (or (let ((.cse17 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse18 (+ .cse11 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= (+ c_~sum~0 (select .cse16 .cse17)) 1) (not (= (select .cse16 .cse18) 1))))) (forall ((v_ArrVal_138 (Array Int Int)) (v_ArrVal_137 (Array Int Int)) (v_ArrVal_136 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_136) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_137) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= 0 (+ c_~sum~0 (select .cse19 .cse17))) (not (= (select .cse19 .cse18) 1))))))) .cse3 .cse2) (or (let ((.cse21 (+ c_~queue~0.offset .cse11))) (and (forall ((v_ArrVal_138 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (not (= (select .cse20 .cse21) 1)) (<= (+ c_~sum~0 (select .cse20 .cse5)) 1)))) (forall ((v_ArrVal_138 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_138) c_~queue~0.base))) (or (not (= (select .cse22 .cse21) 1)) (<= 0 (+ c_~sum~0 (select .cse22 .cse5)))))))) .cse3 .cse2)))) is different from false [2023-01-11 13:44:31,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:31,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:44:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-01-11 13:44:31,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-11 13:44:31,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:44:31,435 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:44:31,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:44:31,436 INFO L85 PathProgramCache]: Analyzing trace with hash 153908528, now seen corresponding path program 2 times [2023-01-11 13:44:31,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:44:31,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838106566] [2023-01-11 13:44:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:31,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:44:31,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-01-11 13:44:31,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:44:31,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838106566] [2023-01-11 13:44:31,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838106566] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 13:44:31,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 13:44:31,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-11 13:44:31,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311901887] [2023-01-11 13:44:31,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 13:44:31,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-11 13:44:31,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:44:31,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-11 13:44:31,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-11 13:44:31,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:31,677 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:44:31,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:44:31,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:31,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:31,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:31,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:31,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:44:31,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2023-01-11 13:44:31,677 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:32,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:32,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:44:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-01-11 13:44:32,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:32,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-01-11 13:44:32,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:44:32,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:44:32,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1342361515, now seen corresponding path program 1 times [2023-01-11 13:44:32,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:44:32,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248527638] [2023-01-11 13:44:32,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:32,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:44:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2023-01-11 13:44:32,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:44:32,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248527638] [2023-01-11 13:44:32,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248527638] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 13:44:32,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-11 13:44:32,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-01-11 13:44:32,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247530374] [2023-01-11 13:44:32,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 13:44:32,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-11 13:44:32,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:44:32,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-11 13:44:32,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-01-11 13:44:32,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:32,966 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:44:32,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.833333333333332) internal successors, (125), 6 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:44:32,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:32,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:32,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:32,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:32,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:44:32,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2023-01-11 13:44:32,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:32,967 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:33,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:33,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:33,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:33,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:33,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:44:33,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-01-11 13:44:33,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:33,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-11 13:44:33,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-01-11 13:44:33,632 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:44:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:44:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1416405505, now seen corresponding path program 2 times [2023-01-11 13:44:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:44:33,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158080847] [2023-01-11 13:44:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:33,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:44:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:33,816 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 44 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2023-01-11 13:44:33,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:44:33,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158080847] [2023-01-11 13:44:33,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158080847] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 13:44:33,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708597365] [2023-01-11 13:44:33,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-11 13:44:33,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:44:33,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 13:44:33,821 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 13:44:33,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-11 13:44:33,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-11 13:44:33,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-11 13:44:33,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-11 13:44:33,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 13:44:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2023-01-11 13:44:34,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-01-11 13:44:34,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708597365] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-11 13:44:34,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-01-11 13:44:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-01-11 13:44:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748214898] [2023-01-11 13:44:34,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-11 13:44:34,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-11 13:44:34,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:44:34,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-11 13:44:34,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-01-11 13:44:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:34,125 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:44:34,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 4 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:44:34,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:34,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:34,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:34,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:34,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:44:34,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2023-01-11 13:44:34,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:34,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-11 13:44:34,125 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:44:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-01-11 13:44:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-11 13:44:34,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:34,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-01-11 13:44:34,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:44:34,929 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:44:34,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:44:34,930 INFO L85 PathProgramCache]: Analyzing trace with hash -105430239, now seen corresponding path program 3 times [2023-01-11 13:44:34,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:44:34,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657385557] [2023-01-11 13:44:34,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:34,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:44:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 88 proven. 99 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-01-11 13:44:35,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:44:35,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657385557] [2023-01-11 13:44:35,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657385557] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 13:44:35,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219486233] [2023-01-11 13:44:35,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-11 13:44:35,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:44:35,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 13:44:35,519 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 13:44:35,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-11 13:44:35,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-11 13:44:35,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-11 13:44:35,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 20 conjunts are in the unsatisfiable core [2023-01-11 13:44:35,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 13:44:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 97 proven. 10 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-01-11 13:44:36,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 13:44:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 22 proven. 85 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2023-01-11 13:44:36,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219486233] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 13:44:36,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 13:44:36,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12, 12] total 34 [2023-01-11 13:44:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132274040] [2023-01-11 13:44:36,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 13:44:36,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-01-11 13:44:36,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:44:36,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-01-11 13:44:36,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2023-01-11 13:44:36,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:36,611 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:44:36,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.617647058823529) internal successors, (259), 34 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:44:36,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:36,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:36,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:36,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:36,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:44:36,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2023-01-11 13:44:36,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:36,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-11 13:44:36,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:36,612 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:38,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:44:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-01-11 13:44:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-11 13:44:38,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:38,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-01-11 13:44:38,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-11 13:44:38,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:44:38,509 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:44:38,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:44:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash -429059419, now seen corresponding path program 4 times [2023-01-11 13:44:38,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:44:38,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581113432] [2023-01-11 13:44:38,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:38,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:44:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:39,553 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 119 proven. 100 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-11 13:44:39,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:44:39,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581113432] [2023-01-11 13:44:39,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581113432] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 13:44:39,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000911387] [2023-01-11 13:44:39,553 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-11 13:44:39,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:44:39,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 13:44:39,555 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 13:44:39,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-11 13:44:39,675 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-11 13:44:39,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-11 13:44:39,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-11 13:44:39,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 13:44:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 47 proven. 178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:44:41,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 13:44:42,346 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 170 proven. 46 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-11 13:44:42,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000911387] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 13:44:42,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 13:44:42,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 21] total 68 [2023-01-11 13:44:42,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186727920] [2023-01-11 13:44:42,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 13:44:42,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-01-11 13:44:42,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:44:42,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-01-11 13:44:42,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=3744, Unknown=0, NotChecked=0, Total=4556 [2023-01-11 13:44:42,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:42,351 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:44:42,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 6.970588235294118) internal successors, (474), 68 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:44:42,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:42,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:42,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:42,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:42,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:44:42,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2023-01-11 13:44:42,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:42,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-11 13:44:42,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:42,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-01-11 13:44:42,352 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:44:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:44:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:44:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:44:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:44:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2023-01-11 13:44:48,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-11 13:44:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:44:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-01-11 13:44:48,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-01-11 13:44:48,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-01-11 13:44:48,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:44:48,463 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:44:48,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:44:48,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2133071567, now seen corresponding path program 5 times [2023-01-11 13:44:48,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:44:48,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152221220] [2023-01-11 13:44:48,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:44:48,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:44:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:44:54,591 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 46 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:44:54,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:44:54,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152221220] [2023-01-11 13:44:54,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152221220] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 13:44:54,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769406774] [2023-01-11 13:44:54,592 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-11 13:44:54,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:44:54,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 13:44:54,593 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 13:44:54,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-11 13:44:54,763 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2023-01-11 13:44:54,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-11 13:44:54,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 132 conjunts are in the unsatisfiable core [2023-01-11 13:44:54,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 13:44:56,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-11 13:44:56,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-11 13:44:56,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-11 13:44:56,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-11 13:44:57,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-11 13:45:00,047 INFO L321 Elim1Store]: treesize reduction 465, result has 3.3 percent of original size [2023-01-11 13:45:00,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 130 treesize of output 48 [2023-01-11 13:45:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 11 proven. 313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:45:00,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 13:45:17,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 13:45:17,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 455 treesize of output 260 [2023-01-11 13:45:17,532 INFO L321 Elim1Store]: treesize reduction 276, result has 42.1 percent of original size [2023-01-11 13:45:17,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 1416 treesize of output 1520 [2023-01-11 13:45:17,817 INFO L321 Elim1Store]: treesize reduction 276, result has 42.1 percent of original size [2023-01-11 13:45:17,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 1320 treesize of output 1224 [2023-01-11 13:45:18,064 INFO L321 Elim1Store]: treesize reduction 276, result has 42.1 percent of original size [2023-01-11 13:45:18,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 1024 treesize of output 1076 [2023-01-11 13:45:18,352 INFO L321 Elim1Store]: treesize reduction 276, result has 42.1 percent of original size [2023-01-11 13:45:18,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 805 treesize of output 931 [2023-01-11 13:46:04,812 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 13:46:04,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 455 treesize of output 260 [2023-01-11 13:46:04,971 INFO L321 Elim1Store]: treesize reduction 456, result has 4.4 percent of original size [2023-01-11 13:46:04,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 2902 treesize of output 2730 [2023-01-11 13:46:05,179 INFO L321 Elim1Store]: treesize reduction 456, result has 4.4 percent of original size [2023-01-11 13:46:05,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 1320 treesize of output 1044 [2023-01-11 13:46:05,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:46:05,226 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,227 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,227 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,228 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,228 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:46:05,230 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,230 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,231 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,231 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,232 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,232 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:46:05,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:46:05,235 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,235 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,236 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,236 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:46:05,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:46:05,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 15 disjoint index pairs (out of 55 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 886 treesize of output 812 [2023-01-11 13:46:05,366 INFO L321 Elim1Store]: treesize reduction 456, result has 4.4 percent of original size [2023-01-11 13:46:05,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 55 case distinctions, treesize of input 879 treesize of output 751 [2023-01-11 13:46:08,734 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 11 proven. 313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:46:08,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769406774] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 13:46:08,735 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 13:46:08,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 45] total 133 [2023-01-11 13:46:08,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709052113] [2023-01-11 13:46:08,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 13:46:08,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 133 states [2023-01-11 13:46:08,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:46:08,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2023-01-11 13:46:08,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1784, Invalid=15744, Unknown=28, NotChecked=0, Total=17556 [2023-01-11 13:46:08,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:46:08,742 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:46:08,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 133 states, 133 states have (on average 4.345864661654136) internal successors, (578), 133 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:46:08,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:46:08,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:46:08,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:46:08,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:46:08,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:46:08,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2023-01-11 13:46:08,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:46:08,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-11 13:46:08,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:46:08,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2023-01-11 13:46:08,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2023-01-11 13:46:08,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:46:09,043 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse41 (* c_~back~0 4)) (.cse42 (* c_~front~0 4))) (let ((.cse21 (+ c_~queue~0.offset .cse42 4)) (.cse20 (+ c_~queue~0.offset .cse42)) (.cse22 (+ c_~queue~0.offset .cse41 8)) (.cse25 (+ c_~queue~0.offset .cse41 4)) (.cse19 (+ c_~queue~0.offset .cse42 12)) (.cse17 (+ c_~queue~0.offset .cse42 8)) (.cse23 (+ c_~queue~0.offset .cse41 12)) (.cse7 (select |c_#memory_int| c_~queue~0.base)) (.cse24 (+ c_~queue~0.offset .cse41))) (let ((.cse47 (+ c_~back~0 1)) (.cse79 (select .cse7 .cse24)) (.cse3 (select .cse7 .cse23)) (.cse81 (select .cse7 .cse17)) (.cse87 (select .cse7 .cse19)) (.cse18 (+ c_~queue~0.offset .cse42 16)) (.cse84 (select .cse7 .cse25)) (.cse83 (select .cse7 .cse22)) (.cse66 (select .cse7 .cse20)) (.cse82 (select .cse7 .cse21))) (let ((.cse11 (forall ((v_~back~0_87 Int)) (or (< v_~back~0_87 0) (< v_~back~0_87 (+ c_~back~0 2)) (not (= (+ (select .cse7 (+ c_~queue~0.offset (* 4 v_~back~0_87))) 1) 0)) (<= c_~n~0 v_~back~0_87)))) (.cse15 (let ((.cse89 (+ c_~sum~0 .cse66 .cse82))) (and (<= .cse89 1) (<= 0 .cse89)))) (.cse43 (not (= (+ .cse83 1) 0))) (.cse12 (not (= .cse84 1))) (.cse45 (+ c_~back~0 4)) (.cse4 (let ((.cse88 (+ c_~sum~0 .cse81 .cse66 .cse82 .cse87 (select .cse7 .cse18)))) (and (<= .cse88 1) (<= 0 .cse88)))) (.cse44 (not (= .cse3 1))) (.cse46 (let ((.cse86 (+ c_~sum~0 .cse81 .cse66 .cse82 .cse87))) (and (<= 0 .cse86) (<= .cse86 1)))) (.cse0 (let ((.cse85 (< c_~n~0 (+ c_~back~0 6)))) (and (or (and (<= 0 (+ c_~sum~0 1)) (= .cse42 .cse41)) .cse85) (or (<= c_~sum~0 0) .cse85)))) (.cse9 (+ c_~queue~0.offset 16 .cse41)) (.cse5 (not (= (+ .cse84 1) 0))) (.cse6 (not (= .cse83 1))) (.cse13 (let ((.cse80 (+ c_~sum~0 .cse81 .cse66 .cse82))) (and (<= 0 .cse80) (<= .cse80 1)))) (.cse50 (forall ((v_~back~0_87 Int)) (or (< v_~back~0_87 0) (< v_~back~0_87 (+ c_~back~0 3)) (not (= (+ (select .cse7 (+ c_~queue~0.offset (* 4 v_~back~0_87))) 1) 0)) (<= c_~n~0 v_~back~0_87)))) (.cse10 (not (= .cse79 1))) (.cse27 (<= c_~n~0 c_~back~0)) (.cse28 (< c_~back~0 0)) (.cse14 (not (= (+ .cse79 1) 0))) (.cse1 (<= .cse47 c_~front~0)) (.cse8 (+ c_~back~0 5)) (.cse2 (< c_~front~0 0))) (and (or .cse0 .cse1 (< (+ 6 |c_ULTIMATE.start_create_fresh_int_array_#t~post20#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2) (or (not (= (+ .cse3 1) 0)) .cse4 .cse1 .cse5 .cse6 (forall ((v_~back~0_87 Int)) (or (not (= (+ (select .cse7 (+ c_~queue~0.offset (* 4 v_~back~0_87))) 1) 0)) (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse8))) (not (= (select .cse7 .cse9) 1)) .cse2 .cse10) (or .cse0 .cse1 .cse2 (< 6 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or .cse11 .cse12 .cse13 .cse14) (or .cse15 .cse11 .cse12 .cse14) (or .cse1 .cse2 (and (forall ((v_ArrVal_344 (Array Int Int)) (v_~back~0_87 Int)) (or (forall ((v_ArrVal_345 (Array Int Int))) (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_345) c_~queue~0.base))) (or (not (= (+ (select .cse16 (+ c_~queue~0.offset (* 4 v_~back~0_87))) 1) 0)) (<= (+ (select .cse16 .cse17) c_~sum~0 (select .cse16 .cse18) (select .cse16 .cse19) (select .cse16 .cse20) (select .cse16 .cse21)) 1) (not (= (select .cse16 .cse22) 1)) (not (= (select .cse16 .cse9) 1)) (not (= (+ (select .cse16 .cse23) 1) 0)) (not (= (select .cse16 .cse24) 1)) (not (= (+ (select .cse16 .cse25) 1) 0))))) (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse8))) (forall ((v_ArrVal_344 (Array Int Int)) (v_~back~0_87 Int)) (or (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse8) (forall ((v_ArrVal_345 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_345) c_~queue~0.base))) (or (not (= (+ (select .cse26 (+ c_~queue~0.offset (* 4 v_~back~0_87))) 1) 0)) (not (= (select .cse26 .cse22) 1)) (not (= (select .cse26 .cse9) 1)) (not (= (+ (select .cse26 .cse23) 1) 0)) (not (= (select .cse26 .cse24) 1)) (not (= (+ (select .cse26 .cse25) 1) 0)) (<= 0 (+ (select .cse26 .cse17) c_~sum~0 (select .cse26 .cse18) (select .cse26 .cse19) (select .cse26 .cse20) (select .cse26 .cse21)))))))))) (or .cse15 .cse27 .cse28 .cse14) (or .cse1 (let ((.cse30 (+ .cse41 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse31 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse37 (+ 16 .cse41 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse38 (+ .cse41 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse32 (+ .cse42 16 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse33 (+ .cse42 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse34 (+ .cse42 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse35 (+ .cse42 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse36 (+ .cse42 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse39 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int)) (v_~back~0_87 Int)) (or (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse8) (forall ((v_ArrVal_345 (Array Int Int))) (let ((.cse29 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (+ (select .cse29 .cse30) 1) 0)) (not (= (+ (select .cse29 .cse31) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse29 .cse32) (select .cse29 .cse33) (select .cse29 .cse34) (select .cse29 .cse35) (select .cse29 .cse36))) (not (= (select .cse29 .cse37) 1)) (not (= (+ (select .cse29 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| (* 4 v_~back~0_87))) 1) 0)) (not (= (select .cse29 .cse38) 1)) (not (= (select .cse29 .cse39) 1))))))) (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int)) (v_~back~0_87 Int)) (or (forall ((v_ArrVal_345 (Array Int Int))) (let ((.cse40 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (+ (select .cse40 .cse30) 1) 0)) (not (= (+ (select .cse40 .cse31) 1) 0)) (not (= (select .cse40 .cse37) 1)) (not (= (+ (select .cse40 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| (* 4 v_~back~0_87))) 1) 0)) (not (= (select .cse40 .cse38) 1)) (<= (+ c_~sum~0 (select .cse40 .cse32) (select .cse40 .cse33) (select .cse40 .cse34) (select .cse40 .cse35) (select .cse40 .cse36)) 1) (not (= (select .cse40 .cse39) 1))))) (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse8))))) .cse2) (or .cse43 .cse12 .cse44 (forall ((v_~back~0_87 Int)) (or (< v_~back~0_87 0) (not (= (+ (select .cse7 (+ c_~queue~0.offset (* 4 v_~back~0_87))) 1) 0)) (< v_~back~0_87 .cse45) (<= c_~n~0 v_~back~0_87))) .cse46 .cse14) (or (forall ((v_~back~0_87 Int)) (or (< v_~back~0_87 0) (not (= (+ (select .cse7 (+ c_~queue~0.offset (* 4 v_~back~0_87))) 1) 0)) (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse47))) .cse15 .cse10) (or .cse43 .cse12 (forall ((v_~back~0_87 Int)) (or (not (= (+ (select .cse7 (+ c_~queue~0.offset (* 4 v_~back~0_87))) 1) 0)) (< v_~back~0_87 .cse45) (<= c_~n~0 v_~back~0_87))) .cse4 .cse44 (<= c_~back~0 c_~front~0) .cse14 .cse2) (or .cse1 (and (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int)) (v_~back~0_87 Int)) (or (forall ((v_ArrVal_345 (Array Int Int))) (let ((.cse48 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_345) c_~queue~0.base))) (or (not (= (+ (select .cse48 (+ c_~queue~0.offset (* 4 v_~back~0_87))) 1) 0)) (not (= (select .cse48 .cse22) 1)) (not (= (select .cse48 .cse24) 1)) (not (= (select .cse48 .cse9) 1)) (<= 0 (+ (select .cse48 .cse21) c_~sum~0 (select .cse48 .cse19) (select .cse48 .cse17) (select .cse48 .cse20) (select .cse48 .cse18))) (not (= (+ (select .cse48 .cse25) 1) 0)) (not (= (+ (select .cse48 .cse23) 1) 0))))) (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse8))) (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int)) (v_~back~0_87 Int)) (or (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse8) (forall ((v_ArrVal_345 (Array Int Int))) (let ((.cse49 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_345) c_~queue~0.base))) (or (not (= (+ (select .cse49 (+ c_~queue~0.offset (* 4 v_~back~0_87))) 1) 0)) (not (= (select .cse49 .cse22) 1)) (not (= (select .cse49 .cse24) 1)) (not (= (select .cse49 .cse9) 1)) (not (= (+ (select .cse49 .cse25) 1) 0)) (<= (+ (select .cse49 .cse21) c_~sum~0 (select .cse49 .cse19) (select .cse49 .cse17) (select .cse49 .cse20) (select .cse49 .cse18)) 1) (not (= (+ (select .cse49 .cse23) 1) 0)))))))) .cse2) (or (< (+ 6 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1 .cse2) (or .cse5 .cse46 .cse6 .cse50 .cse10) (or (< 6 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse1 .cse2) (or (let ((.cse52 (+ .cse41 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse53 (+ .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse54 (+ 16 .cse41 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse55 (+ .cse41 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse61 (+ .cse41 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse56 (+ .cse42 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse57 (+ .cse42 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse58 (+ .cse42 16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse59 (+ .cse42 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse60 (+ .cse42 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int)) (v_~back~0_87 Int)) (or (forall ((v_ArrVal_345 (Array Int Int))) (let ((.cse51 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse51 (+ (* 4 v_~back~0_87) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) 0)) (not (= (select .cse51 .cse52) 1)) (not (= (select .cse51 .cse53) 1)) (not (= (select .cse51 .cse54) 1)) (not (= (+ (select .cse51 .cse55) 1) 0)) (<= 0 (+ (select .cse51 .cse56) (select .cse51 .cse57) (select .cse51 .cse58) c_~sum~0 (select .cse51 .cse59) (select .cse51 .cse60))) (not (= (+ (select .cse51 .cse61) 1) 0))))) (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse8))) (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int)) (v_~back~0_87 Int)) (or (forall ((v_ArrVal_345 (Array Int Int))) (let ((.cse62 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (+ (select .cse62 (+ (* 4 v_~back~0_87) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1) 0)) (not (= (select .cse62 .cse52) 1)) (not (= (select .cse62 .cse53) 1)) (not (= (select .cse62 .cse54) 1)) (not (= (+ (select .cse62 .cse55) 1) 0)) (not (= (+ (select .cse62 .cse61) 1) 0)) (<= (+ (select .cse62 .cse56) (select .cse62 .cse57) (select .cse62 .cse58) c_~sum~0 (select .cse62 .cse59) (select .cse62 .cse60)) 1)))) (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse8))))) .cse1 .cse2) (or (and (forall ((v_~back~0_87 Int)) (or (forall ((v_ArrVal_345 (Array Int Int))) (let ((.cse63 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_345) c_~queue~0.base))) (or (<= (+ (select .cse63 .cse17) c_~sum~0 (select .cse63 .cse18) (select .cse63 .cse21) (select .cse63 .cse19) (select .cse63 .cse20)) 1) (not (= (select .cse63 .cse24) 1)) (not (= (+ (select .cse63 .cse23) 1) 0)) (not (= (select .cse63 .cse22) 1)) (not (= (+ (select .cse63 .cse25) 1) 0)) (not (= (select .cse63 .cse9) 1)) (not (= 0 (+ (select .cse63 (+ c_~queue~0.offset (* 4 v_~back~0_87))) 1)))))) (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse8))) (forall ((v_~back~0_87 Int)) (or (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse8) (forall ((v_ArrVal_345 (Array Int Int))) (let ((.cse64 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_345) c_~queue~0.base))) (or (not (= (select .cse64 .cse24) 1)) (not (= (+ (select .cse64 .cse23) 1) 0)) (not (= (select .cse64 .cse22) 1)) (not (= (+ (select .cse64 .cse25) 1) 0)) (not (= (select .cse64 .cse9) 1)) (not (= 0 (+ (select .cse64 (+ c_~queue~0.offset (* 4 v_~back~0_87))) 1))) (<= 0 (+ (select .cse64 .cse17) c_~sum~0 (select .cse64 .cse18) (select .cse64 .cse21) (select .cse64 .cse19) (select .cse64 .cse20))))))))) .cse1 .cse2) (or .cse5 .cse6 .cse13 .cse50 .cse10) (or .cse27 (let ((.cse65 (+ c_~sum~0 .cse66))) (and (<= .cse65 1) (<= 0 .cse65))) .cse28 .cse14) (or .cse1 (let ((.cse73 (+ .cse41 8 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse74 (+ .cse41 |c_ULTIMATE.start_main_#t~ret9#1.offset| 4)) (.cse75 (+ .cse41 12 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse76 (+ .cse41 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse68 (+ .cse42 16 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse69 (+ .cse42 8 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse70 (+ .cse42 |c_ULTIMATE.start_main_#t~ret9#1.offset| 4)) (.cse71 (+ .cse42 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse72 (+ .cse42 12 |c_ULTIMATE.start_main_#t~ret9#1.offset|)) (.cse77 (+ 16 .cse41 |c_ULTIMATE.start_main_#t~ret9#1.offset|))) (and (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int)) (v_~back~0_87 Int)) (or (forall ((v_ArrVal_345 (Array Int Int))) (let ((.cse67 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= 0 (+ (select .cse67 (+ |c_ULTIMATE.start_main_#t~ret9#1.offset| (* 4 v_~back~0_87))) 1))) (<= (+ c_~sum~0 (select .cse67 .cse68) (select .cse67 .cse69) (select .cse67 .cse70) (select .cse67 .cse71) (select .cse67 .cse72)) 1) (not (= (select .cse67 .cse73) 1)) (not (= (+ (select .cse67 .cse74) 1) 0)) (not (= (+ (select .cse67 .cse75) 1) 0)) (not (= (select .cse67 .cse76) 1)) (not (= (select .cse67 .cse77) 1))))) (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse8))) (forall ((v_ArrVal_344 (Array Int Int)) (v_ArrVal_343 (Array Int Int)) (v_~back~0_87 Int)) (or (<= c_~n~0 v_~back~0_87) (< v_~back~0_87 .cse8) (forall ((v_ArrVal_345 (Array Int Int))) (let ((.cse78 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_344) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_#t~ret9#1.base|))) (or (not (= 0 (+ (select .cse78 (+ |c_ULTIMATE.start_main_#t~ret9#1.offset| (* 4 v_~back~0_87))) 1))) (not (= (select .cse78 .cse73) 1)) (not (= (+ (select .cse78 .cse74) 1) 0)) (not (= (+ (select .cse78 .cse75) 1) 0)) (not (= (select .cse78 .cse76) 1)) (<= 0 (+ c_~sum~0 (select .cse78 .cse68) (select .cse78 .cse69) (select .cse78 .cse70) (select .cse78 .cse71) (select .cse78 .cse72))) (not (= (select .cse78 .cse77) 1))))))))) .cse2) (= c_~sum~0 0)))))) is different from false [2023-01-11 13:48:03,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:48:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:48:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:48:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:48:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:48:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2023-01-11 13:48:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:48:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-11 13:48:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:48:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-01-11 13:48:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2023-01-11 13:48:03,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 542 states. [2023-01-11 13:48:03,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-11 13:48:04,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-01-11 13:48:04,012 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:48:04,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:48:04,013 INFO L85 PathProgramCache]: Analyzing trace with hash 59734709, now seen corresponding path program 6 times [2023-01-11 13:48:04,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:48:04,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213159691] [2023-01-11 13:48:04,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:48:04,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:48:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:48:05,061 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 244 proven. 292 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-11 13:48:05,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:48:05,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213159691] [2023-01-11 13:48:05,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213159691] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 13:48:05,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167311184] [2023-01-11 13:48:05,061 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-11 13:48:05,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:48:05,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 13:48:05,065 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 13:48:05,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-11 13:48:05,920 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-01-11 13:48:05,920 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-11 13:48:05,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-11 13:48:05,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 13:48:07,104 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 355 proven. 175 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-11 13:48:07,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 13:48:08,219 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 264 proven. 266 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-01-11 13:48:08,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167311184] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 13:48:08,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 13:48:08,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 27] total 80 [2023-01-11 13:48:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976481624] [2023-01-11 13:48:08,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 13:48:08,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2023-01-11 13:48:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:48:08,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2023-01-11 13:48:08,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=5693, Unknown=0, NotChecked=0, Total=6320 [2023-01-11 13:48:08,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:48:08,224 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:48:08,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 7.5625) internal successors, (605), 80 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:48:08,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:48:08,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:48:08,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:48:08,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:48:08,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:48:08,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2023-01-11 13:48:08,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:48:08,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-11 13:48:08,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:48:08,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-01-11 13:48:08,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2023-01-11 13:48:08,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 542 states. [2023-01-11 13:48:08,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:48:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:48:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:48:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:48:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:48:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:48:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2023-01-11 13:48:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:48:15,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-11 13:48:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:48:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-01-11 13:48:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2023-01-11 13:48:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 542 states. [2023-01-11 13:48:15,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2023-01-11 13:48:16,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-11 13:48:16,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-11 13:48:16,201 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-11 13:48:16,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-01-11 13:48:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash 836327737, now seen corresponding path program 7 times [2023-01-11 13:48:16,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-11 13:48:16,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265501797] [2023-01-11 13:48:16,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-11 13:48:16,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-11 13:48:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:48:20,850 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 41 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:48:20,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-11 13:48:20,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265501797] [2023-01-11 13:48:20,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265501797] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-11 13:48:20,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583435319] [2023-01-11 13:48:20,851 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-11 13:48:20,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-11 13:48:20,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-11 13:48:20,852 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-11 13:48:20,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-11 13:48:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-11 13:48:21,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 181 conjunts are in the unsatisfiable core [2023-01-11 13:48:21,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-11 13:48:21,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-11 13:48:22,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-11 13:48:22,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-11 13:48:22,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-11 13:48:22,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-11 13:48:23,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-11 13:48:23,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-11 13:48:23,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-11 13:48:24,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-11 13:48:24,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-11 13:48:24,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-11 13:48:28,597 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:48:28,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,610 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:48:28,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,615 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:48:28,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,619 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:48:28,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,621 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:48:28,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-11 13:48:28,622 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:48:28,633 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 13:48:28,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 21 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 148 treesize of output 56 [2023-01-11 13:48:28,849 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 21 proven. 575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:48:28,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-11 13:49:20,878 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 13:49:20,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 1248 treesize of output 399 [2023-01-11 13:49:22,660 INFO L321 Elim1Store]: treesize reduction 294, result has 56.3 percent of original size [2023-01-11 13:49:22,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 7104 treesize of output 6986 [2023-01-11 13:49:22,842 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,870 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,888 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,895 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,896 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,896 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,908 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,919 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,919 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,920 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,920 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,932 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,955 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,962 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,963 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,963 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,964 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,970 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,971 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,977 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,978 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:22,978 INFO L217 Elim1Store]: Index analysis took 168 ms [2023-01-11 13:49:23,683 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 13:49:23,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 63 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 1322 treesize of output 1508 [2023-01-11 13:49:23,798 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,825 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,842 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,848 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,848 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,849 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,860 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,873 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,874 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,874 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,875 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,887 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,908 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,909 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,909 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,910 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,915 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,916 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,917 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,923 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,929 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-11 13:49:23,930 INFO L217 Elim1Store]: Index analysis took 162 ms [2023-01-11 13:49:24,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 13:49:24,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 63 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 28 case distinctions, treesize of input 1130 treesize of output 1412 [2023-01-11 13:49:26,239 INFO L321 Elim1Store]: treesize reduction 294, result has 56.3 percent of original size [2023-01-11 13:49:26,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 1225 treesize of output 1219 [2023-01-11 13:52:07,241 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-11 13:52:07,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 1248 treesize of output 399 [2023-01-11 13:52:07,809 INFO L321 Elim1Store]: treesize reduction 644, result has 4.3 percent of original size [2023-01-11 13:52:07,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 1716 treesize of output 1620 [2023-01-11 13:52:08,320 INFO L321 Elim1Store]: treesize reduction 644, result has 4.3 percent of original size [2023-01-11 13:52:08,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 1592 treesize of output 1236 [2023-01-11 13:52:08,734 INFO L321 Elim1Store]: treesize reduction 644, result has 4.3 percent of original size [2023-01-11 13:52:08,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 1208 treesize of output 1044 [2023-01-11 13:52:09,151 INFO L321 Elim1Store]: treesize reduction 644, result has 4.3 percent of original size [2023-01-11 13:52:09,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 91 case distinctions, treesize of input 937 treesize of output 869 [2023-01-11 13:52:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 15 proven. 581 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-11 13:52:18,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583435319] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-11 13:52:18,463 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-11 13:52:18,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 57, 59] total 158 [2023-01-11 13:52:18,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724802048] [2023-01-11 13:52:18,463 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-11 13:52:18,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 158 states [2023-01-11 13:52:18,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-11 13:52:18,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2023-01-11 13:52:18,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4720, Invalid=19794, Unknown=292, NotChecked=0, Total=24806 [2023-01-11 13:52:18,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:52:18,473 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-01-11 13:52:18,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 158 states, 158 states have (on average 4.525316455696203) internal successors, (715), 158 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 106 states. [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 107 states. [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 542 states. [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 123 states. [2023-01-11 13:52:18,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. Received shutdown request... [2023-01-11 13:57:32,290 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-11 13:57:32,290 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-11 13:57:32,290 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-11 13:57:33,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-01-11 13:57:33,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-11 13:57:33,491 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-11 13:57:33,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-01-11 13:57:33,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-01-11 13:57:33,576 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:236) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:391) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:230) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:202) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.SleepMapReduction.computeSuccessorWithBudget(SleepMapReduction.java:186) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.SleepMapReduction.internalSuccessors(SleepMapReduction.java:156) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:234) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.OptimisticBudget.checkIsSuccessful(OptimisticBudget.java:162) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.OptimisticBudget.isSuccessful(OptimisticBudget.java:151) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.OptimisticBudget.computeBudget(OptimisticBudget.java:130) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.CachedBudget.computeBudget(CachedBudget.java:69) at de.uni_freiburg.informatik.ultimate.automata.partialorder.multireduction.SleepMapReduction.internalSuccessors(SleepMapReduction.java:156) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:234) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:130) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.applyInternal(PartialOrderReductionFacade.java:355) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:327) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:466) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-01-11 13:57:33,579 INFO L158 Benchmark]: Toolchain (without parser) took 807652.67ms. Allocated memory was 177.2MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 136.5MB in the beginning and 1.1GB in the end (delta: -984.0MB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-01-11 13:57:33,579 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 177.2MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-01-11 13:57:33,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.01ms. Allocated memory is still 177.2MB. Free memory was 136.1MB in the beginning and 124.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-01-11 13:57:33,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.00ms. Allocated memory is still 177.2MB. Free memory was 124.6MB in the beginning and 122.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-01-11 13:57:33,580 INFO L158 Benchmark]: Boogie Preprocessor took 40.07ms. Allocated memory is still 177.2MB. Free memory was 122.5MB in the beginning and 120.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-01-11 13:57:33,580 INFO L158 Benchmark]: RCFGBuilder took 514.57ms. Allocated memory is still 177.2MB. Free memory was 120.8MB in the beginning and 98.8MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-01-11 13:57:33,580 INFO L158 Benchmark]: TraceAbstraction took 806825.89ms. Allocated memory was 177.2MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 98.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. [2023-01-11 13:57:33,581 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.12ms. Allocated memory is still 177.2MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.01ms. Allocated memory is still 177.2MB. Free memory was 136.1MB in the beginning and 124.6MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.00ms. Allocated memory is still 177.2MB. Free memory was 124.6MB in the beginning and 122.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.07ms. Allocated memory is still 177.2MB. Free memory was 122.5MB in the beginning and 120.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 514.57ms. Allocated memory is still 177.2MB. Free memory was 120.8MB in the beginning and 98.8MB in the end (delta: 22.0MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 806825.89ms. Allocated memory was 177.2MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 98.0MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown