/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-13 10:18:07,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 10:18:07,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 10:18:07,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 10:18:07,095 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 10:18:07,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 10:18:07,100 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 10:18:07,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 10:18:07,106 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 10:18:07,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 10:18:07,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 10:18:07,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 10:18:07,113 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 10:18:07,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 10:18:07,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 10:18:07,116 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 10:18:07,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 10:18:07,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 10:18:07,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 10:18:07,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 10:18:07,119 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 10:18:07,124 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 10:18:07,125 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 10:18:07,126 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 10:18:07,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 10:18:07,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 10:18:07,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 10:18:07,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 10:18:07,136 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 10:18:07,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 10:18:07,137 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 10:18:07,137 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 10:18:07,138 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 10:18:07,138 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 10:18:07,139 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 10:18:07,139 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 10:18:07,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 10:18:07,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 10:18:07,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 10:18:07,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 10:18:07,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 10:18:07,143 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2022-12-13 10:18:07,166 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 10:18:07,166 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 10:18:07,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 10:18:07,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 10:18:07,167 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 10:18:07,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 10:18:07,168 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 10:18:07,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 10:18:07,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 10:18:07,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 10:18:07,169 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 10:18:07,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 10:18:07,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 10:18:07,169 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 10:18:07,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 10:18:07,169 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 10:18:07,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 10:18:07,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 10:18:07,170 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 10:18:07,170 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-13 10:18:07,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 10:18:07,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:18:07,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 10:18:07,170 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 10:18:07,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 10:18:07,170 INFO L138 SettingsManager]: * Use conditional commutativity for large block encoding in concurrent analysis=CONDITIONAL_CONJUNCTIVE [2022-12-13 10:18:07,170 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 10:18:07,171 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 10:18:07,171 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-13 10:18:07,171 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-13 10:18:07,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 10:18:07,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 10:18:07,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 10:18:07,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 10:18:07,463 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 10:18:07,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2022-12-13 10:18:08,467 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 10:18:08,678 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 10:18:08,678 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c [2022-12-13 10:18:08,684 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90c9cde8a/a5be0f2a5b1f433592807e9240d5b723/FLAGd1b43f331 [2022-12-13 10:18:08,693 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90c9cde8a/a5be0f2a5b1f433592807e9240d5b723 [2022-12-13 10:18:08,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 10:18:08,698 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-13 10:18:08,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 10:18:08,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 10:18:08,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 10:18:08,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:18:08" (1/1) ... [2022-12-13 10:18:08,709 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd731de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08, skipping insertion in model container [2022-12-13 10:18:08,709 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 10:18:08" (1/1) ... [2022-12-13 10:18:08,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 10:18:08,729 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 10:18:08,819 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c[2575,2588] [2022-12-13 10:18:08,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:18:08,828 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 10:18:08,841 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-subst.wvr.c[2575,2588] [2022-12-13 10:18:08,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 10:18:08,851 INFO L208 MainTranslator]: Completed translation [2022-12-13 10:18:08,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08 WrapperNode [2022-12-13 10:18:08,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 10:18:08,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 10:18:08,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 10:18:08,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 10:18:08,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08" (1/1) ... [2022-12-13 10:18:08,862 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08" (1/1) ... [2022-12-13 10:18:08,878 INFO L138 Inliner]: procedures = 23, calls = 31, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 167 [2022-12-13 10:18:08,878 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 10:18:08,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 10:18:08,879 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 10:18:08,879 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 10:18:08,883 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08" (1/1) ... [2022-12-13 10:18:08,884 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08" (1/1) ... [2022-12-13 10:18:08,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08" (1/1) ... [2022-12-13 10:18:08,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08" (1/1) ... [2022-12-13 10:18:08,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08" (1/1) ... [2022-12-13 10:18:08,891 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08" (1/1) ... [2022-12-13 10:18:08,892 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08" (1/1) ... [2022-12-13 10:18:08,893 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08" (1/1) ... [2022-12-13 10:18:08,894 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 10:18:08,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 10:18:08,895 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 10:18:08,895 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 10:18:08,895 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08" (1/1) ... [2022-12-13 10:18:08,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 10:18:08,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-13 10:18:08,917 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) [2022-12-13 10:18:08,922 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 [2022-12-13 10:18:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 10:18:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-13 10:18:08,944 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-13 10:18:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-13 10:18:08,944 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-13 10:18:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-13 10:18:08,944 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-13 10:18:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 10:18:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 10:18:08,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 10:18:08,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 10:18:08,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 10:18:08,945 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 10:18:08,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 10:18:08,946 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-13 10:18:09,040 INFO L236 CfgBuilder]: Building ICFG [2022-12-13 10:18:09,042 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 10:18:09,241 INFO L277 CfgBuilder]: Performing block encoding [2022-12-13 10:18:09,247 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 10:18:09,248 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 10:18:09,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:18:09 BoogieIcfgContainer [2022-12-13 10:18:09,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 10:18:09,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 10:18:09,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 10:18:09,253 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 10:18:09,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 10:18:08" (1/3) ... [2022-12-13 10:18:09,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61bad742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:18:09, skipping insertion in model container [2022-12-13 10:18:09,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 10:18:08" (2/3) ... [2022-12-13 10:18:09,254 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61bad742 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 10:18:09, skipping insertion in model container [2022-12-13 10:18:09,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 10:18:09" (3/3) ... [2022-12-13 10:18:09,255 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-subst.wvr.c [2022-12-13 10:18:09,266 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 10:18:09,267 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 10:18:09,267 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 10:18:09,325 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-13 10:18:09,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 191 places, 195 transitions, 414 flow [2022-12-13 10:18:09,414 INFO L130 PetriNetUnfolder]: 14/192 cut-off events. [2022-12-13 10:18:09,415 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:18:09,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 192 events. 14/192 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2022-12-13 10:18:09,426 INFO L82 GeneralOperation]: Start removeDead. Operand has 191 places, 195 transitions, 414 flow [2022-12-13 10:18:09,433 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 178 places, 182 transitions, 382 flow [2022-12-13 10:18:09,434 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:18:09,452 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 178 places, 182 transitions, 382 flow [2022-12-13 10:18:09,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 182 transitions, 382 flow [2022-12-13 10:18:09,513 INFO L130 PetriNetUnfolder]: 14/182 cut-off events. [2022-12-13 10:18:09,513 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:18:09,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 182 events. 14/182 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 358 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2022-12-13 10:18:09,520 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 178 places, 182 transitions, 382 flow [2022-12-13 10:18:09,520 INFO L226 LiptonReduction]: Number of co-enabled transitions 9384 [2022-12-13 10:18:14,662 INFO L241 LiptonReduction]: Total number of compositions: 166 [2022-12-13 10:18:14,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 10:18:14,679 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=REPEATED_LIPTON_PN, 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;@465e4c33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_CONJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-13 10:18:14,679 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 10:18:14,685 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-13 10:18:14,685 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-13 10:18:14,685 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:18:14,685 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:18:14,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:18:14,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:18:14,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1419328160, now seen corresponding path program 1 times [2022-12-13 10:18:14,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:18:14,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619608452] [2022-12-13 10:18:14,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:18:14,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:18:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:18:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:18:16,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:18:16,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619608452] [2022-12-13 10:18:16,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619608452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:18:16,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:18:16,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:18:16,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128604994] [2022-12-13 10:18:16,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:18:16,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:18:16,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:18:16,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:18:16,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:18:16,186 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 10:18:16,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 50 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-13 10:18:16,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:18:16,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 10:18:16,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:18:16,420 INFO L130 PetriNetUnfolder]: 38/100 cut-off events. [2022-12-13 10:18:16,420 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-13 10:18:16,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 100 events. 38/100 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 284 event pairs, 2 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 169. Up to 38 conditions per place. [2022-12-13 10:18:16,423 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 32 selfloop transitions, 6 changer transitions 7/45 dead transitions. [2022-12-13 10:18:16,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 228 flow [2022-12-13 10:18:16,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:18:16,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:18:16,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-13 10:18:16,432 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-13 10:18:16,433 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 50 flow. Second operand 6 states and 46 transitions. [2022-12-13 10:18:16,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 45 transitions, 228 flow [2022-12-13 10:18:16,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-13 10:18:16,440 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 71 flow [2022-12-13 10:18:16,441 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2022-12-13 10:18:16,444 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-13 10:18:16,444 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:18:16,444 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 71 flow [2022-12-13 10:18:16,447 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:18:16,447 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:18:16,447 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 71 flow [2022-12-13 10:18:16,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 71 flow [2022-12-13 10:18:16,460 INFO L130 PetriNetUnfolder]: 2/31 cut-off events. [2022-12-13 10:18:16,461 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-13 10:18:16,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 2/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 48. Up to 6 conditions per place. [2022-12-13 10:18:16,463 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 71 flow [2022-12-13 10:18:16,464 INFO L226 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-13 10:18:16,494 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [772] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse2 (= v_~length_2~0_In_9 0))) (let ((.cse3 (= v_~length_4~0_In_11 0)) (.cse0 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_10| 0)) (.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_10| 0)) (.cse4 (not .cse2))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~a#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_~b#1_In_3|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_3| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| |v_thread3Thread1of1ForFork0_minus_#res#1_In_1|) (or (and .cse0 .cse1 .cse2 (= (ite .cse3 0 1) v_~result_8~0_Out_10)) (and (= (+ v_~result_8~0_Out_10 1) 0) .cse0 .cse1 .cse3 .cse4))) (and (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483648)) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10| 2147483647) (not .cse3) .cse0 .cse1 (= v_~to_int_3~0_In_5 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|) .cse4 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6| v_~to_int_5~0_In_7) (= v_~result_8~0_Out_10 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_6| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_6| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|))))) InVars {~length_4~0=v_~length_4~0_In_11, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_1|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_3|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_1|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_3|, ~length_2~0=v_~length_2~0_In_9, ~to_int_5~0=v_~to_int_5~0_In_7, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_3|, ~to_int_3~0=v_~to_int_3~0_In_5, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_1|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_1|} OutVars{thread3Thread1of1ForFork0_#t~ret7#1=|v_thread3Thread1of1ForFork0_#t~ret7#1_Out_10|, thread3Thread1of1ForFork0_#t~ite8#1=|v_thread3Thread1of1ForFork0_#t~ite8#1_Out_10|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_6|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_10|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_10|, ~result_8~0=v_~result_8~0_Out_10, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_6|, ~to_int_5~0=v_~to_int_5~0_In_7, ~to_int_3~0=v_~to_int_3~0_In_5, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_6|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_10|, thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_Out_10|, ~length_4~0=v_~length_4~0_In_11, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_10|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_6|, ~length_2~0=v_~length_2~0_In_9, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_6|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~ret7#1, thread3Thread1of1ForFork0_#t~ite8#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~result_8~0, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~ite9#1, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [773] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse4 (= v_~length_0~0_In_11 0))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_10| 0)) (.cse1 (not .cse4)) (.cse2 (= v_~length_2~0_In_11 0)) (.cse3 (= |v_thread1Thread1of1ForFork1_#res#1.base_Out_10| 0))) (or (and (= v_~result_6~0_Out_10 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_10|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_6| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_6|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_6| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_6|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) .cse0 (<= 0 (+ v_~result_6~0_Out_10 2147483648)) (<= v_~result_6~0_Out_10 2147483647) .cse1 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not .cse2) .cse3 (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_6| v_~to_int_1~0_In_7) (= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_6| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_Out_6| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_10|)) (= v_~to_int_3~0_In_7 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_6|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_6| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_6|)) (and (= |v_thread1Thread1of1ForFork1_minus_#res#1_In_1| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_10|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_In_1| |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_6|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_In_3| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10|) (or (and .cse4 (= v_~result_6~0_Out_10 (ite .cse2 0 1)) .cse0 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= (+ v_~result_6~0_Out_10 1) 0))) (= |v_thread1Thread1of1ForFork1_minus_~b#1_In_3| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_6|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_In_1| |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_6|))))) InVars {thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_In_1|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_In_1|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_In_3|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, ~length_0~0=v_~length_0~0_In_11, ~length_2~0=v_~length_2~0_In_11, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_In_3|, ~to_int_3~0=v_~to_int_3~0_In_7, ~to_int_1~0=v_~to_int_1~0_In_7, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_Out_10|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_Out_10|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_10|, ~result_6~0=v_~result_6~0_Out_10, ~to_int_3~0=v_~to_int_3~0_In_7, ~to_int_1~0=v_~to_int_1~0_In_7, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_6|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_6|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_Out_10|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~length_0~0=v_~length_0~0_In_11, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_10|, ~length_2~0=v_~length_2~0_In_11, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_6|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, ~result_6~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-13 10:18:16,988 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:18:16,989 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 545 [2022-12-13 10:18:16,989 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 78 flow [2022-12-13 10:18:16,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-13 10:18:16,990 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:18:16,990 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:18:16,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 10:18:16,990 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:18:16,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:18:16,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1806110336, now seen corresponding path program 2 times [2022-12-13 10:18:16,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:18:16,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985914096] [2022-12-13 10:18:16,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:18:16,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:18:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:18:17,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:18:17,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:18:17,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985914096] [2022-12-13 10:18:17,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985914096] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:18:17,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:18:17,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:18:17,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033797535] [2022-12-13 10:18:17,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:18:17,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:18:17,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:18:17,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:18:17,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:18:17,798 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-13 10:18:17,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 78 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-13 10:18:17,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:18:17,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-13 10:18:17,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:18:18,005 INFO L130 PetriNetUnfolder]: 39/119 cut-off events. [2022-12-13 10:18:18,005 INFO L131 PetriNetUnfolder]: For 61/61 co-relation queries the response was YES. [2022-12-13 10:18:18,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 119 events. 39/119 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 433 event pairs, 6 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 319. Up to 60 conditions per place. [2022-12-13 10:18:18,006 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 29 selfloop transitions, 8 changer transitions 10/47 dead transitions. [2022-12-13 10:18:18,006 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 47 transitions, 244 flow [2022-12-13 10:18:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:18:18,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:18:18,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2022-12-13 10:18:18,007 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.46078431372549017 [2022-12-13 10:18:18,007 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 78 flow. Second operand 6 states and 47 transitions. [2022-12-13 10:18:18,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 47 transitions, 244 flow [2022-12-13 10:18:18,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 240 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 10:18:18,009 INFO L231 Difference]: Finished difference. Result has 35 places, 22 transitions, 110 flow [2022-12-13 10:18:18,009 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=35, PETRI_TRANSITIONS=22} [2022-12-13 10:18:18,009 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-13 10:18:18,010 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:18:18,010 INFO L89 Accepts]: Start accepts. Operand has 35 places, 22 transitions, 110 flow [2022-12-13 10:18:18,010 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:18:18,010 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:18:18,011 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 22 transitions, 110 flow [2022-12-13 10:18:18,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 22 transitions, 110 flow [2022-12-13 10:18:18,016 INFO L130 PetriNetUnfolder]: 1/42 cut-off events. [2022-12-13 10:18:18,016 INFO L131 PetriNetUnfolder]: For 40/44 co-relation queries the response was YES. [2022-12-13 10:18:18,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 42 events. 1/42 cut-off events. For 40/44 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 117 event pairs, 0 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 79. Up to 7 conditions per place. [2022-12-13 10:18:18,017 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 22 transitions, 110 flow [2022-12-13 10:18:18,017 INFO L226 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-13 10:18:18,033 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [773] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse4 (= v_~length_0~0_In_11 0))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_10| 0)) (.cse1 (not .cse4)) (.cse2 (= v_~length_2~0_In_11 0)) (.cse3 (= |v_thread1Thread1of1ForFork1_#res#1.base_Out_10| 0))) (or (and (= v_~result_6~0_Out_10 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_10|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_6| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_6|) (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_6|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_6| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_6|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) .cse0 (<= 0 (+ v_~result_6~0_Out_10 2147483648)) (<= v_~result_6~0_Out_10 2147483647) .cse1 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (not .cse2) .cse3 (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_6| v_~to_int_1~0_In_7) (= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_6| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_Out_6| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_10|)) (= v_~to_int_3~0_In_7 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_6|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_6| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_6|)) (and (= |v_thread1Thread1of1ForFork1_minus_#res#1_In_1| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_10|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_In_1| |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_6|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_In_3| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_6|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10|) (or (and .cse4 (= v_~result_6~0_Out_10 (ite .cse2 0 1)) .cse0 .cse3) (and .cse0 .cse1 .cse2 .cse3 (= (+ v_~result_6~0_Out_10 1) 0))) (= |v_thread1Thread1of1ForFork1_minus_~b#1_In_3| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_6|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_In_1| |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_6|))))) InVars {thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_In_1|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_In_1|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_In_3|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_In_1|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_1|, ~length_0~0=v_~length_0~0_In_11, ~length_2~0=v_~length_2~0_In_11, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_In_3|, ~to_int_3~0=v_~to_int_3~0_In_7, ~to_int_1~0=v_~to_int_1~0_In_7, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_1|} OutVars{thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_Out_10|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_Out_10|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_6|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_10|, ~result_6~0=v_~result_6~0_Out_10, ~to_int_3~0=v_~to_int_3~0_In_7, ~to_int_1~0=v_~to_int_1~0_In_7, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_6|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_6|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_Out_10|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_10|, ~length_0~0=v_~length_0~0_In_11, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_10|, ~length_2~0=v_~length_2~0_In_11, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_6|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_10|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, ~result_6~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [771] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse4 (= v_~length_0~0_In_9 0))) (let ((.cse3 (not .cse4)) (.cse0 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_10| 0)) (.cse2 (= v_~length_4~0_In_9 0)) (.cse1 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_10| 0))) (or (and (= |v_thread2Thread1of1ForFork2_minus_~b#1_Out_6| |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_6|) .cse0 (<= 0 (+ v_~result_7~0_Out_10 2147483648)) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_6| v_~to_int_1~0_In_5) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|) (= v_~result_7~0_Out_10 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_10|) .cse1 (not .cse2) .cse3 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_6| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_6|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_6| (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_6| 2147483647)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_6|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|) (<= v_~result_7~0_Out_10 2147483647) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_6| v_~to_int_5~0_In_5) (= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_6| (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_6| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_10|))) (and (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_1| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_10|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_3|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_6| |v_thread2Thread1of1ForFork2_minus_~a#1_In_3|) (or (and .cse0 (= (+ v_~result_7~0_Out_10 1) 0) .cse1 .cse3 .cse2) (and .cse0 (= v_~result_7~0_Out_10 (ite .cse2 0 1)) .cse1 .cse4)) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_6| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_1|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_Out_6| |v_thread2Thread1of1ForFork2_minus_~b#1_In_3|) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_6| |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_1|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10|))))) InVars {~length_4~0=v_~length_4~0_In_9, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_1|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_3|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_3|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_1|, ~length_0~0=v_~length_0~0_In_9, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_1|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_1|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_3|, ~to_int_5~0=v_~to_int_5~0_In_5, ~to_int_1~0=v_~to_int_1~0_In_5} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_10|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_6|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_10|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_6|, ~result_7~0=v_~result_7~0_Out_10, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_10|, ~to_int_5~0=v_~to_int_5~0_In_5, ~to_int_1~0=v_~to_int_1~0_In_5, ~length_4~0=v_~length_4~0_In_9, thread2Thread1of1ForFork2_#t~ret4#1=|v_thread2Thread1of1ForFork2_#t~ret4#1_Out_10|, thread2Thread1of1ForFork2_#t~ite5#1=|v_thread2Thread1of1ForFork2_#t~ite5#1_Out_10|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_10|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_6|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_6|, ~length_0~0=v_~length_0~0_In_9, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_6|, thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_Out_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~result_7~0, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork2_#t~ite5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~ite6#1] [2022-12-13 10:18:18,468 INFO L241 LiptonReduction]: Total number of compositions: 1 [2022-12-13 10:18:18,469 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 459 [2022-12-13 10:18:18,469 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 22 transitions, 117 flow [2022-12-13 10:18:18,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-13 10:18:18,469 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:18:18,470 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:18:18,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 10:18:18,470 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:18:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:18:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1734685865, now seen corresponding path program 1 times [2022-12-13 10:18:18,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:18:18,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284430175] [2022-12-13 10:18:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:18:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:18:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:18:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:18:19,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:18:19,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284430175] [2022-12-13 10:18:19,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284430175] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:18:19,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:18:19,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 10:18:19,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791487961] [2022-12-13 10:18:19,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:18:19,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 10:18:19,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:18:19,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 10:18:19,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 10:18:19,167 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-13 10:18:19,167 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 22 transitions, 117 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-12-13 10:18:19,167 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:18:19,167 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-13 10:18:19,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:18:19,307 INFO L130 PetriNetUnfolder]: 31/99 cut-off events. [2022-12-13 10:18:19,308 INFO L131 PetriNetUnfolder]: For 161/161 co-relation queries the response was YES. [2022-12-13 10:18:19,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 99 events. 31/99 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 326 event pairs, 6 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 324. Up to 61 conditions per place. [2022-12-13 10:18:19,310 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 25 selfloop transitions, 4 changer transitions 9/38 dead transitions. [2022-12-13 10:18:19,310 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 223 flow [2022-12-13 10:18:19,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 10:18:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 10:18:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-13 10:18:19,312 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-13 10:18:19,312 INFO L175 Difference]: Start difference. First operand has 35 places, 22 transitions, 117 flow. Second operand 5 states and 38 transitions. [2022-12-13 10:18:19,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 223 flow [2022-12-13 10:18:19,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 210 flow, removed 4 selfloop flow, removed 3 redundant places. [2022-12-13 10:18:19,315 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 78 flow [2022-12-13 10:18:19,315 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2022-12-13 10:18:19,316 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-13 10:18:19,316 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:18:19,316 INFO L89 Accepts]: Start accepts. Operand has 37 places, 18 transitions, 78 flow [2022-12-13 10:18:19,317 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:18:19,317 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:18:19,317 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 18 transitions, 78 flow [2022-12-13 10:18:19,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 18 transitions, 78 flow [2022-12-13 10:18:19,321 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-13 10:18:19,321 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-13 10:18:19,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 29 events. 0/29 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-13 10:18:19,321 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 18 transitions, 78 flow [2022-12-13 10:18:19,321 INFO L226 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-13 10:18:19,322 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:18:19,325 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 9 [2022-12-13 10:18:19,325 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 78 flow [2022-12-13 10:18:19,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 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) [2022-12-13 10:18:19,326 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:18:19,326 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:18:19,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 10:18:19,326 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:18:19,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:18:19,326 INFO L85 PathProgramCache]: Analyzing trace with hash -548879216, now seen corresponding path program 3 times [2022-12-13 10:18:19,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:18:19,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022960127] [2022-12-13 10:18:19,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:18:19,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:18:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:18:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:18:19,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:18:19,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022960127] [2022-12-13 10:18:19,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022960127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:18:19,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:18:19,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:18:19,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122615997] [2022-12-13 10:18:19,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:18:19,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:18:19,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:18:19,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:18:19,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:18:19,938 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 10:18:19,938 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 18 transitions, 78 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-13 10:18:19,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:18:19,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 10:18:19,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:18:20,121 INFO L130 PetriNetUnfolder]: 28/84 cut-off events. [2022-12-13 10:18:20,122 INFO L131 PetriNetUnfolder]: For 104/104 co-relation queries the response was YES. [2022-12-13 10:18:20,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 84 events. 28/84 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 242 event pairs, 2 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 278. Up to 37 conditions per place. [2022-12-13 10:18:20,122 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 23 selfloop transitions, 4 changer transitions 12/39 dead transitions. [2022-12-13 10:18:20,122 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 216 flow [2022-12-13 10:18:20,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:18:20,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:18:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-13 10:18:20,125 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-13 10:18:20,125 INFO L175 Difference]: Start difference. First operand has 34 places, 18 transitions, 78 flow. Second operand 6 states and 40 transitions. [2022-12-13 10:18:20,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 216 flow [2022-12-13 10:18:20,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 200 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-13 10:18:20,127 INFO L231 Difference]: Finished difference. Result has 35 places, 16 transitions, 63 flow [2022-12-13 10:18:20,127 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=63, PETRI_PLACES=35, PETRI_TRANSITIONS=16} [2022-12-13 10:18:20,128 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-13 10:18:20,128 WARN L178 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-13 10:18:20,128 INFO L89 Accepts]: Start accepts. Operand has 35 places, 16 transitions, 63 flow [2022-12-13 10:18:20,130 INFO L95 Accepts]: Finished accepts. [2022-12-13 10:18:20,130 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:18:20,130 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 16 transitions, 63 flow [2022-12-13 10:18:20,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 16 transitions, 63 flow [2022-12-13 10:18:20,133 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-13 10:18:20,133 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-13 10:18:20,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 16 events. 0/16 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-13 10:18:20,133 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 16 transitions, 63 flow [2022-12-13 10:18:20,133 INFO L226 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-13 10:18:20,134 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:18:20,134 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-13 10:18:20,134 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 16 transitions, 63 flow [2022-12-13 10:18:20,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-13 10:18:20,135 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-13 10:18:20,135 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 10:18:20,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 10:18:20,135 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 10:18:20,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 10:18:20,135 INFO L85 PathProgramCache]: Analyzing trace with hash 316705340, now seen corresponding path program 4 times [2022-12-13 10:18:20,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 10:18:20,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193413730] [2022-12-13 10:18:20,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 10:18:20,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 10:18:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 10:18:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 10:18:20,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 10:18:20,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193413730] [2022-12-13 10:18:20,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193413730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 10:18:20,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 10:18:20,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 10:18:20,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121290192] [2022-12-13 10:18:20,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 10:18:20,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 10:18:20,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 10:18:20,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 10:18:20,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 10:18:20,672 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-13 10:18:20,672 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 16 transitions, 63 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-13 10:18:20,672 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 10:18:20,672 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-13 10:18:20,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 10:18:20,953 INFO L130 PetriNetUnfolder]: 11/37 cut-off events. [2022-12-13 10:18:20,953 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-13 10:18:20,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 37 events. 11/37 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 127. Up to 12 conditions per place. [2022-12-13 10:18:20,953 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2022-12-13 10:18:20,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 137 flow [2022-12-13 10:18:20,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 10:18:20,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 10:18:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-12-13 10:18:20,954 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-13 10:18:20,954 INFO L175 Difference]: Start difference. First operand has 32 places, 16 transitions, 63 flow. Second operand 6 states and 27 transitions. [2022-12-13 10:18:20,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 137 flow [2022-12-13 10:18:20,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 120 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-13 10:18:20,955 INFO L231 Difference]: Finished difference. Result has 30 places, 0 transitions, 0 flow [2022-12-13 10:18:20,955 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=30, PETRI_TRANSITIONS=0} [2022-12-13 10:18:20,955 INFO L295 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-13 10:18:20,955 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-13 10:18:20,956 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 0 transitions, 0 flow [2022-12-13 10:18:20,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-13 10:18:20,956 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 10:18:20,956 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 10:18:20,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-13 10:18:20,956 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-13 10:18:20,956 INFO L226 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-13 10:18:20,956 INFO L241 LiptonReduction]: Total number of compositions: 0 [2022-12-13 10:18:20,957 INFO L158 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2 [2022-12-13 10:18:20,957 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-13 10:18:20,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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) [2022-12-13 10:18:20,959 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 10:18:20,959 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 10:18:20,959 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 10:18:20,959 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 10:18:20,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 10:18:20,959 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1] [2022-12-13 10:18:20,961 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 10:18:20,961 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 10:18:20,963 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 10:18:20 BasicIcfg [2022-12-13 10:18:20,963 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 10:18:20,963 INFO L158 Benchmark]: Toolchain (without parser) took 12265.97ms. Allocated memory was 180.4MB in the beginning and 407.9MB in the end (delta: 227.5MB). Free memory was 156.9MB in the beginning and 168.0MB in the end (delta: -11.1MB). Peak memory consumption was 217.5MB. Max. memory is 8.0GB. [2022-12-13 10:18:20,964 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-13 10:18:20,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 146.04ms. Allocated memory is still 180.4MB. Free memory was 156.4MB in the beginning and 145.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-13 10:18:20,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.82ms. Allocated memory is still 180.4MB. Free memory was 145.3MB in the beginning and 143.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 10:18:20,964 INFO L158 Benchmark]: Boogie Preprocessor took 15.78ms. Allocated memory is still 180.4MB. Free memory was 143.2MB in the beginning and 141.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-13 10:18:20,964 INFO L158 Benchmark]: RCFGBuilder took 354.66ms. Allocated memory is still 180.4MB. Free memory was 141.7MB in the beginning and 123.8MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-13 10:18:20,964 INFO L158 Benchmark]: TraceAbstraction took 11712.18ms. Allocated memory was 180.4MB in the beginning and 407.9MB in the end (delta: 227.5MB). Free memory was 122.8MB in the beginning and 168.0MB in the end (delta: -45.2MB). Peak memory consumption was 182.9MB. Max. memory is 8.0GB. [2022-12-13 10:18:20,965 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 180.4MB. Free memory is still 157.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 146.04ms. Allocated memory is still 180.4MB. Free memory was 156.4MB in the beginning and 145.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.82ms. Allocated memory is still 180.4MB. Free memory was 145.3MB in the beginning and 143.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.78ms. Allocated memory is still 180.4MB. Free memory was 143.2MB in the beginning and 141.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 354.66ms. Allocated memory is still 180.4MB. Free memory was 141.7MB in the beginning and 123.8MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 11712.18ms. Allocated memory was 180.4MB in the beginning and 407.9MB in the end (delta: 227.5MB). Free memory was 122.8MB in the beginning and 168.0MB in the end (delta: -45.2MB). Peak memory consumption was 182.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 178 PlacesBefore, 26 PlacesAfterwards, 182 TransitionsBefore, 16 TransitionsAfterwards, 9384 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 53 TrivialYvCompositions, 99 ConcurrentYvCompositions, 14 ChoiceCompositions, 166 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6557, independent: 6557, independent conditional: 6557, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5858, independent: 5858, independent conditional: 0, independent unconditional: 5858, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5858, independent: 5858, independent conditional: 0, independent unconditional: 5858, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5858, independent: 5858, independent conditional: 0, independent unconditional: 5858, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6557, independent: 699, independent conditional: 699, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5858, unknown conditional: 5858, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 5968, Positive cache size: 5968, Positive conditional cache size: 5968, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 27 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 21 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 6, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 34 PlacesBefore, 35 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 11, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 11, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 11, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 11, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - PositiveResult [Line: 81]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 278 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 128 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 128 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 0 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=2, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 2345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-13 10:18:20,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...