./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c642b478618f67be61772197bb614a61e988cb880f57faee5dd0470714f61e7e --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 13:02:43,083 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 13:02:43,085 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 13:02:43,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 13:02:43,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 13:02:43,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 13:02:43,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 13:02:43,106 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 13:02:43,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 13:02:43,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 13:02:43,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 13:02:43,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 13:02:43,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 13:02:43,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 13:02:43,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 13:02:43,112 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 13:02:43,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 13:02:43,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 13:02:43,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 13:02:43,115 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 13:02:43,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 13:02:43,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 13:02:43,123 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 13:02:43,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 13:02:43,126 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 13:02:43,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 13:02:43,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 13:02:43,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 13:02:43,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 13:02:43,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 13:02:43,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 13:02:43,129 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 13:02:43,130 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 13:02:43,130 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 13:02:43,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 13:02:43,131 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 13:02:43,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 13:02:43,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 13:02:43,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 13:02:43,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 13:02:43,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 13:02:43,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-09-01 13:02:43,150 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 13:02:43,150 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 13:02:43,151 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 13:02:43,151 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 13:02:43,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 13:02:43,151 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 13:02:43,152 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 13:02:43,152 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 13:02:43,152 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 13:02:43,152 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 13:02:43,153 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 13:02:43,153 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 13:02:43,153 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 13:02:43,153 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 13:02:43,153 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-09-01 13:02:43,153 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 13:02:43,154 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-09-01 13:02:43,154 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 13:02:43,154 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-09-01 13:02:43,154 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 13:02:43,154 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-09-01 13:02:43,154 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 13:02:43,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 13:02:43,155 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 13:02:43,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:02:43,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 13:02:43,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 13:02:43,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-09-01 13:02:43,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 13:02:43,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 13:02:43,156 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 13:02:43,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-09-01 13:02:43,156 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 13:02:43,156 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 13:02:43,156 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 13:02:43,156 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c642b478618f67be61772197bb614a61e988cb880f57faee5dd0470714f61e7e 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 -> BEFORE [2023-09-01 13:02:43,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 13:02:43,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 13:02:43,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 13:02:43,408 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 13:02:43,408 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 13:02:43,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-09-01 13:02:44,329 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 13:02:44,486 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 13:02:44,486 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-09-01 13:02:44,495 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c19c3b12/e5ba3abbba3b4239a60914f4c076bf0e/FLAGeae506ced [2023-09-01 13:02:44,894 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c19c3b12/e5ba3abbba3b4239a60914f4c076bf0e [2023-09-01 13:02:44,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 13:02:44,898 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 13:02:44,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 13:02:44,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 13:02:44,901 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 13:02:44,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:02:44" (1/1) ... [2023-09-01 13:02:44,902 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d087ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:44, skipping insertion in model container [2023-09-01 13:02:44,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:02:44" (1/1) ... [2023-09-01 13:02:44,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 13:02:44,918 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 13:02:45,024 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-09-01 13:02:45,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:02:45,045 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 13:02:45,072 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-09-01 13:02:45,083 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 13:02:45,090 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:02:45,091 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-01 13:02:45,096 INFO L208 MainTranslator]: Completed translation [2023-09-01 13:02:45,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:45 WrapperNode [2023-09-01 13:02:45,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 13:02:45,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 13:02:45,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 13:02:45,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 13:02:45,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:45" (1/1) ... [2023-09-01 13:02:45,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:45" (1/1) ... [2023-09-01 13:02:45,139 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 146 [2023-09-01 13:02:45,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 13:02:45,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 13:02:45,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 13:02:45,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 13:02:45,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:45" (1/1) ... [2023-09-01 13:02:45,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:45" (1/1) ... [2023-09-01 13:02:45,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:45" (1/1) ... [2023-09-01 13:02:45,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:45" (1/1) ... [2023-09-01 13:02:45,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:45" (1/1) ... [2023-09-01 13:02:45,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:45" (1/1) ... [2023-09-01 13:02:45,178 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:45" (1/1) ... [2023-09-01 13:02:45,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:45" (1/1) ... [2023-09-01 13:02:45,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 13:02:45,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 13:02:45,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 13:02:45,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 13:02:45,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:45" (1/1) ... [2023-09-01 13:02:45,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 13:02:45,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:02:45,255 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-09-01 13:02:45,267 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-09-01 13:02:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 13:02:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 13:02:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 13:02:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 13:02:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 13:02:45,289 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 13:02:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 13:02:45,289 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 13:02:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 13:02:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-01 13:02:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-01 13:02:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-09-01 13:02:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 13:02:45,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 13:02:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 13:02:45,291 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 13:02:45,355 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 13:02:45,357 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 13:02:45,619 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 13:02:45,750 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 13:02:45,750 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-01 13:02:45,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:02:45 BoogieIcfgContainer [2023-09-01 13:02:45,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 13:02:45,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 13:02:45,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 13:02:45,755 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 13:02:45,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 01:02:44" (1/3) ... [2023-09-01 13:02:45,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d02785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:02:45, skipping insertion in model container [2023-09-01 13:02:45,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:02:45" (2/3) ... [2023-09-01 13:02:45,756 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31d02785 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:02:45, skipping insertion in model container [2023-09-01 13:02:45,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:02:45" (3/3) ... [2023-09-01 13:02:45,757 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-09-01 13:02:45,775 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-09-01 13:02:45,788 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 13:02:45,788 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-09-01 13:02:45,788 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 13:02:45,863 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-09-01 13:02:45,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 111 transitions, 238 flow [2023-09-01 13:02:45,947 INFO L130 PetriNetUnfolder]: 9/109 cut-off events. [2023-09-01 13:02:45,948 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 13:02:45,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 109 events. 9/109 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-09-01 13:02:45,952 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 111 transitions, 238 flow [2023-09-01 13:02:45,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 101 transitions, 214 flow [2023-09-01 13:02:45,958 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 13:02:45,968 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 101 transitions, 214 flow [2023-09-01 13:02:45,975 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 101 transitions, 214 flow [2023-09-01 13:02:45,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 101 transitions, 214 flow [2023-09-01 13:02:46,003 INFO L130 PetriNetUnfolder]: 9/101 cut-off events. [2023-09-01 13:02:46,007 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 13:02:46,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 101 events. 9/101 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2023-09-01 13:02:46,010 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-09-01 13:02:48,833 INFO L134 LiptonReduction]: Checked pairs total: 830 [2023-09-01 13:02:48,833 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-09-01 13:02:48,842 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 13:02:48,846 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@aaee735, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 13:02:48,846 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-09-01 13:02:48,850 INFO L130 PetriNetUnfolder]: 3/18 cut-off events. [2023-09-01 13:02:48,850 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-09-01 13:02:48,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:02:48,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:02:48,851 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 13:02:48,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:02:48,854 INFO L85 PathProgramCache]: Analyzing trace with hash 41387086, now seen corresponding path program 1 times [2023-09-01 13:02:48,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:02:48,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007710532] [2023-09-01 13:02:48,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:02:48,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:02:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:02:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:02:49,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:02:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007710532] [2023-09-01 13:02:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007710532] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:02:49,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:02:49,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 13:02:49,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513076102] [2023-09-01 13:02:49,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:02:49,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 13:02:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:02:49,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 13:02:49,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 13:02:49,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 208 [2023-09-01 13:02:49,149 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-09-01 13:02:49,149 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:02:49,149 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 208 [2023-09-01 13:02:49,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:02:49,221 INFO L130 PetriNetUnfolder]: 114/197 cut-off events. [2023-09-01 13:02:49,221 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-09-01 13:02:49,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 417 conditions, 197 events. 114/197 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 703 event pairs, 24 based on Foata normal form. 1/147 useless extension candidates. Maximal degree in co-relation 328. Up to 136 conditions per place. [2023-09-01 13:02:49,224 INFO L137 encePairwiseOnDemand]: 204/208 looper letters, 25 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2023-09-01 13:02:49,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 31 transitions, 141 flow [2023-09-01 13:02:49,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 13:02:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 13:02:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2023-09-01 13:02:49,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048076923076923 [2023-09-01 13:02:49,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2023-09-01 13:02:49,239 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2023-09-01 13:02:49,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:02:49,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2023-09-01 13:02:49,247 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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-09-01 13:02:49,250 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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-09-01 13:02:49,250 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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-09-01 13:02:49,251 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 50 flow. Second operand 3 states and 315 transitions. [2023-09-01 13:02:49,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 31 transitions, 141 flow [2023-09-01 13:02:49,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 31 transitions, 127 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-09-01 13:02:49,254 INFO L231 Difference]: Finished difference. Result has 22 places, 21 transitions, 61 flow [2023-09-01 13:02:49,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=22, PETRI_TRANSITIONS=21} [2023-09-01 13:02:49,259 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -1 predicate places. [2023-09-01 13:02:49,259 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 21 transitions, 61 flow [2023-09-01 13:02:49,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-09-01 13:02:49,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:02:49,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:02:49,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 13:02:49,263 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 13:02:49,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:02:49,263 INFO L85 PathProgramCache]: Analyzing trace with hash -370799563, now seen corresponding path program 1 times [2023-09-01 13:02:49,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:02:49,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209010608] [2023-09-01 13:02:49,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:02:49,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:02:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:02:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:02:49,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:02:49,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209010608] [2023-09-01 13:02:49,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209010608] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:02:49,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:02:49,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 13:02:49,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828818372] [2023-09-01 13:02:49,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:02:49,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 13:02:49,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:02:49,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 13:02:49,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 13:02:49,430 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 208 [2023-09-01 13:02:49,431 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 21 transitions, 61 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 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-09-01 13:02:49,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:02:49,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 208 [2023-09-01 13:02:49,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:02:49,511 INFO L130 PetriNetUnfolder]: 178/329 cut-off events. [2023-09-01 13:02:49,511 INFO L131 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2023-09-01 13:02:49,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 329 events. 178/329 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1385 event pairs, 83 based on Foata normal form. 0/265 useless extension candidates. Maximal degree in co-relation 276. Up to 207 conditions per place. [2023-09-01 13:02:49,513 INFO L137 encePairwiseOnDemand]: 203/208 looper letters, 39 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2023-09-01 13:02:49,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 44 transitions, 210 flow [2023-09-01 13:02:49,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 13:02:49,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 13:02:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 485 transitions. [2023-09-01 13:02:49,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46634615384615385 [2023-09-01 13:02:49,515 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 485 transitions. [2023-09-01 13:02:49,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 485 transitions. [2023-09-01 13:02:49,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:02:49,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 485 transitions. [2023-09-01 13:02:49,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 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-09-01 13:02:49,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-09-01 13:02:49,519 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-09-01 13:02:49,519 INFO L175 Difference]: Start difference. First operand has 22 places, 21 transitions, 61 flow. Second operand 5 states and 485 transitions. [2023-09-01 13:02:49,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 44 transitions, 210 flow [2023-09-01 13:02:49,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 44 transitions, 205 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 13:02:49,520 INFO L231 Difference]: Finished difference. Result has 28 places, 24 transitions, 86 flow [2023-09-01 13:02:49,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=24} [2023-09-01 13:02:49,521 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 5 predicate places. [2023-09-01 13:02:49,521 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 24 transitions, 86 flow [2023-09-01 13:02:49,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 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-09-01 13:02:49,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:02:49,521 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:02:49,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 13:02:49,522 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 13:02:49,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:02:49,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1378138269, now seen corresponding path program 1 times [2023-09-01 13:02:49,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:02:49,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779539898] [2023-09-01 13:02:49,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:02:49,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:02:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:02:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:02:49,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:02:49,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779539898] [2023-09-01 13:02:49,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779539898] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 13:02:49,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 13:02:49,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 13:02:49,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976181411] [2023-09-01 13:02:49,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:02:49,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 13:02:49,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:02:49,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 13:02:49,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-09-01 13:02:49,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 208 [2023-09-01 13:02:49,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 24 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 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-09-01 13:02:49,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:02:49,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 208 [2023-09-01 13:02:49,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:02:49,735 INFO L130 PetriNetUnfolder]: 132/246 cut-off events. [2023-09-01 13:02:49,735 INFO L131 PetriNetUnfolder]: For 50/57 co-relation queries the response was YES. [2023-09-01 13:02:49,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 246 events. 132/246 cut-off events. For 50/57 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 937 event pairs, 81 based on Foata normal form. 7/234 useless extension candidates. Maximal degree in co-relation 482. Up to 205 conditions per place. [2023-09-01 13:02:49,739 INFO L137 encePairwiseOnDemand]: 203/208 looper letters, 19 selfloop transitions, 2 changer transitions 16/38 dead transitions. [2023-09-01 13:02:49,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 38 transitions, 191 flow [2023-09-01 13:02:49,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 13:02:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 13:02:49,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 480 transitions. [2023-09-01 13:02:49,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-09-01 13:02:49,740 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 480 transitions. [2023-09-01 13:02:49,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 480 transitions. [2023-09-01 13:02:49,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:02:49,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 480 transitions. [2023-09-01 13:02:49,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.0) internal successors, (480), 5 states have internal predecessors, (480), 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-09-01 13:02:49,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-09-01 13:02:49,744 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-09-01 13:02:49,744 INFO L175 Difference]: Start difference. First operand has 28 places, 24 transitions, 86 flow. Second operand 5 states and 480 transitions. [2023-09-01 13:02:49,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 38 transitions, 191 flow [2023-09-01 13:02:49,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 38 transitions, 187 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-09-01 13:02:49,746 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 78 flow [2023-09-01 13:02:49,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-09-01 13:02:49,747 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 10 predicate places. [2023-09-01 13:02:49,750 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 78 flow [2023-09-01 13:02:49,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.0) internal successors, (460), 5 states have internal predecessors, (460), 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-09-01 13:02:49,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:02:49,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:02:49,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 13:02:49,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 13:02:49,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:02:49,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1007847617, now seen corresponding path program 1 times [2023-09-01 13:02:49,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:02:49,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030229119] [2023-09-01 13:02:49,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:02:49,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:02:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:02:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:02:49,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:02:49,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030229119] [2023-09-01 13:02:49,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030229119] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:02:49,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465694312] [2023-09-01 13:02:49,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:02:49,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:02:49,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:02:49,875 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-09-01 13:02:49,909 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-09-01 13:02:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:02:49,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-01 13:02:49,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:02:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:02:50,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:02:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:02:50,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465694312] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 13:02:50,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 13:02:50,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-09-01 13:02:50,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234447367] [2023-09-01 13:02:50,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:02:50,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 13:02:50,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:02:50,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 13:02:50,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-09-01 13:02:50,064 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 208 [2023-09-01 13:02:50,065 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 78 flow. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 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-09-01 13:02:50,065 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:02:50,065 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 208 [2023-09-01 13:02:50,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:02:50,112 INFO L130 PetriNetUnfolder]: 117/205 cut-off events. [2023-09-01 13:02:50,112 INFO L131 PetriNetUnfolder]: For 62/62 co-relation queries the response was YES. [2023-09-01 13:02:50,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 205 events. 117/205 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 696 event pairs, 35 based on Foata normal form. 16/220 useless extension candidates. Maximal degree in co-relation 522. Up to 112 conditions per place. [2023-09-01 13:02:50,113 INFO L137 encePairwiseOnDemand]: 202/208 looper letters, 23 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2023-09-01 13:02:50,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 161 flow [2023-09-01 13:02:50,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 13:02:50,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 13:02:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2023-09-01 13:02:50,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4394230769230769 [2023-09-01 13:02:50,114 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 457 transitions. [2023-09-01 13:02:50,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 457 transitions. [2023-09-01 13:02:50,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:02:50,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 457 transitions. [2023-09-01 13:02:50,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 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-09-01 13:02:50,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-09-01 13:02:50,118 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-09-01 13:02:50,118 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 78 flow. Second operand 5 states and 457 transitions. [2023-09-01 13:02:50,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 161 flow [2023-09-01 13:02:50,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 30 transitions, 143 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-09-01 13:02:50,119 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 91 flow [2023-09-01 13:02:50,119 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2023-09-01 13:02:50,120 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 6 predicate places. [2023-09-01 13:02:50,120 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 91 flow [2023-09-01 13:02:50,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 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-09-01 13:02:50,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:02:50,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:02:50,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-09-01 13:02:50,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:02:50,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 13:02:50,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:02:50,342 INFO L85 PathProgramCache]: Analyzing trace with hash 53783691, now seen corresponding path program 1 times [2023-09-01 13:02:50,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:02:50,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367086448] [2023-09-01 13:02:50,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:02:50,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:02:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:02:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:02:50,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:02:50,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367086448] [2023-09-01 13:02:50,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367086448] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:02:50,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913988750] [2023-09-01 13:02:50,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:02:50,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:02:50,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:02:50,433 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-09-01 13:02:50,506 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-09-01 13:02:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:02:50,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2023-09-01 13:02:50,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:02:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:02:50,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:02:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-09-01 13:02:50,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913988750] provided 1 perfect and 1 imperfect interpolant sequences [2023-09-01 13:02:50,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-09-01 13:02:50,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-09-01 13:02:50,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113724425] [2023-09-01 13:02:50,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 13:02:50,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-09-01 13:02:50,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:02:50,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-09-01 13:02:50,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-09-01 13:02:50,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 208 [2023-09-01 13:02:50,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 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-09-01 13:02:50,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:02:50,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 208 [2023-09-01 13:02:50,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:02:50,713 INFO L130 PetriNetUnfolder]: 94/169 cut-off events. [2023-09-01 13:02:50,713 INFO L131 PetriNetUnfolder]: For 123/141 co-relation queries the response was YES. [2023-09-01 13:02:50,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 169 events. 94/169 cut-off events. For 123/141 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 514 event pairs, 30 based on Foata normal form. 18/174 useless extension candidates. Maximal degree in co-relation 459. Up to 93 conditions per place. [2023-09-01 13:02:50,714 INFO L137 encePairwiseOnDemand]: 202/208 looper letters, 25 selfloop transitions, 6 changer transitions 0/32 dead transitions. [2023-09-01 13:02:50,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 32 transitions, 192 flow [2023-09-01 13:02:50,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 13:02:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 13:02:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2023-09-01 13:02:50,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4394230769230769 [2023-09-01 13:02:50,716 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 457 transitions. [2023-09-01 13:02:50,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 457 transitions. [2023-09-01 13:02:50,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:02:50,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 457 transitions. [2023-09-01 13:02:50,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 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-09-01 13:02:50,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-09-01 13:02:50,719 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 208.0) internal successors, (1248), 6 states have internal predecessors, (1248), 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-09-01 13:02:50,719 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 91 flow. Second operand 5 states and 457 transitions. [2023-09-01 13:02:50,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 32 transitions, 192 flow [2023-09-01 13:02:50,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 32 transitions, 182 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 13:02:50,721 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 111 flow [2023-09-01 13:02:50,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=111, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2023-09-01 13:02:50,721 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 9 predicate places. [2023-09-01 13:02:50,721 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 111 flow [2023-09-01 13:02:50,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.2) internal successors, (446), 5 states have internal predecessors, (446), 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-09-01 13:02:50,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:02:50,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:02:50,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-09-01 13:02:50,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:02:50,927 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 13:02:50,927 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:02:50,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1841708852, now seen corresponding path program 1 times [2023-09-01 13:02:50,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:02:50,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100642966] [2023-09-01 13:02:50,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:02:50,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:02:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:02:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:02:51,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 13:02:51,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100642966] [2023-09-01 13:02:51,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100642966] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 13:02:51,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028152823] [2023-09-01 13:02:51,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:02:51,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:02:51,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 13:02:51,494 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 13:02:51,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 13:02:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 13:02:51,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 58 conjunts are in the unsatisfiable core [2023-09-01 13:02:51,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 13:02:51,622 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-09-01 13:02:51,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-09-01 13:02:51,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-09-01 13:02:51,759 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-09-01 13:02:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 13:02:51,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 13:02:51,937 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int))) (<= c_~counter~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_133 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) c_~counter~0))) is different from false [2023-09-01 13:02:51,950 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int))) (<= |c_thread1Thread1of1ForFork0_~tmp~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_133 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) |c_thread1Thread1of1ForFork0_~tmp~0#1|))) is different from false [2023-09-01 13:02:52,016 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) c_~counter~0))) (and (forall ((v_ArrVal_133 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset) .cse0)) (forall ((v_ArrVal_133 (Array Int Int))) (<= .cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) c_~A~0.base) c_~A~0.offset))))) is different from false [2023-09-01 13:02:52,038 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (<= (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_133 (Array Int Int)) (v_ArrVal_132 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_132))) (<= (+ c_~counter~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_133) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) is different from false [2023-09-01 13:02:52,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:02:52,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2023-09-01 13:02:52,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 286 treesize of output 254 [2023-09-01 13:02:52,073 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 26 treesize of output 24 [2023-09-01 13:02:52,076 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 50 treesize of output 46 [2023-09-01 13:02:52,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-09-01 13:02:52,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 35 [2023-09-01 13:02:52,103 INFO L173 IndexEqualityManager]: detected equality via solver [2023-09-01 13:02:52,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2023-09-01 13:02:52,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-09-01 13:02:52,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028152823] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 13:02:52,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 13:02:52,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-09-01 13:02:52,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476365075] [2023-09-01 13:02:52,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 13:02:52,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-09-01 13:02:52,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 13:02:52,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-09-01 13:02:52,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=429, Unknown=7, NotChecked=180, Total=702 [2023-09-01 13:02:52,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 208 [2023-09-01 13:02:52,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 111 flow. Second operand has 27 states, 27 states have (on average 61.55555555555556) internal successors, (1662), 27 states have internal predecessors, (1662), 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-09-01 13:02:52,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 13:02:52,152 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 208 [2023-09-01 13:02:52,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 13:02:52,981 INFO L130 PetriNetUnfolder]: 339/599 cut-off events. [2023-09-01 13:02:52,981 INFO L131 PetriNetUnfolder]: For 572/572 co-relation queries the response was YES. [2023-09-01 13:02:52,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1988 conditions, 599 events. 339/599 cut-off events. For 572/572 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2408 event pairs, 12 based on Foata normal form. 2/600 useless extension candidates. Maximal degree in co-relation 1964. Up to 188 conditions per place. [2023-09-01 13:02:52,984 INFO L137 encePairwiseOnDemand]: 196/208 looper letters, 112 selfloop transitions, 45 changer transitions 2/159 dead transitions. [2023-09-01 13:02:52,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 159 transitions, 991 flow [2023-09-01 13:02:52,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-09-01 13:02:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-09-01 13:02:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1537 transitions. [2023-09-01 13:02:52,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32127926421404684 [2023-09-01 13:02:52,987 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1537 transitions. [2023-09-01 13:02:52,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1537 transitions. [2023-09-01 13:02:52,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 13:02:52,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1537 transitions. [2023-09-01 13:02:52,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 66.82608695652173) internal successors, (1537), 23 states have internal predecessors, (1537), 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-09-01 13:02:52,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 208.0) internal successors, (4992), 24 states have internal predecessors, (4992), 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-09-01 13:02:52,995 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 208.0) internal successors, (4992), 24 states have internal predecessors, (4992), 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-09-01 13:02:52,995 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 111 flow. Second operand 23 states and 1537 transitions. [2023-09-01 13:02:52,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 159 transitions, 991 flow [2023-09-01 13:02:52,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 159 transitions, 962 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-09-01 13:02:52,998 INFO L231 Difference]: Finished difference. Result has 62 places, 73 transitions, 575 flow [2023-09-01 13:02:52,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=575, PETRI_PLACES=62, PETRI_TRANSITIONS=73} [2023-09-01 13:02:52,999 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 39 predicate places. [2023-09-01 13:02:52,999 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 73 transitions, 575 flow [2023-09-01 13:02:53,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 61.55555555555556) internal successors, (1662), 27 states have internal predecessors, (1662), 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-09-01 13:02:53,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 13:02:53,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 13:02:53,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 13:02:53,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 13:02:53,205 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-09-01 13:02:53,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 13:02:53,206 INFO L85 PathProgramCache]: Analyzing trace with hash 269516194, now seen corresponding path program 2 times [2023-09-01 13:02:53,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 13:02:53,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218460755] [2023-09-01 13:02:53,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 13:02:53,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 13:02:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 13:02:53,248 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-01 13:02:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-01 13:02:53,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-01 13:02:53,301 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-09-01 13:02:53,301 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-09-01 13:02:53,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-09-01 13:02:53,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-09-01 13:02:53,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 13:02:53,303 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2023-09-01 13:02:53,306 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-09-01 13:02:53,306 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-09-01 13:02:53,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.09 01:02:53 BasicIcfg [2023-09-01 13:02:53,330 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-09-01 13:02:53,331 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-09-01 13:02:53,331 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-09-01 13:02:53,331 INFO L275 PluginConnector]: Witness Printer initialized [2023-09-01 13:02:53,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:02:45" (3/4) ... [2023-09-01 13:02:53,332 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-09-01 13:02:53,375 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-09-01 13:02:53,375 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-09-01 13:02:53,376 INFO L158 Benchmark]: Toolchain (without parser) took 8477.83ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 64.7MB in the beginning and 76.0MB in the end (delta: -11.2MB). Peak memory consumption was 59.8MB. Max. memory is 16.1GB. [2023-09-01 13:02:53,376 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 67.1MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 13:02:53,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.55ms. Allocated memory is still 88.1MB. Free memory was 64.6MB in the beginning and 52.7MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-09-01 13:02:53,377 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.00ms. Allocated memory is still 88.1MB. Free memory was 52.7MB in the beginning and 50.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-09-01 13:02:53,377 INFO L158 Benchmark]: Boogie Preprocessor took 45.23ms. Allocated memory is still 88.1MB. Free memory was 50.7MB in the beginning and 49.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2023-09-01 13:02:53,377 INFO L158 Benchmark]: RCFGBuilder took 566.30ms. Allocated memory is still 88.1MB. Free memory was 49.0MB in the beginning and 44.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2023-09-01 13:02:53,377 INFO L158 Benchmark]: TraceAbstraction took 7577.14ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 44.1MB in the beginning and 82.3MB in the end (delta: -38.2MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2023-09-01 13:02:53,377 INFO L158 Benchmark]: Witness Printer took 44.74ms. Allocated memory is still 157.3MB. Free memory was 82.3MB in the beginning and 76.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-09-01 13:02:53,378 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.14ms. Allocated memory is still 67.1MB. Free memory is still 45.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.55ms. Allocated memory is still 88.1MB. Free memory was 64.6MB in the beginning and 52.7MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.00ms. Allocated memory is still 88.1MB. Free memory was 52.7MB in the beginning and 50.7MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.23ms. Allocated memory is still 88.1MB. Free memory was 50.7MB in the beginning and 49.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 566.30ms. Allocated memory is still 88.1MB. Free memory was 49.0MB in the beginning and 44.7MB in the end (delta: 4.3MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * TraceAbstraction took 7577.14ms. Allocated memory was 88.1MB in the beginning and 157.3MB in the end (delta: 69.2MB). Free memory was 44.1MB in the beginning and 82.3MB in the end (delta: -38.2MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. * Witness Printer took 44.74ms. Allocated memory is still 157.3MB. Free memory was 82.3MB in the beginning and 76.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 99 PlacesBefore, 23 PlacesAfterwards, 101 TransitionsBefore, 19 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 4 ConcurrentYvCompositions, 6 ChoiceCompositions, 97 TotalNumberOfCompositions, 830 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 681, independent: 646, independent conditional: 0, independent unconditional: 646, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 299, independent: 291, independent conditional: 0, independent unconditional: 291, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 681, independent: 355, independent conditional: 0, independent unconditional: 355, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 299, unknown conditional: 0, unknown unconditional: 299] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; [L42] 0 int counter, N; [L75] 0 pthread_t t1, t2; [L77] 0 N = __VERIFIER_nondet_int() [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L97] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={3:0}, counter=0, i=0, size=1] [L97] COND TRUE 0 i < size [L98] 0 arr[i] = __VERIFIER_nondet_int() [L97] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={3:0}, counter=0, i=1, size=1] [L97] COND FALSE 0 !(i < size) [L100] 0 return arr; [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={3:0}, N=1, counter=0, pthread_create(&t1, 0, thread1, 0)=-2, t1={5:0}, t2={6:0}] [L82] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={3:0}, N=1, counter=0, pthread_create(&t2, 0, thread2, 0)=-1, t1={5:0}, t2={6:0}] [L83] 0 \read(t1) VAL [A={3:0}, N=1, \read(t1)=-2, counter=0, t1={5:0}, t2={6:0}] [L62] 2 int i=0; VAL [A={3:0}, N=1, counter=0, i=0] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L49] 1 int i=0; VAL [A={3:0}, N=1, counter=0, i=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L54] 1 counter = tmp [L49] 1 i++ VAL [A={3:0}, N=1, counter=-4, i=1, tmp=-4] [L49] COND FALSE 1 !(i