/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 06:41:51,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 06:41:51,387 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 06:41:51,404 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 06:41:51,405 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 06:41:51,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 06:41:51,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 06:41:51,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 06:41:51,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 06:41:51,416 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 06:41:51,417 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 06:41:51,418 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 06:41:51,419 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 06:41:51,421 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 06:41:51,422 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 06:41:51,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 06:41:51,424 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 06:41:51,424 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 06:41:51,427 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 06:41:51,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 06:41:51,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 06:41:51,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 06:41:51,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 06:41:51,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 06:41:51,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 06:41:51,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 06:41:51,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 06:41:51,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 06:41:51,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 06:41:51,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 06:41:51,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 06:41:51,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 06:41:51,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 06:41:51,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 06:41:51,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 06:41:51,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 06:41:51,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 06:41:51,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 06:41:51,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 06:41:51,444 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 06:41:51,445 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 06:41:51,446 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-01-28 06:41:51,470 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 06:41:51,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 06:41:51,471 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 06:41:51,471 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 06:41:51,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 06:41:51,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 06:41:51,471 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 06:41:51,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 06:41:51,472 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 06:41:51,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 06:41:51,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 06:41:51,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 06:41:51,472 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 06:41:51,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 06:41:51,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 06:41:51,472 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 06:41:51,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 06:41:51,472 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 06:41:51,474 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 06:41:51,474 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 06:41:51,475 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 06:41:51,475 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 06:41:51,475 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 06:41:51,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:41:51,475 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 06:41:51,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 06:41:51,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 06:41:51,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 06:41:51,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 06:41:51,476 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 06:41:51,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 06:41:51,476 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 06:41:51,647 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 06:41:51,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 06:41:51,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 06:41:51,668 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 06:41:51,669 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 06:41:51,670 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-01-28 06:41:52,691 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 06:41:52,857 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 06:41:52,858 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i [2023-01-28 06:41:52,871 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d28e455a7/ac300b139f904631940b9a29c8b90b47/FLAGb41ffb32b [2023-01-28 06:41:52,882 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d28e455a7/ac300b139f904631940b9a29c8b90b47 [2023-01-28 06:41:52,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 06:41:52,885 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 06:41:52,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 06:41:52,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 06:41:52,888 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 06:41:52,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:41:52" (1/1) ... [2023-01-28 06:41:52,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb83b77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:52, skipping insertion in model container [2023-01-28 06:41:52,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 06:41:52" (1/1) ... [2023-01-28 06:41:52,894 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 06:41:52,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 06:41:53,104 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30687,30700] [2023-01-28 06:41:53,109 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:41:53,115 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 06:41:53,139 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/36_stack_cas_p0_vs_concur.i[30687,30700] [2023-01-28 06:41:53,140 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 06:41:53,179 INFO L208 MainTranslator]: Completed translation [2023-01-28 06:41:53,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:53 WrapperNode [2023-01-28 06:41:53,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 06:41:53,181 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 06:41:53,181 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 06:41:53,181 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 06:41:53,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:53" (1/1) ... [2023-01-28 06:41:53,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:53" (1/1) ... [2023-01-28 06:41:53,222 INFO L138 Inliner]: procedures = 170, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 102 [2023-01-28 06:41:53,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 06:41:53,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 06:41:53,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 06:41:53,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 06:41:53,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:53" (1/1) ... [2023-01-28 06:41:53,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:53" (1/1) ... [2023-01-28 06:41:53,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:53" (1/1) ... [2023-01-28 06:41:53,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:53" (1/1) ... [2023-01-28 06:41:53,269 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:53" (1/1) ... [2023-01-28 06:41:53,271 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:53" (1/1) ... [2023-01-28 06:41:53,272 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:53" (1/1) ... [2023-01-28 06:41:53,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:53" (1/1) ... [2023-01-28 06:41:53,274 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 06:41:53,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 06:41:53,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 06:41:53,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 06:41:53,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:53" (1/1) ... [2023-01-28 06:41:53,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 06:41:53,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:41:53,310 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-28 06:41:53,341 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-28 06:41:53,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 06:41:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-01-28 06:41:53,369 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-01-28 06:41:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 06:41:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 06:41:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 06:41:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 06:41:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 06:41:53,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 06:41:53,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 06:41:53,370 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 06:41:53,513 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 06:41:53,514 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 06:41:53,644 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 06:41:53,683 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 06:41:53,683 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-28 06:41:53,684 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:41:53 BoogieIcfgContainer [2023-01-28 06:41:53,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 06:41:53,686 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 06:41:53,686 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 06:41:53,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 06:41:53,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 06:41:52" (1/3) ... [2023-01-28 06:41:53,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e3b661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:41:53, skipping insertion in model container [2023-01-28 06:41:53,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 06:41:53" (2/3) ... [2023-01-28 06:41:53,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e3b661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 06:41:53, skipping insertion in model container [2023-01-28 06:41:53,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 06:41:53" (3/3) ... [2023-01-28 06:41:53,689 INFO L112 eAbstractionObserver]: Analyzing ICFG 36_stack_cas_p0_vs_concur.i [2023-01-28 06:41:53,700 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 06:41:53,700 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 06:41:53,701 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 06:41:53,760 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-01-28 06:41:53,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 91 transitions, 187 flow [2023-01-28 06:41:53,810 INFO L130 PetriNetUnfolder]: 10/101 cut-off events. [2023-01-28 06:41:53,810 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:41:53,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 101 events. 10/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. [2023-01-28 06:41:53,814 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 91 transitions, 187 flow [2023-01-28 06:41:53,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 85 places, 91 transitions, 187 flow [2023-01-28 06:41:53,818 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 06:41:53,824 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 91 transitions, 187 flow [2023-01-28 06:41:53,826 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 91 transitions, 187 flow [2023-01-28 06:41:53,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 85 places, 91 transitions, 187 flow [2023-01-28 06:41:53,843 INFO L130 PetriNetUnfolder]: 10/101 cut-off events. [2023-01-28 06:41:53,843 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:41:53,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 101 events. 10/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 118 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. [2023-01-28 06:41:53,845 INFO L119 LiptonReduction]: Number of co-enabled transitions 1612 [2023-01-28 06:41:55,085 INFO L134 LiptonReduction]: Checked pairs total: 2202 [2023-01-28 06:41:55,085 INFO L136 LiptonReduction]: Total number of compositions: 80 [2023-01-28 06:41:55,105 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 06:41:55,111 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=false, mAutomataTypeConcurrency=PETRI_NET, 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;@356684ce, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 06:41:55,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-01-28 06:41:55,118 INFO L130 PetriNetUnfolder]: 3/23 cut-off events. [2023-01-28 06:41:55,119 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:41:55,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:41:55,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:41:55,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:41:55,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:41:55,123 INFO L85 PathProgramCache]: Analyzing trace with hash -210271656, now seen corresponding path program 1 times [2023-01-28 06:41:55,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:41:55,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957905063] [2023-01-28 06:41:55,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:41:55,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:41:55,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:41:55,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:41:55,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:41:55,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957905063] [2023-01-28 06:41:55,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957905063] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:41:55,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:41:55,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 06:41:55,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533170590] [2023-01-28 06:41:55,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:41:55,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-01-28 06:41:55,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:41:55,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-01-28 06:41:55,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-01-28 06:41:55,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 171 [2023-01-28 06:41:55,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 28 transitions, 61 flow. Second operand has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 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-28 06:41:55,267 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:41:55,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 171 [2023-01-28 06:41:55,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:41:55,315 INFO L130 PetriNetUnfolder]: 34/84 cut-off events. [2023-01-28 06:41:55,315 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:41:55,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 84 events. 34/84 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 155 event pairs, 25 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 151. Up to 78 conditions per place. [2023-01-28 06:41:55,317 INFO L137 encePairwiseOnDemand]: 167/171 looper letters, 19 selfloop transitions, 0 changer transitions 0/23 dead transitions. [2023-01-28 06:41:55,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 89 flow [2023-01-28 06:41:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-01-28 06:41:55,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-01-28 06:41:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 181 transitions. [2023-01-28 06:41:55,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5292397660818714 [2023-01-28 06:41:55,326 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 181 transitions. [2023-01-28 06:41:55,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 181 transitions. [2023-01-28 06:41:55,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:41:55,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 181 transitions. [2023-01-28 06:41:55,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 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-28 06:41:55,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-28 06:41:55,333 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-28 06:41:55,334 INFO L175 Difference]: Start difference. First operand has 26 places, 28 transitions, 61 flow. Second operand 2 states and 181 transitions. [2023-01-28 06:41:55,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 89 flow [2023-01-28 06:41:55,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 89 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:41:55,336 INFO L231 Difference]: Finished difference. Result has 24 places, 23 transitions, 51 flow [2023-01-28 06:41:55,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=51, PETRI_PLACES=24, PETRI_TRANSITIONS=23} [2023-01-28 06:41:55,340 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2023-01-28 06:41:55,340 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 23 transitions, 51 flow [2023-01-28 06:41:55,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 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-28 06:41:55,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:41:55,341 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:41:55,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 06:41:55,341 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:41:55,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:41:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1467023127, now seen corresponding path program 1 times [2023-01-28 06:41:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:41:55,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773022889] [2023-01-28 06:41:55,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:41:55,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:41:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:41:55,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:41:55,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:41:55,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773022889] [2023-01-28 06:41:55,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773022889] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 06:41:55,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 06:41:55,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-01-28 06:41:55,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826883000] [2023-01-28 06:41:55,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 06:41:55,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-01-28 06:41:55,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:41:55,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-01-28 06:41:55,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2023-01-28 06:41:55,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 171 [2023-01-28 06:41:55,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 23 transitions, 51 flow. Second operand has 11 states, 11 states have (on average 49.45454545454545) internal successors, (544), 11 states have internal predecessors, (544), 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-28 06:41:55,983 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:41:55,983 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 171 [2023-01-28 06:41:55,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:41:56,273 INFO L130 PetriNetUnfolder]: 74/184 cut-off events. [2023-01-28 06:41:56,273 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-01-28 06:41:56,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 184 events. 74/184 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs, 2 based on Foata normal form. 0/171 useless extension candidates. Maximal degree in co-relation 369. Up to 87 conditions per place. [2023-01-28 06:41:56,275 INFO L137 encePairwiseOnDemand]: 157/171 looper letters, 40 selfloop transitions, 26 changer transitions 0/68 dead transitions. [2023-01-28 06:41:56,275 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 68 transitions, 273 flow [2023-01-28 06:41:56,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-28 06:41:56,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-28 06:41:56,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 740 transitions. [2023-01-28 06:41:56,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3091060985797828 [2023-01-28 06:41:56,282 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 740 transitions. [2023-01-28 06:41:56,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 740 transitions. [2023-01-28 06:41:56,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:41:56,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 740 transitions. [2023-01-28 06:41:56,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 52.857142857142854) internal successors, (740), 14 states have internal predecessors, (740), 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-28 06:41:56,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 171.0) internal successors, (2565), 15 states have internal predecessors, (2565), 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-28 06:41:56,290 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 171.0) internal successors, (2565), 15 states have internal predecessors, (2565), 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-28 06:41:56,291 INFO L175 Difference]: Start difference. First operand has 24 places, 23 transitions, 51 flow. Second operand 14 states and 740 transitions. [2023-01-28 06:41:56,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 68 transitions, 273 flow [2023-01-28 06:41:56,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 68 transitions, 273 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:41:56,292 INFO L231 Difference]: Finished difference. Result has 43 places, 50 transitions, 219 flow [2023-01-28 06:41:56,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=219, PETRI_PLACES=43, PETRI_TRANSITIONS=50} [2023-01-28 06:41:56,293 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2023-01-28 06:41:56,293 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 50 transitions, 219 flow [2023-01-28 06:41:56,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 49.45454545454545) internal successors, (544), 11 states have internal predecessors, (544), 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-28 06:41:56,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:41:56,294 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:41:56,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 06:41:56,294 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:41:56,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:41:56,294 INFO L85 PathProgramCache]: Analyzing trace with hash -361356833, now seen corresponding path program 1 times [2023-01-28 06:41:56,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:41:56,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627969092] [2023-01-28 06:41:56,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:41:56,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:41:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:41:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:41:56,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:41:56,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627969092] [2023-01-28 06:41:56,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627969092] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:41:56,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504984330] [2023-01-28 06:41:56,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:41:56,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:41:56,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:41:56,717 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 06:41:56,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 06:41:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:41:56,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 66 conjunts are in the unsatisfiable core [2023-01-28 06:41:56,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:41:56,893 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-28 06:41:56,943 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 06:41:56,943 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 11 treesize of output 11 [2023-01-28 06:41:57,011 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 11 treesize of output 7 [2023-01-28 06:41:57,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 06:41:57,262 INFO L321 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2023-01-28 06:41:57,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 25 [2023-01-28 06:41:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:41:57,305 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:41:57,564 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_7| Int) (v_ArrVal_90 (Array Int Int))) (not (= 0 (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_90))) (store .cse1 |c_~#top~0.base| (store (select .cse1 |c_~#top~0.base|) |c_~#top~0.offset| (select (select .cse1 |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|)))))) (store .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_7| (store (select .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_7|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_~#top~0.base|) |c_~#top~0.offset|)))) is different from false [2023-01-28 06:41:57,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:41:57,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-01-28 06:41:57,604 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:41:57,605 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-01-28 06:41:57,677 INFO L321 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2023-01-28 06:41:57,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 1183 treesize of output 1146 [2023-01-28 06:41:57,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 357 treesize of output 341 [2023-01-28 06:41:57,824 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2023-01-28 06:41:57,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2023-01-28 06:41:57,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:41:57,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 810 treesize of output 774 [2023-01-28 06:41:57,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 293 treesize of output 277 [2023-01-28 06:41:57,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 17 [2023-01-28 06:41:58,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-01-28 06:41:58,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504984330] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 06:41:58,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 06:41:58,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 8] total 27 [2023-01-28 06:41:58,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208675305] [2023-01-28 06:41:58,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 06:41:58,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-01-28 06:41:58,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 06:41:58,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-01-28 06:41:58,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=653, Unknown=2, NotChecked=52, Total=812 [2023-01-28 06:41:58,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 171 [2023-01-28 06:41:58,100 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 50 transitions, 219 flow. Second operand has 29 states, 29 states have (on average 39.724137931034484) internal successors, (1152), 29 states have internal predecessors, (1152), 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-28 06:41:58,100 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 06:41:58,100 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 171 [2023-01-28 06:41:58,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 06:41:59,036 INFO L130 PetriNetUnfolder]: 97/268 cut-off events. [2023-01-28 06:41:59,036 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-01-28 06:41:59,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 761 conditions, 268 events. 97/268 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 867 event pairs, 0 based on Foata normal form. 1/252 useless extension candidates. Maximal degree in co-relation 751. Up to 82 conditions per place. [2023-01-28 06:41:59,038 INFO L137 encePairwiseOnDemand]: 156/171 looper letters, 63 selfloop transitions, 49 changer transitions 0/114 dead transitions. [2023-01-28 06:41:59,038 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 114 transitions, 651 flow [2023-01-28 06:41:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-28 06:41:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-28 06:41:59,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 782 transitions. [2023-01-28 06:41:59,041 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2540610786224821 [2023-01-28 06:41:59,041 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 782 transitions. [2023-01-28 06:41:59,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 782 transitions. [2023-01-28 06:41:59,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 06:41:59,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 782 transitions. [2023-01-28 06:41:59,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 43.44444444444444) internal successors, (782), 18 states have internal predecessors, (782), 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-28 06:41:59,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 171.0) internal successors, (3249), 19 states have internal predecessors, (3249), 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-28 06:41:59,046 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 171.0) internal successors, (3249), 19 states have internal predecessors, (3249), 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-28 06:41:59,046 INFO L175 Difference]: Start difference. First operand has 43 places, 50 transitions, 219 flow. Second operand 18 states and 782 transitions. [2023-01-28 06:41:59,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 114 transitions, 651 flow [2023-01-28 06:41:59,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 114 transitions, 651 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-01-28 06:41:59,050 INFO L231 Difference]: Finished difference. Result has 70 places, 78 transitions, 543 flow [2023-01-28 06:41:59,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=543, PETRI_PLACES=70, PETRI_TRANSITIONS=78} [2023-01-28 06:41:59,051 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 44 predicate places. [2023-01-28 06:41:59,051 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 78 transitions, 543 flow [2023-01-28 06:41:59,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 39.724137931034484) internal successors, (1152), 29 states have internal predecessors, (1152), 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-28 06:41:59,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 06:41:59,051 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 06:41:59,061 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 06:41:59,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:41:59,257 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-01-28 06:41:59,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 06:41:59,258 INFO L85 PathProgramCache]: Analyzing trace with hash -600021821, now seen corresponding path program 2 times [2023-01-28 06:41:59,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 06:41:59,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821836659] [2023-01-28 06:41:59,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 06:41:59,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 06:41:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 06:41:59,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:41:59,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 06:41:59,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821836659] [2023-01-28 06:41:59,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821836659] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 06:41:59,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23300262] [2023-01-28 06:41:59,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 06:41:59,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 06:41:59,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 06:41:59,751 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-28 06:41:59,778 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-28 06:41:59,821 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 06:41:59,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 06:41:59,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 67 conjunts are in the unsatisfiable core [2023-01-28 06:41:59,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 06:41:59,838 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-01-28 06:41:59,838 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 11 treesize of output 11 [2023-01-28 06:41:59,939 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 11 treesize of output 7 [2023-01-28 06:42:00,093 INFO L321 Elim1Store]: treesize reduction 50, result has 23.1 percent of original size [2023-01-28 06:42:00,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 35 treesize of output 25 [2023-01-28 06:42:00,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 06:42:00,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 06:42:00,153 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 06:42:00,158 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_160 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_160) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2023-01-28 06:42:00,184 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((v_ArrVal_160 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int)) (not (= 0 (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| |c_thr1Thread1of1ForFork0_push_#t~mem8#1|)))) (store .cse1 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select .cse1 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_160) |c_~#top~0.base|) |c_~#top~0.offset|))))) (or (forall ((v_ArrVal_160 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| v_ArrVal_153) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_160) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0)))) is different from false [2023-01-28 06:42:00,197 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse0 (= |c_thr1Thread1of1ForFork0_push_~oldTop~0#1| (select .cse2 |c_~#top~0.offset|)))) (and (or (not .cse0) (forall ((v_ArrVal_160 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int)) (not (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#top~0.base| (store .cse2 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse1 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select .cse1 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_160) |c_~#top~0.base|) |c_~#top~0.offset|) 0)))) (or (forall ((v_ArrVal_160 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| v_ArrVal_153) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_160) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse0)))) is different from false [2023-01-28 06:42:00,208 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#top~0.base|))) (let ((.cse2 (= |c_thr1Thread1of1ForFork0_push_#t~mem6#1| (select .cse1 |c_~#top~0.offset|)))) (and (or (forall ((v_ArrVal_160 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int)) (not (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_~#top~0.base| (store .cse1 |c_~#top~0.offset| (select (select |c_#memory_int| |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of1ForFork0_push_~#newTop~0#1.offset|))))) (store .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| (store (select .cse0 |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9|) |c_thr1Thread1of1ForFork0_push_~#ret~0#1.offset| 1))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_160) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) (not .cse2)) (or (forall ((v_ArrVal_160 (Array Int Int)) (v_ArrVal_153 (Array Int Int)) (|v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| Int)) (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread1of1ForFork0___VERIFIER_atomic_CAS_~r#1.base_9| v_ArrVal_153) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_160) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) .cse2)))) is different from false [2023-01-28 06:42:00,258 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:00,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2023-01-28 06:42:00,269 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:00,269 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 1 case distinctions, treesize of input 9 treesize of output 8 [2023-01-28 06:42:00,326 INFO L321 Elim1Store]: treesize reduction 27, result has 60.9 percent of original size [2023-01-28 06:42:00,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 127 [2023-01-28 06:42:00,417 INFO L321 Elim1Store]: treesize reduction 74, result has 46.0 percent of original size [2023-01-28 06:42:00,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 108 treesize of output 163 [2023-01-28 06:42:00,454 INFO L321 Elim1Store]: treesize reduction 40, result has 38.5 percent of original size [2023-01-28 06:42:00,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 132 treesize of output 129 [2023-01-28 06:42:00,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 74 treesize of output 72 [2023-01-28 06:42:00,684 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-01-28 06:42:00,684 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 166 treesize of output 166 [2023-01-28 06:42:00,738 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 06:42:00,739 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 20 treesize of output 14 [2023-01-28 06:42:00,752 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 06:42:00,752 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 8 treesize of output 4 [2023-01-28 06:42:00,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 170 treesize of output 164 [2023-01-28 06:42:00,974 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-01-28 06:42:00,975 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 166 treesize of output 166 [2023-01-28 06:42:01,036 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 06:42:01,037 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 8 treesize of output 4 [2023-01-28 06:42:01,456 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 06:42:01,467 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 83 [2023-01-28 06:42:01,493 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 06:42:01,493 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 76 treesize of output 70 [2023-01-28 06:42:01,579 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 06:42:01,579 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 8 treesize of output 4 [2023-01-28 06:42:01,595 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 06:42:01,596 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 8 treesize of output 4 [2023-01-28 06:42:01,604 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-01-28 06:42:01,619 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 06:42:01,619 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 76 treesize of output 70 [2023-01-28 06:45:14,827 WARN L222 SmtUtils]: Spent 3.22m on a formula simplification. DAG size of input: 961 DAG size of output: 220 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-01-28 06:45:14,828 INFO L321 Elim1Store]: treesize reduction 1653, result has 18.4 percent of original size [2023-01-28 06:45:14,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 25 stores, 20 select indices, 20 select index equivalence classes, 0 disjoint index pairs (out of 190 index pairs), introduced 45 new quantified variables, introduced 211 case distinctions, treesize of input 1824 treesize of output 1416 [2023-01-28 06:45:14,976 INFO L217 Elim1Store]: Index analysis took 111 ms Received shutdown request... [2023-01-28 06:56:38,351 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 06:56:38,351 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-28 06:56:39,358 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-28 06:56:39,552 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-28 06:56:39,562 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-28 06:56:39,564 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-01-28 06:56:39,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 06:56:39,564 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:332) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:188) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) 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) Caused by: 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.simplifyWithStatistics(SmtUtils.java:254) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:426) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) ... 54 more [2023-01-28 06:56:39,568 INFO L158 Benchmark]: Toolchain (without parser) took 886682.94ms. Allocated memory was 360.7MB in the beginning and 683.7MB in the end (delta: 323.0MB). Free memory was 298.0MB in the beginning and 490.6MB in the end (delta: -192.5MB). Peak memory consumption was 384.3MB. Max. memory is 16.0GB. [2023-01-28 06:56:39,568 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 360.7MB. Free memory is still 309.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 06:56:39,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.48ms. Allocated memory is still 360.7MB. Free memory was 297.8MB in the beginning and 278.3MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-01-28 06:56:39,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.41ms. Allocated memory is still 360.7MB. Free memory was 278.3MB in the beginning and 276.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 06:56:39,568 INFO L158 Benchmark]: Boogie Preprocessor took 51.94ms. Allocated memory was 360.7MB in the beginning and 566.2MB in the end (delta: 205.5MB). Free memory was 276.2MB in the beginning and 533.9MB in the end (delta: -257.7MB). Peak memory consumption was 8.6MB. Max. memory is 16.0GB. [2023-01-28 06:56:39,569 INFO L158 Benchmark]: RCFGBuilder took 409.62ms. Allocated memory is still 566.2MB. Free memory was 533.9MB in the beginning and 513.5MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-01-28 06:56:39,569 INFO L158 Benchmark]: TraceAbstraction took 885881.47ms. Allocated memory was 566.2MB in the beginning and 683.7MB in the end (delta: 117.4MB). Free memory was 513.5MB in the beginning and 490.6MB in the end (delta: 23.0MB). Peak memory consumption was 392.4MB. Max. memory is 16.0GB. [2023-01-28 06:56:39,570 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.09ms. Allocated memory is still 360.7MB. Free memory is still 309.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 294.48ms. Allocated memory is still 360.7MB. Free memory was 297.8MB in the beginning and 278.3MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 41.41ms. Allocated memory is still 360.7MB. Free memory was 278.3MB in the beginning and 276.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.94ms. Allocated memory was 360.7MB in the beginning and 566.2MB in the end (delta: 205.5MB). Free memory was 276.2MB in the beginning and 533.9MB in the end (delta: -257.7MB). Peak memory consumption was 8.6MB. Max. memory is 16.0GB. * RCFGBuilder took 409.62ms. Allocated memory is still 566.2MB. Free memory was 533.9MB in the beginning and 513.5MB in the end (delta: 20.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 885881.47ms. Allocated memory was 566.2MB in the beginning and 683.7MB in the end (delta: 117.4MB). Free memory was 513.5MB in the beginning and 490.6MB in the end (delta: 23.0MB). Peak memory consumption was 392.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 85 PlacesBefore, 26 PlacesAfterwards, 91 TransitionsBefore, 28 TransitionsAfterwards, 1612 CoEnabledTransitionPairs, 5 FixpointIterations, 14 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 4 ChoiceCompositions, 80 TotalNumberOfCompositions, 2202 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1663, independent: 1508, independent conditional: 0, independent unconditional: 1508, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 874, independent: 831, independent conditional: 0, independent unconditional: 831, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1663, independent: 677, independent conditional: 0, independent unconditional: 677, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 874, unknown conditional: 0, unknown unconditional: 874] , Statistics on independence cache: Total cache size (in pairs): 56, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:192) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown