/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-nzb-file-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 05:07:44,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 05:07:44,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 05:07:44,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 05:07:44,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 05:07:44,116 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 05:07:44,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 05:07:44,123 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 05:07:44,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 05:07:44,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 05:07:44,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 05:07:44,134 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 05:07:44,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 05:07:44,137 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 05:07:44,138 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 05:07:44,141 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 05:07:44,142 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 05:07:44,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 05:07:44,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 05:07:44,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 05:07:44,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 05:07:44,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 05:07:44,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 05:07:44,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 05:07:44,160 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 05:07:44,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 05:07:44,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 05:07:44,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 05:07:44,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 05:07:44,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 05:07:44,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 05:07:44,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 05:07:44,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 05:07:44,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 05:07:44,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 05:07:44,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 05:07:44,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 05:07:44,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 05:07:44,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 05:07:44,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 05:07:44,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 05:07:44,170 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-06 05:07:44,200 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 05:07:44,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 05:07:44,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 05:07:44,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 05:07:44,202 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 05:07:44,203 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 05:07:44,203 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 05:07:44,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 05:07:44,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 05:07:44,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 05:07:44,204 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 05:07:44,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 05:07:44,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 05:07:44,204 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 05:07:44,205 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 05:07:44,205 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 05:07:44,205 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 05:07:44,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 05:07:44,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 05:07:44,205 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 05:07:44,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 05:07:44,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:07:44,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 05:07:44,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 05:07:44,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 05:07:44,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 05:07:44,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 05:07:44,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 05:07:44,206 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-06 05:07:44,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 05:07:44,523 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 05:07:44,526 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 05:07:44,526 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 05:07:44,527 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 05:07:44,528 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2022-12-06 05:07:45,551 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 05:07:45,753 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 05:07:45,754 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-subst.wvr.c [2022-12-06 05:07:45,766 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc83c05bd/1eac391c5bd341478912c4d80a902811/FLAGbdfe10e17 [2022-12-06 05:07:45,786 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc83c05bd/1eac391c5bd341478912c4d80a902811 [2022-12-06 05:07:45,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 05:07:45,789 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 05:07:45,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 05:07:45,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 05:07:45,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 05:07:45,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:07:45" (1/1) ... [2022-12-06 05:07:45,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@787bc415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:45, skipping insertion in model container [2022-12-06 05:07:45,795 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:07:45" (1/1) ... [2022-12-06 05:07:45,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 05:07:45,832 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 05:07:46,042 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-nzb-file-subst.wvr.c[6501,6514] [2022-12-06 05:07:46,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:07:46,073 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 05:07:46,117 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-nzb-file-subst.wvr.c[6501,6514] [2022-12-06 05:07:46,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 05:07:46,133 INFO L208 MainTranslator]: Completed translation [2022-12-06 05:07:46,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:46 WrapperNode [2022-12-06 05:07:46,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 05:07:46,135 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 05:07:46,135 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 05:07:46,135 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 05:07:46,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:46" (1/1) ... [2022-12-06 05:07:46,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:46" (1/1) ... [2022-12-06 05:07:46,208 INFO L138 Inliner]: procedures = 26, calls = 76, calls flagged for inlining = 28, calls inlined = 42, statements flattened = 574 [2022-12-06 05:07:46,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 05:07:46,210 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 05:07:46,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 05:07:46,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 05:07:46,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:46" (1/1) ... [2022-12-06 05:07:46,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:46" (1/1) ... [2022-12-06 05:07:46,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:46" (1/1) ... [2022-12-06 05:07:46,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:46" (1/1) ... [2022-12-06 05:07:46,237 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:46" (1/1) ... [2022-12-06 05:07:46,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:46" (1/1) ... [2022-12-06 05:07:46,246 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:46" (1/1) ... [2022-12-06 05:07:46,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:46" (1/1) ... [2022-12-06 05:07:46,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 05:07:46,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 05:07:46,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 05:07:46,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 05:07:46,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:46" (1/1) ... [2022-12-06 05:07:46,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 05:07:46,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:07:46,283 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-06 05:07:46,317 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-06 05:07:46,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 05:07:46,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 05:07:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 05:07:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 05:07:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 05:07:46,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 05:07:46,347 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 05:07:46,347 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 05:07:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 05:07:46,348 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 05:07:46,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 05:07:46,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 05:07:46,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 05:07:46,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 05:07:46,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 05:07:46,354 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 05:07:46,504 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 05:07:46,506 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 05:07:47,277 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 05:07:47,292 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 05:07:47,292 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 05:07:47,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:47 BoogieIcfgContainer [2022-12-06 05:07:47,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 05:07:47,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 05:07:47,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 05:07:47,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 05:07:47,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:07:45" (1/3) ... [2022-12-06 05:07:47,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f173bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:07:47, skipping insertion in model container [2022-12-06 05:07:47,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:07:46" (2/3) ... [2022-12-06 05:07:47,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36f173bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:07:47, skipping insertion in model container [2022-12-06 05:07:47,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:07:47" (3/3) ... [2022-12-06 05:07:47,302 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-subst.wvr.c [2022-12-06 05:07:47,317 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 05:07:47,318 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 05:07:47,318 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 05:07:47,472 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 05:07:47,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 627 places, 690 transitions, 1404 flow [2022-12-06 05:07:47,789 INFO L130 PetriNetUnfolder]: 73/687 cut-off events. [2022-12-06 05:07:47,789 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:07:47,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 700 conditions, 687 events. 73/687 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2360 event pairs, 0 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 507. Up to 2 conditions per place. [2022-12-06 05:07:47,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 627 places, 690 transitions, 1404 flow [2022-12-06 05:07:47,833 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 614 places, 677 transitions, 1372 flow [2022-12-06 05:07:47,834 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:07:47,858 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 614 places, 677 transitions, 1372 flow [2022-12-06 05:07:47,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 614 places, 677 transitions, 1372 flow [2022-12-06 05:07:48,051 INFO L130 PetriNetUnfolder]: 73/677 cut-off events. [2022-12-06 05:07:48,051 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:07:48,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690 conditions, 677 events. 73/677 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2359 event pairs, 0 based on Foata normal form. 0/604 useless extension candidates. Maximal degree in co-relation 507. Up to 2 conditions per place. [2022-12-06 05:07:48,129 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 614 places, 677 transitions, 1372 flow [2022-12-06 05:07:48,130 INFO L188 LiptonReduction]: Number of co-enabled transitions 153384 [2022-12-06 05:08:16,248 INFO L203 LiptonReduction]: Total number of compositions: 632 [2022-12-06 05:08:16,261 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 05:08:16,266 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;@6af6681d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 05:08:16,266 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 05:08:16,275 INFO L130 PetriNetUnfolder]: 13/48 cut-off events. [2022-12-06 05:08:16,275 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 05:08:16,276 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:16,276 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:16,277 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-06 05:08:16,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash -759560692, now seen corresponding path program 1 times [2022-12-06 05:08:16,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:16,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119431015] [2022-12-06 05:08:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:16,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:16,725 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-06 05:08:16,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:16,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119431015] [2022-12-06 05:08:16,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119431015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:16,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:16,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-06 05:08:16,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136424691] [2022-12-06 05:08:16,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:16,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:08:16,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:16,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:08:16,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:08:16,750 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:16,751 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 49 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-06 05:08:16,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:16,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:16,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:17,425 INFO L130 PetriNetUnfolder]: 2776/3671 cut-off events. [2022-12-06 05:08:17,425 INFO L131 PetriNetUnfolder]: For 168/168 co-relation queries the response was YES. [2022-12-06 05:08:17,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7603 conditions, 3671 events. 2776/3671 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12995 event pairs, 1657 based on Foata normal form. 0/2552 useless extension candidates. Maximal degree in co-relation 7072. Up to 3669 conditions per place. [2022-12-06 05:08:17,443 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 46 selfloop transitions, 6 changer transitions 0/52 dead transitions. [2022-12-06 05:08:17,443 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 226 flow [2022-12-06 05:08:17,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:08:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:08:17,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-12-06 05:08:17,455 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3741496598639456 [2022-12-06 05:08:17,457 INFO L175 Difference]: Start difference. First operand has 46 places, 49 transitions, 116 flow. Second operand 3 states and 55 transitions. [2022-12-06 05:08:17,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 226 flow [2022-12-06 05:08:17,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 05:08:17,464 INFO L231 Difference]: Finished difference. Result has 43 places, 52 transitions, 136 flow [2022-12-06 05:08:17,466 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=43, PETRI_TRANSITIONS=52} [2022-12-06 05:08:17,470 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2022-12-06 05:08:17,470 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:17,471 INFO L89 Accepts]: Start accepts. Operand has 43 places, 52 transitions, 136 flow [2022-12-06 05:08:17,474 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:17,474 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:17,475 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 52 transitions, 136 flow [2022-12-06 05:08:17,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 52 transitions, 136 flow [2022-12-06 05:08:17,485 INFO L130 PetriNetUnfolder]: 13/52 cut-off events. [2022-12-06 05:08:17,485 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 05:08:17,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 52 events. 13/52 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 49. Up to 8 conditions per place. [2022-12-06 05:08:17,486 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 52 transitions, 136 flow [2022-12-06 05:08:17,486 INFO L188 LiptonReduction]: Number of co-enabled transitions 846 [2022-12-06 05:08:17,574 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:17,576 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 106 [2022-12-06 05:08:17,576 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 52 transitions, 136 flow [2022-12-06 05:08:17,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 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-06 05:08:17,577 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:17,577 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:17,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 05:08:17,577 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-06 05:08:17,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:17,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1800656135, now seen corresponding path program 1 times [2022-12-06 05:08:17,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:17,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420735380] [2022-12-06 05:08:17,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:17,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:17,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:17,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:08:17,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:17,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420735380] [2022-12-06 05:08:17,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420735380] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:08:17,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508250951] [2022-12-06 05:08:17,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:17,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:17,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:08:17,719 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:08:17,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-06 05:08:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:17,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-06 05:08:17,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:08:18,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:08:18,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:08:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 05:08:18,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508250951] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:08:18,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:08:18,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-12-06 05:08:18,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940150774] [2022-12-06 05:08:18,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:08:18,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:08:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:18,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:08:18,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:08:18,020 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:18,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 52 transitions, 136 flow. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 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-06 05:08:18,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:18,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:18,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:18,716 INFO L130 PetriNetUnfolder]: 2776/3680 cut-off events. [2022-12-06 05:08:18,716 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 05:08:18,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7497 conditions, 3680 events. 2776/3680 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13032 event pairs, 1657 based on Foata normal form. 6/2569 useless extension candidates. Maximal degree in co-relation 7448. Up to 3669 conditions per place. [2022-12-06 05:08:18,734 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 46 selfloop transitions, 15 changer transitions 0/61 dead transitions. [2022-12-06 05:08:18,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 294 flow [2022-12-06 05:08:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 05:08:18,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 05:08:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-12-06 05:08:18,737 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2022-12-06 05:08:18,737 INFO L175 Difference]: Start difference. First operand has 43 places, 52 transitions, 136 flow. Second operand 6 states and 70 transitions. [2022-12-06 05:08:18,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 294 flow [2022-12-06 05:08:18,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:08:18,739 INFO L231 Difference]: Finished difference. Result has 50 places, 61 transitions, 226 flow [2022-12-06 05:08:18,739 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=226, PETRI_PLACES=50, PETRI_TRANSITIONS=61} [2022-12-06 05:08:18,740 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2022-12-06 05:08:18,740 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:18,740 INFO L89 Accepts]: Start accepts. Operand has 50 places, 61 transitions, 226 flow [2022-12-06 05:08:18,742 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:18,742 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:18,742 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 61 transitions, 226 flow [2022-12-06 05:08:18,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 61 transitions, 226 flow [2022-12-06 05:08:18,764 INFO L130 PetriNetUnfolder]: 13/61 cut-off events. [2022-12-06 05:08:18,764 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-12-06 05:08:18,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 61 events. 13/61 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 91 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 50. Up to 17 conditions per place. [2022-12-06 05:08:18,766 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 61 transitions, 226 flow [2022-12-06 05:08:18,766 INFO L188 LiptonReduction]: Number of co-enabled transitions 846 [2022-12-06 05:08:18,768 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:18,770 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 30 [2022-12-06 05:08:18,771 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 61 transitions, 226 flow [2022-12-06 05:08:18,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 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-06 05:08:18,771 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:18,771 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:18,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 05:08:18,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:18,978 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-06 05:08:18,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:18,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1416607028, now seen corresponding path program 2 times [2022-12-06 05:08:18,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:18,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095878822] [2022-12-06 05:08:18,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:18,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:08:19,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:19,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095878822] [2022-12-06 05:08:19,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095878822] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:08:19,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80635543] [2022-12-06 05:08:19,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:08:19,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:19,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:08:19,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:08:19,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-06 05:08:19,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-06 05:08:19,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:08:19,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:08:19,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:08:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:08:20,296 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:08:20,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80635543] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:20,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:08:20,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2022-12-06 05:08:20,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248739592] [2022-12-06 05:08:20,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:20,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:08:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:20,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:08:20,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:08:20,298 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:20,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 61 transitions, 226 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 05:08:20,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:20,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:20,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:21,606 INFO L130 PetriNetUnfolder]: 3116/4199 cut-off events. [2022-12-06 05:08:21,606 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-12-06 05:08:21,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8577 conditions, 4199 events. 3116/4199 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 16257 event pairs, 1657 based on Foata normal form. 1/2930 useless extension candidates. Maximal degree in co-relation 8489. Up to 3599 conditions per place. [2022-12-06 05:08:21,626 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 99 selfloop transitions, 2 changer transitions 7/108 dead transitions. [2022-12-06 05:08:21,626 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 108 transitions, 548 flow [2022-12-06 05:08:21,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:08:21,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:08:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2022-12-06 05:08:21,628 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.39591836734693875 [2022-12-06 05:08:21,628 INFO L175 Difference]: Start difference. First operand has 50 places, 61 transitions, 226 flow. Second operand 5 states and 97 transitions. [2022-12-06 05:08:21,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 108 transitions, 548 flow [2022-12-06 05:08:21,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 108 transitions, 524 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-06 05:08:21,631 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 217 flow [2022-12-06 05:08:21,632 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=217, PETRI_PLACES=56, PETRI_TRANSITIONS=62} [2022-12-06 05:08:21,633 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2022-12-06 05:08:21,633 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:21,633 INFO L89 Accepts]: Start accepts. Operand has 56 places, 62 transitions, 217 flow [2022-12-06 05:08:21,635 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:21,636 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:21,636 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 62 transitions, 217 flow [2022-12-06 05:08:21,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 55 places, 62 transitions, 217 flow [2022-12-06 05:08:21,649 INFO L130 PetriNetUnfolder]: 12/78 cut-off events. [2022-12-06 05:08:21,650 INFO L131 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2022-12-06 05:08:21,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 78 events. 12/78 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 178 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 123. Up to 8 conditions per place. [2022-12-06 05:08:21,652 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 62 transitions, 217 flow [2022-12-06 05:08:21,652 INFO L188 LiptonReduction]: Number of co-enabled transitions 860 [2022-12-06 05:08:21,654 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:21,655 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 22 [2022-12-06 05:08:21,655 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 217 flow [2022-12-06 05:08:21,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 05:08:21,656 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:21,659 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:21,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 05:08:21,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-06 05:08:21,871 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-06 05:08:21,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:21,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1329956240, now seen corresponding path program 3 times [2022-12-06 05:08:21,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:21,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180979442] [2022-12-06 05:08:21,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:21,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:21,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:22,059 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:08:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:22,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180979442] [2022-12-06 05:08:22,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180979442] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:08:22,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037986430] [2022-12-06 05:08:22,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 05:08:22,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:22,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:08:22,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:08:22,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-06 05:08:22,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-06 05:08:22,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:08:22,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:08:22,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:08:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-12-06 05:08:23,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-06 05:08:23,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037986430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:23,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-06 05:08:23,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-12-06 05:08:23,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952059043] [2022-12-06 05:08:23,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:23,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:08:23,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:23,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:08:23,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-06 05:08:23,015 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:23,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 217 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 05:08:23,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:23,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:23,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:24,403 INFO L130 PetriNetUnfolder]: 3316/4549 cut-off events. [2022-12-06 05:08:24,403 INFO L131 PetriNetUnfolder]: For 701/701 co-relation queries the response was YES. [2022-12-06 05:08:24,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9787 conditions, 4549 events. 3316/4549 cut-off events. For 701/701 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18781 event pairs, 1919 based on Foata normal form. 1/3672 useless extension candidates. Maximal degree in co-relation 9755. Up to 4051 conditions per place. [2022-12-06 05:08:24,424 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 104 selfloop transitions, 3 changer transitions 7/114 dead transitions. [2022-12-06 05:08:24,424 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 114 transitions, 571 flow [2022-12-06 05:08:24,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:08:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:08:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 102 transitions. [2022-12-06 05:08:24,428 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4163265306122449 [2022-12-06 05:08:24,428 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 217 flow. Second operand 5 states and 102 transitions. [2022-12-06 05:08:24,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 114 transitions, 571 flow [2022-12-06 05:08:24,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 114 transitions, 562 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-06 05:08:24,434 INFO L231 Difference]: Finished difference. Result has 60 places, 63 transitions, 234 flow [2022-12-06 05:08:24,434 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=60, PETRI_TRANSITIONS=63} [2022-12-06 05:08:24,436 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 14 predicate places. [2022-12-06 05:08:24,436 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:24,436 INFO L89 Accepts]: Start accepts. Operand has 60 places, 63 transitions, 234 flow [2022-12-06 05:08:24,437 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:24,437 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:24,437 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 63 transitions, 234 flow [2022-12-06 05:08:24,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 234 flow [2022-12-06 05:08:24,451 INFO L130 PetriNetUnfolder]: 11/100 cut-off events. [2022-12-06 05:08:24,451 INFO L131 PetriNetUnfolder]: For 28/30 co-relation queries the response was YES. [2022-12-06 05:08:24,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 100 events. 11/100 cut-off events. For 28/30 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 314 event pairs, 0 based on Foata normal form. 0/84 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2022-12-06 05:08:24,452 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 63 transitions, 234 flow [2022-12-06 05:08:24,452 INFO L188 LiptonReduction]: Number of co-enabled transitions 892 [2022-12-06 05:08:24,455 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:24,457 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 21 [2022-12-06 05:08:24,457 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 63 transitions, 234 flow [2022-12-06 05:08:24,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 05:08:24,457 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:24,457 INFO L213 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:24,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 05:08:24,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:24,664 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-06 05:08:24,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:24,664 INFO L85 PathProgramCache]: Analyzing trace with hash 2032434040, now seen corresponding path program 4 times [2022-12-06 05:08:24,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:24,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802368545] [2022-12-06 05:08:24,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:24,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:08:24,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:24,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802368545] [2022-12-06 05:08:24,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802368545] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:08:24,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64077110] [2022-12-06 05:08:24,863 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 05:08:24,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:24,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:08:24,864 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:08:24,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-06 05:08:25,060 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 05:08:25,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:08:25,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 05:08:25,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:08:25,146 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:08:25,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:08:25,219 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-06 05:08:25,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64077110] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:08:25,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:08:25,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-06 05:08:25,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839281593] [2022-12-06 05:08:25,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:08:25,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:08:25,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:25,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:08:25,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:08:25,222 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:25,222 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 234 flow. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 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-06 05:08:25,222 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:25,222 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:25,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:26,112 INFO L130 PetriNetUnfolder]: 3315/4544 cut-off events. [2022-12-06 05:08:26,112 INFO L131 PetriNetUnfolder]: For 1833/1833 co-relation queries the response was YES. [2022-12-06 05:08:26,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10297 conditions, 4544 events. 3315/4544 cut-off events. For 1833/1833 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 18486 event pairs, 2136 based on Foata normal form. 1/3667 useless extension candidates. Maximal degree in co-relation 10263. Up to 4530 conditions per place. [2022-12-06 05:08:26,130 INFO L137 encePairwiseOnDemand]: 42/49 looper letters, 48 selfloop transitions, 18 changer transitions 0/66 dead transitions. [2022-12-06 05:08:26,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 66 transitions, 384 flow [2022-12-06 05:08:26,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:08:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:08:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 67 transitions. [2022-12-06 05:08:26,131 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.19533527696793002 [2022-12-06 05:08:26,131 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 234 flow. Second operand 7 states and 67 transitions. [2022-12-06 05:08:26,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 66 transitions, 384 flow [2022-12-06 05:08:26,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 66 transitions, 378 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-06 05:08:26,136 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 296 flow [2022-12-06 05:08:26,136 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=296, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2022-12-06 05:08:26,136 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 18 predicate places. [2022-12-06 05:08:26,137 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:26,137 INFO L89 Accepts]: Start accepts. Operand has 64 places, 66 transitions, 296 flow [2022-12-06 05:08:26,138 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:26,138 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:26,138 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 66 transitions, 296 flow [2022-12-06 05:08:26,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 64 places, 66 transitions, 296 flow [2022-12-06 05:08:26,152 INFO L130 PetriNetUnfolder]: 11/103 cut-off events. [2022-12-06 05:08:26,152 INFO L131 PetriNetUnfolder]: For 20/22 co-relation queries the response was YES. [2022-12-06 05:08:26,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 103 events. 11/103 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 338 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 171. Up to 11 conditions per place. [2022-12-06 05:08:26,153 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 66 transitions, 296 flow [2022-12-06 05:08:26,154 INFO L188 LiptonReduction]: Number of co-enabled transitions 892 [2022-12-06 05:08:26,155 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:26,156 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 19 [2022-12-06 05:08:26,156 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 296 flow [2022-12-06 05:08:26,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 16 states have internal predecessors, (37), 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-06 05:08:26,156 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:26,156 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:26,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-06 05:08:26,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:08:26,363 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:26,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:26,364 INFO L85 PathProgramCache]: Analyzing trace with hash 877729935, now seen corresponding path program 5 times [2022-12-06 05:08:26,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:26,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337766419] [2022-12-06 05:08:26,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:26,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:08:28,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:28,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337766419] [2022-12-06 05:08:28,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337766419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:28,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:28,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:08:28,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357047967] [2022-12-06 05:08:28,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:28,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:08:28,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:28,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:08:28,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:08:28,024 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:28,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 296 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 05:08:28,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:28,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:28,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:30,145 INFO L130 PetriNetUnfolder]: 8711/11837 cut-off events. [2022-12-06 05:08:30,145 INFO L131 PetriNetUnfolder]: For 1942/1942 co-relation queries the response was YES. [2022-12-06 05:08:30,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25353 conditions, 11837 events. 8711/11837 cut-off events. For 1942/1942 co-relation queries the response was YES. Maximal size of possible extension queue 489. Compared 58422 event pairs, 1312 based on Foata normal form. 1/9128 useless extension candidates. Maximal degree in co-relation 25240. Up to 4111 conditions per place. [2022-12-06 05:08:30,192 INFO L137 encePairwiseOnDemand]: 36/49 looper letters, 172 selfloop transitions, 44 changer transitions 1/217 dead transitions. [2022-12-06 05:08:30,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 217 transitions, 1100 flow [2022-12-06 05:08:30,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 05:08:30,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 05:08:30,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 198 transitions. [2022-12-06 05:08:30,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.577259475218659 [2022-12-06 05:08:30,194 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 296 flow. Second operand 7 states and 198 transitions. [2022-12-06 05:08:30,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 217 transitions, 1100 flow [2022-12-06 05:08:30,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 217 transitions, 1064 flow, removed 6 selfloop flow, removed 4 redundant places. [2022-12-06 05:08:30,203 INFO L231 Difference]: Finished difference. Result has 71 places, 112 transitions, 600 flow [2022-12-06 05:08:30,203 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=600, PETRI_PLACES=71, PETRI_TRANSITIONS=112} [2022-12-06 05:08:30,204 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 25 predicate places. [2022-12-06 05:08:30,204 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:30,204 INFO L89 Accepts]: Start accepts. Operand has 71 places, 112 transitions, 600 flow [2022-12-06 05:08:30,206 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:30,206 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:30,206 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 112 transitions, 600 flow [2022-12-06 05:08:30,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 112 transitions, 600 flow [2022-12-06 05:08:30,319 INFO L130 PetriNetUnfolder]: 311/737 cut-off events. [2022-12-06 05:08:30,320 INFO L131 PetriNetUnfolder]: For 458/493 co-relation queries the response was YES. [2022-12-06 05:08:30,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 737 events. 311/737 cut-off events. For 458/493 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 4522 event pairs, 8 based on Foata normal form. 2/597 useless extension candidates. Maximal degree in co-relation 1499. Up to 174 conditions per place. [2022-12-06 05:08:30,327 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 112 transitions, 600 flow [2022-12-06 05:08:30,328 INFO L188 LiptonReduction]: Number of co-enabled transitions 1974 [2022-12-06 05:08:30,376 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:08:30,377 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:08:30,377 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 112 transitions, 600 flow [2022-12-06 05:08:30,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 05:08:30,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:30,377 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:30,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 05:08:30,378 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:30,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1040886035, now seen corresponding path program 6 times [2022-12-06 05:08:30,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:30,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030178083] [2022-12-06 05:08:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:30,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:30,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:31,648 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:08:31,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:31,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030178083] [2022-12-06 05:08:31,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030178083] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:31,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:31,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:08:31,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965720131] [2022-12-06 05:08:31,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:31,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:08:31,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:31,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:08:31,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:08:31,650 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 50 [2022-12-06 05:08:31,650 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 112 transitions, 600 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 05:08:31,650 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:31,650 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 50 [2022-12-06 05:08:31,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:34,216 INFO L130 PetriNetUnfolder]: 11426/15543 cut-off events. [2022-12-06 05:08:34,216 INFO L131 PetriNetUnfolder]: For 10491/10491 co-relation queries the response was YES. [2022-12-06 05:08:34,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43560 conditions, 15543 events. 11426/15543 cut-off events. For 10491/10491 co-relation queries the response was YES. Maximal size of possible extension queue 604. Compared 78469 event pairs, 3269 based on Foata normal form. 1/12176 useless extension candidates. Maximal degree in co-relation 43460. Up to 7580 conditions per place. [2022-12-06 05:08:34,297 INFO L137 encePairwiseOnDemand]: 36/50 looper letters, 164 selfloop transitions, 55 changer transitions 2/221 dead transitions. [2022-12-06 05:08:34,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 221 transitions, 1476 flow [2022-12-06 05:08:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:08:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:08:34,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2022-12-06 05:08:34,298 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-06 05:08:34,298 INFO L175 Difference]: Start difference. First operand has 71 places, 112 transitions, 600 flow. Second operand 5 states and 130 transitions. [2022-12-06 05:08:34,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 221 transitions, 1476 flow [2022-12-06 05:08:34,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 221 transitions, 1468 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-06 05:08:34,399 INFO L231 Difference]: Finished difference. Result has 79 places, 155 transitions, 1114 flow [2022-12-06 05:08:34,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1114, PETRI_PLACES=79, PETRI_TRANSITIONS=155} [2022-12-06 05:08:34,400 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 33 predicate places. [2022-12-06 05:08:34,400 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:34,400 INFO L89 Accepts]: Start accepts. Operand has 79 places, 155 transitions, 1114 flow [2022-12-06 05:08:34,402 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:34,402 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:34,402 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 155 transitions, 1114 flow [2022-12-06 05:08:34,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 155 transitions, 1114 flow [2022-12-06 05:08:34,541 INFO L130 PetriNetUnfolder]: 372/906 cut-off events. [2022-12-06 05:08:34,541 INFO L131 PetriNetUnfolder]: For 1437/1579 co-relation queries the response was YES. [2022-12-06 05:08:34,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2414 conditions, 906 events. 372/906 cut-off events. For 1437/1579 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5954 event pairs, 15 based on Foata normal form. 12/749 useless extension candidates. Maximal degree in co-relation 2331. Up to 205 conditions per place. [2022-12-06 05:08:34,549 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 155 transitions, 1114 flow [2022-12-06 05:08:34,549 INFO L188 LiptonReduction]: Number of co-enabled transitions 2514 [2022-12-06 05:08:34,635 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:34,636 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 236 [2022-12-06 05:08:34,636 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 155 transitions, 1114 flow [2022-12-06 05:08:34,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 05:08:34,636 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:34,636 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:34,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 05:08:34,637 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:34,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:34,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1543872765, now seen corresponding path program 7 times [2022-12-06 05:08:34,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:34,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429885643] [2022-12-06 05:08:34,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:34,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:08:35,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:35,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429885643] [2022-12-06 05:08:35,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429885643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:35,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:35,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:08:35,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826970471] [2022-12-06 05:08:35,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:35,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:08:35,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:35,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:08:35,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:08:35,745 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:35,745 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 155 transitions, 1114 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 05:08:35,745 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:35,745 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:35,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:38,952 INFO L130 PetriNetUnfolder]: 11863/16202 cut-off events. [2022-12-06 05:08:38,953 INFO L131 PetriNetUnfolder]: For 20085/20085 co-relation queries the response was YES. [2022-12-06 05:08:38,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50445 conditions, 16202 events. 11863/16202 cut-off events. For 20085/20085 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 83334 event pairs, 5107 based on Foata normal form. 1/12709 useless extension candidates. Maximal degree in co-relation 50341. Up to 12780 conditions per place. [2022-12-06 05:08:39,040 INFO L137 encePairwiseOnDemand]: 37/49 looper letters, 213 selfloop transitions, 47 changer transitions 2/262 dead transitions. [2022-12-06 05:08:39,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 262 transitions, 2201 flow [2022-12-06 05:08:39,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:08:39,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:08:39,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-06 05:08:39,042 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2022-12-06 05:08:39,042 INFO L175 Difference]: Start difference. First operand has 79 places, 155 transitions, 1114 flow. Second operand 5 states and 129 transitions. [2022-12-06 05:08:39,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 262 transitions, 2201 flow [2022-12-06 05:08:39,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 262 transitions, 2189 flow, removed 6 selfloop flow, removed 0 redundant places. [2022-12-06 05:08:39,235 INFO L231 Difference]: Finished difference. Result has 86 places, 184 transitions, 1581 flow [2022-12-06 05:08:39,236 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1106, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1581, PETRI_PLACES=86, PETRI_TRANSITIONS=184} [2022-12-06 05:08:39,236 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 40 predicate places. [2022-12-06 05:08:39,236 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:39,236 INFO L89 Accepts]: Start accepts. Operand has 86 places, 184 transitions, 1581 flow [2022-12-06 05:08:39,238 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:39,238 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:39,239 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 184 transitions, 1581 flow [2022-12-06 05:08:39,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 184 transitions, 1581 flow [2022-12-06 05:08:39,378 INFO L130 PetriNetUnfolder]: 397/975 cut-off events. [2022-12-06 05:08:39,378 INFO L131 PetriNetUnfolder]: For 2292/2466 co-relation queries the response was YES. [2022-12-06 05:08:39,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2929 conditions, 975 events. 397/975 cut-off events. For 2292/2466 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 6546 event pairs, 10 based on Foata normal form. 14/815 useless extension candidates. Maximal degree in co-relation 2842. Up to 230 conditions per place. [2022-12-06 05:08:39,385 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 184 transitions, 1581 flow [2022-12-06 05:08:39,385 INFO L188 LiptonReduction]: Number of co-enabled transitions 2894 [2022-12-06 05:08:39,393 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:39,394 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 158 [2022-12-06 05:08:39,394 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 184 transitions, 1581 flow [2022-12-06 05:08:39,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 05:08:39,394 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:39,394 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:39,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 05:08:39,394 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:39,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:39,395 INFO L85 PathProgramCache]: Analyzing trace with hash -2129159793, now seen corresponding path program 8 times [2022-12-06 05:08:39,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:39,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550606602] [2022-12-06 05:08:39,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:39,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:08:40,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:40,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550606602] [2022-12-06 05:08:40,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550606602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:40,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:40,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 05:08:40,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763876950] [2022-12-06 05:08:40,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:40,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 05:08:40,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:40,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 05:08:40,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 05:08:40,630 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:40,630 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 184 transitions, 1581 flow. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 05:08:40,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:40,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:40,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:43,589 INFO L130 PetriNetUnfolder]: 12033/16462 cut-off events. [2022-12-06 05:08:43,589 INFO L131 PetriNetUnfolder]: For 30652/30652 co-relation queries the response was YES. [2022-12-06 05:08:43,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56199 conditions, 16462 events. 12033/16462 cut-off events. For 30652/30652 co-relation queries the response was YES. Maximal size of possible extension queue 652. Compared 85186 event pairs, 3058 based on Foata normal form. 1/12907 useless extension candidates. Maximal degree in co-relation 56091. Up to 7928 conditions per place. [2022-12-06 05:08:43,684 INFO L137 encePairwiseOnDemand]: 37/49 looper letters, 207 selfloop transitions, 49 changer transitions 2/258 dead transitions. [2022-12-06 05:08:43,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 258 transitions, 2432 flow [2022-12-06 05:08:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 05:08:43,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 05:08:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 129 transitions. [2022-12-06 05:08:43,686 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5265306122448979 [2022-12-06 05:08:43,687 INFO L175 Difference]: Start difference. First operand has 86 places, 184 transitions, 1581 flow. Second operand 5 states and 129 transitions. [2022-12-06 05:08:43,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 258 transitions, 2432 flow [2022-12-06 05:08:44,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 258 transitions, 2424 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-06 05:08:44,058 INFO L231 Difference]: Finished difference. Result has 92 places, 194 transitions, 1838 flow [2022-12-06 05:08:44,058 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1577, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1838, PETRI_PLACES=92, PETRI_TRANSITIONS=194} [2022-12-06 05:08:44,058 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 46 predicate places. [2022-12-06 05:08:44,059 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:44,059 INFO L89 Accepts]: Start accepts. Operand has 92 places, 194 transitions, 1838 flow [2022-12-06 05:08:44,063 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:44,063 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:44,063 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 194 transitions, 1838 flow [2022-12-06 05:08:44,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 194 transitions, 1838 flow [2022-12-06 05:08:44,228 INFO L130 PetriNetUnfolder]: 412/1022 cut-off events. [2022-12-06 05:08:44,228 INFO L131 PetriNetUnfolder]: For 3111/3304 co-relation queries the response was YES. [2022-12-06 05:08:44,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3376 conditions, 1022 events. 412/1022 cut-off events. For 3111/3304 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6983 event pairs, 8 based on Foata normal form. 10/847 useless extension candidates. Maximal degree in co-relation 3286. Up to 240 conditions per place. [2022-12-06 05:08:44,239 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 194 transitions, 1838 flow [2022-12-06 05:08:44,239 INFO L188 LiptonReduction]: Number of co-enabled transitions 3054 [2022-12-06 05:08:44,246 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:44,247 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 188 [2022-12-06 05:08:44,247 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 194 transitions, 1838 flow [2022-12-06 05:08:44,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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-06 05:08:44,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:44,248 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:44,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 05:08:44,248 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:44,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:44,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1978641696, now seen corresponding path program 1 times [2022-12-06 05:08:44,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:44,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549412985] [2022-12-06 05:08:44,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:08:44,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:44,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549412985] [2022-12-06 05:08:44,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549412985] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:44,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:44,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:08:44,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277391402] [2022-12-06 05:08:44,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:44,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:08:44,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:44,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:08:44,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:08:44,419 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:44,420 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 194 transitions, 1838 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-06 05:08:44,420 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:44,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:44,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:48,596 INFO L130 PetriNetUnfolder]: 18096/24686 cut-off events. [2022-12-06 05:08:48,596 INFO L131 PetriNetUnfolder]: For 56711/56711 co-relation queries the response was YES. [2022-12-06 05:08:48,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88214 conditions, 24686 events. 18096/24686 cut-off events. For 56711/56711 co-relation queries the response was YES. Maximal size of possible extension queue 822. Compared 132177 event pairs, 6095 based on Foata normal form. 218/19536 useless extension candidates. Maximal degree in co-relation 88103. Up to 14935 conditions per place. [2022-12-06 05:08:48,730 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 273 selfloop transitions, 12 changer transitions 0/285 dead transitions. [2022-12-06 05:08:48,730 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 285 transitions, 3216 flow [2022-12-06 05:08:48,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:08:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:08:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-12-06 05:08:48,732 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5510204081632653 [2022-12-06 05:08:48,732 INFO L175 Difference]: Start difference. First operand has 92 places, 194 transitions, 1838 flow. Second operand 3 states and 81 transitions. [2022-12-06 05:08:48,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 285 transitions, 3216 flow [2022-12-06 05:08:49,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 285 transitions, 3110 flow, removed 20 selfloop flow, removed 1 redundant places. [2022-12-06 05:08:49,392 INFO L231 Difference]: Finished difference. Result has 94 places, 186 transitions, 1709 flow [2022-12-06 05:08:49,392 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1709, PETRI_PLACES=94, PETRI_TRANSITIONS=186} [2022-12-06 05:08:49,393 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 48 predicate places. [2022-12-06 05:08:49,393 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:49,393 INFO L89 Accepts]: Start accepts. Operand has 94 places, 186 transitions, 1709 flow [2022-12-06 05:08:49,395 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:49,395 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:49,395 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 186 transitions, 1709 flow [2022-12-06 05:08:49,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 186 transitions, 1709 flow [2022-12-06 05:08:49,543 INFO L130 PetriNetUnfolder]: 484/1287 cut-off events. [2022-12-06 05:08:49,543 INFO L131 PetriNetUnfolder]: For 3413/3645 co-relation queries the response was YES. [2022-12-06 05:08:49,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3989 conditions, 1287 events. 484/1287 cut-off events. For 3413/3645 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 9557 event pairs, 14 based on Foata normal form. 24/1053 useless extension candidates. Maximal degree in co-relation 3898. Up to 290 conditions per place. [2022-12-06 05:08:49,555 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 186 transitions, 1709 flow [2022-12-06 05:08:49,555 INFO L188 LiptonReduction]: Number of co-enabled transitions 3186 [2022-12-06 05:08:49,574 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:49,575 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 182 [2022-12-06 05:08:49,575 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 186 transitions, 1709 flow [2022-12-06 05:08:49,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-06 05:08:49,575 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:49,575 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:49,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 05:08:49,576 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:49,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1898259066, now seen corresponding path program 1 times [2022-12-06 05:08:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:49,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053695193] [2022-12-06 05:08:49,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:49,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:49,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:49,707 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:08:49,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:49,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053695193] [2022-12-06 05:08:49,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053695193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:49,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:49,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:08:49,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470776560] [2022-12-06 05:08:49,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:49,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:08:49,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:49,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:08:49,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:08:49,709 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:49,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 186 transitions, 1709 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-06 05:08:49,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:49,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:49,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:08:53,967 INFO L130 PetriNetUnfolder]: 19166/26402 cut-off events. [2022-12-06 05:08:53,967 INFO L131 PetriNetUnfolder]: For 60967/60967 co-relation queries the response was YES. [2022-12-06 05:08:54,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91661 conditions, 26402 events. 19166/26402 cut-off events. For 60967/60967 co-relation queries the response was YES. Maximal size of possible extension queue 877. Compared 146323 event pairs, 8221 based on Foata normal form. 0/21474 useless extension candidates. Maximal degree in co-relation 91549. Up to 21817 conditions per place. [2022-12-06 05:08:54,112 INFO L137 encePairwiseOnDemand]: 46/49 looper letters, 205 selfloop transitions, 19 changer transitions 0/224 dead transitions. [2022-12-06 05:08:54,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 224 transitions, 2359 flow [2022-12-06 05:08:54,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:08:54,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:08:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-12-06 05:08:54,113 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5578231292517006 [2022-12-06 05:08:54,114 INFO L175 Difference]: Start difference. First operand has 94 places, 186 transitions, 1709 flow. Second operand 3 states and 82 transitions. [2022-12-06 05:08:54,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 224 transitions, 2359 flow [2022-12-06 05:08:54,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 224 transitions, 2344 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:08:54,776 INFO L231 Difference]: Finished difference. Result has 96 places, 179 transitions, 1677 flow [2022-12-06 05:08:54,776 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1590, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1677, PETRI_PLACES=96, PETRI_TRANSITIONS=179} [2022-12-06 05:08:54,777 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 50 predicate places. [2022-12-06 05:08:54,777 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:08:54,777 INFO L89 Accepts]: Start accepts. Operand has 96 places, 179 transitions, 1677 flow [2022-12-06 05:08:54,779 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:08:54,779 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:08:54,779 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 96 places, 179 transitions, 1677 flow [2022-12-06 05:08:54,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 179 transitions, 1677 flow [2022-12-06 05:08:54,928 INFO L130 PetriNetUnfolder]: 458/1313 cut-off events. [2022-12-06 05:08:54,929 INFO L131 PetriNetUnfolder]: For 3903/4174 co-relation queries the response was YES. [2022-12-06 05:08:54,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3989 conditions, 1313 events. 458/1313 cut-off events. For 3903/4174 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 10110 event pairs, 12 based on Foata normal form. 26/1117 useless extension candidates. Maximal degree in co-relation 3897. Up to 252 conditions per place. [2022-12-06 05:08:54,941 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 96 places, 179 transitions, 1677 flow [2022-12-06 05:08:54,941 INFO L188 LiptonReduction]: Number of co-enabled transitions 3088 [2022-12-06 05:08:54,949 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:08:54,950 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 173 [2022-12-06 05:08:54,950 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 179 transitions, 1677 flow [2022-12-06 05:08:54,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-06 05:08:54,950 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:08:54,950 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:08:54,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 05:08:54,950 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:08:54,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:08:54,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1493858438, now seen corresponding path program 1 times [2022-12-06 05:08:54,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:08:54,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876483849] [2022-12-06 05:08:54,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:08:54,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:08:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:08:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:08:55,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:08:55,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876483849] [2022-12-06 05:08:55,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876483849] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:08:55,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:08:55,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:08:55,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266031202] [2022-12-06 05:08:55,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:08:55,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-06 05:08:55,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:08:55,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-06 05:08:55,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-06 05:08:55,122 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:08:55,123 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 179 transitions, 1677 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-06 05:08:55,123 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:08:55,123 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:08:55,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:01,382 INFO L130 PetriNetUnfolder]: 29000/39476 cut-off events. [2022-12-06 05:09:01,383 INFO L131 PetriNetUnfolder]: For 111856/111856 co-relation queries the response was YES. [2022-12-06 05:09:01,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139472 conditions, 39476 events. 29000/39476 cut-off events. For 111856/111856 co-relation queries the response was YES. Maximal size of possible extension queue 1052. Compared 219243 event pairs, 11049 based on Foata normal form. 0/31908 useless extension candidates. Maximal degree in co-relation 139359. Up to 27151 conditions per place. [2022-12-06 05:09:01,662 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 236 selfloop transitions, 9 changer transitions 0/245 dead transitions. [2022-12-06 05:09:01,662 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 245 transitions, 2645 flow [2022-12-06 05:09:01,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-06 05:09:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-06 05:09:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-12-06 05:09:01,663 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.54421768707483 [2022-12-06 05:09:01,663 INFO L175 Difference]: Start difference. First operand has 96 places, 179 transitions, 1677 flow. Second operand 3 states and 80 transitions. [2022-12-06 05:09:01,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 245 transitions, 2645 flow [2022-12-06 05:09:02,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 245 transitions, 2596 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-06 05:09:02,578 INFO L231 Difference]: Finished difference. Result has 98 places, 181 transitions, 1673 flow [2022-12-06 05:09:02,578 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1636, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1673, PETRI_PLACES=98, PETRI_TRANSITIONS=181} [2022-12-06 05:09:02,579 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 52 predicate places. [2022-12-06 05:09:02,579 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:02,579 INFO L89 Accepts]: Start accepts. Operand has 98 places, 181 transitions, 1673 flow [2022-12-06 05:09:02,581 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:02,581 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:02,581 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 181 transitions, 1673 flow [2022-12-06 05:09:02,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 181 transitions, 1673 flow [2022-12-06 05:09:02,742 INFO L130 PetriNetUnfolder]: 498/1473 cut-off events. [2022-12-06 05:09:02,743 INFO L131 PetriNetUnfolder]: For 3927/4162 co-relation queries the response was YES. [2022-12-06 05:09:02,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4211 conditions, 1473 events. 498/1473 cut-off events. For 3927/4162 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 11302 event pairs, 12 based on Foata normal form. 26/1258 useless extension candidates. Maximal degree in co-relation 4118. Up to 252 conditions per place. [2022-12-06 05:09:02,757 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 181 transitions, 1673 flow [2022-12-06 05:09:02,757 INFO L188 LiptonReduction]: Number of co-enabled transitions 3320 [2022-12-06 05:09:02,787 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 05:09:02,788 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 209 [2022-12-06 05:09:02,788 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 181 transitions, 1673 flow [2022-12-06 05:09:02,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-06 05:09:02,788 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:02,788 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:02,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-06 05:09:02,789 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:09:02,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:02,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1745866136, now seen corresponding path program 1 times [2022-12-06 05:09:02,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:02,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616990772] [2022-12-06 05:09:02,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:02,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:02,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:03,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:03,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616990772] [2022-12-06 05:09:03,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616990772] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:09:03,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932226011] [2022-12-06 05:09:03,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:03,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:09:03,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:09:03,101 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:09:03,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-06 05:09:03,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:03,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 05:09:03,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:09:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:03,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:09:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:03,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932226011] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:09:03,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:09:03,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-06 05:09:03,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5145648] [2022-12-06 05:09:03,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:09:03,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 05:09:03,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:03,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 05:09:03,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-06 05:09:03,461 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 49 [2022-12-06 05:09:03,462 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 181 transitions, 1673 flow. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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-06 05:09:03,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:03,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 49 [2022-12-06 05:09:03,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:09,920 INFO L130 PetriNetUnfolder]: 29790/40678 cut-off events. [2022-12-06 05:09:09,920 INFO L131 PetriNetUnfolder]: For 101095/101095 co-relation queries the response was YES. [2022-12-06 05:09:10,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143741 conditions, 40678 events. 29790/40678 cut-off events. For 101095/101095 co-relation queries the response was YES. Maximal size of possible extension queue 1064. Compared 229176 event pairs, 9058 based on Foata normal form. 4/33354 useless extension candidates. Maximal degree in co-relation 143627. Up to 36594 conditions per place. [2022-12-06 05:09:10,252 INFO L137 encePairwiseOnDemand]: 45/49 looper letters, 199 selfloop transitions, 12 changer transitions 61/272 dead transitions. [2022-12-06 05:09:10,253 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 272 transitions, 2904 flow [2022-12-06 05:09:10,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:09:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:09:10,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-12-06 05:09:10,254 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5051020408163265 [2022-12-06 05:09:10,254 INFO L175 Difference]: Start difference. First operand has 98 places, 181 transitions, 1673 flow. Second operand 4 states and 99 transitions. [2022-12-06 05:09:10,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 272 transitions, 2904 flow [2022-12-06 05:09:11,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 272 transitions, 2890 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-06 05:09:11,454 INFO L231 Difference]: Finished difference. Result has 103 places, 170 transitions, 1615 flow [2022-12-06 05:09:11,454 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=1664, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1615, PETRI_PLACES=103, PETRI_TRANSITIONS=170} [2022-12-06 05:09:11,455 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 57 predicate places. [2022-12-06 05:09:11,455 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:11,455 INFO L89 Accepts]: Start accepts. Operand has 103 places, 170 transitions, 1615 flow [2022-12-06 05:09:11,457 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:11,457 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:11,457 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 170 transitions, 1615 flow [2022-12-06 05:09:11,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 170 transitions, 1615 flow [2022-12-06 05:09:11,642 INFO L130 PetriNetUnfolder]: 465/1350 cut-off events. [2022-12-06 05:09:11,643 INFO L131 PetriNetUnfolder]: For 3771/3983 co-relation queries the response was YES. [2022-12-06 05:09:11,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3910 conditions, 1350 events. 465/1350 cut-off events. For 3771/3983 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9890 event pairs, 18 based on Foata normal form. 30/1136 useless extension candidates. Maximal degree in co-relation 3829. Up to 245 conditions per place. [2022-12-06 05:09:11,657 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 170 transitions, 1615 flow [2022-12-06 05:09:11,657 INFO L188 LiptonReduction]: Number of co-enabled transitions 3154 [2022-12-06 05:09:11,678 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3007] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse5 (= (mod v_~is_null_1~0_In_28 256) 0)) (.cse3 (= 0 (mod v_~is_null_5~0_In_26 256)))) (let ((.cse0 (= |v_thread1Thread1of1ForFork1_#res#1.base_Out_38| 0)) (.cse4 (not .cse3)) (.cse1 (not .cse5)) (.cse6 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|)) (.cse2 (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_38| 0)) (.cse7 (= (mod |v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5| 256) 0))) (or (and (or (and .cse0 (= v_~result_12~0_Out_86 1005) .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 (= (+ v_~result_12~0_Out_86 995) 0) .cse5)) (= |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_~b#1_In_21|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_In_6| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7| |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) (= (ite (not (and .cse3 .cse5)) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) .cse6 .cse7 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9| |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_In_21| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|)) (and .cse0 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) .cse4 (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|) (<= |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42| 2147483647) .cse1 (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|)) .cse6 .cse2 (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20| v_~get_subject_7~0_In_11) .cse7 (= (+ |v_thread1Thread1of1ForFork1_minus_~b#1_Out_32| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|) |v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|) (= v_~get_subject_3~0_In_11 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|) (= v_~result_12~0_Out_86 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|))))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_11, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_In_9|, ~is_null_5~0=v_~is_null_5~0_In_26, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_In_7|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_In_21|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_In_6|, ~is_null_1~0=v_~is_null_1~0_In_28, thread1Thread1of1ForFork1_#t~nondet1#1=|v_thread1Thread1of1ForFork1_#t~nondet1#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_In_21|} OutVars{thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_20|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_42|, thread1Thread1of1ForFork1_#t~ite22#1=|v_thread1Thread1of1ForFork1_#t~ite22#1_Out_28|, thread1Thread1of1ForFork1_#t~ret20#1=|v_thread1Thread1of1ForFork1_#t~ret20#1_Out_20|, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_20|, ~get_subject_3~0=v_~get_subject_3~0_In_11, ~is_null_5~0=v_~is_null_5~0_In_26, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_32|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_62|, ~is_null_1~0=v_~is_null_1~0_In_28, thread1Thread1of1ForFork1_#t~ite21#1=|v_thread1Thread1of1ForFork1_#t~ite21#1_Out_26|, ~get_subject_7~0=v_~get_subject_7~0_In_11, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_38|, ~result_12~0=v_~result_12~0_Out_86, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_28|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_38|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_78|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, thread1Thread1of1ForFork1_#t~ite22#1, thread1Thread1of1ForFork1_#t~ret20#1, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#t~ite21#1, thread1Thread1of1ForFork1_#res#1.offset, ~result_12~0, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [3010] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse0 (= (mod v_~is_null_9~0_In_29 256) 0)) (.cse1 (= (mod v_~is_null_1~0_In_30 256) 0))) (let ((.cse2 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_28| 0)) (.cse3 (not .cse1)) (.cse5 (not .cse0)) (.cse4 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_28| 0)) (.cse6 (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|)) (.cse7 (= 0 (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5| 256)))) (or (and (= (ite (not (and .cse0 .cse1)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (or (and .cse2 .cse0 .cse3 (= v_~result_15~0_Out_84 1005) .cse4) (and .cse2 .cse5 .cse4 .cse1 (= (+ v_~result_15~0_Out_84 995) 0))) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|) (= |v_thread2Thread1of1ForFork2_minus_~b#1_In_19| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10| |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|) .cse6 (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_8| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse7 (= |v_thread2Thread1of1ForFork2_minus_~a#1_In_19| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|)) (and (<= v_~result_15~0_Out_84 2147483647) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|) (<= 0 (+ v_~result_15~0_Out_84 2147483648)) .cse2 .cse3 .cse5 .cse4 (= (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) |v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|) (= v_~get_subject_11~0_In_11 |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|) (= v_~result_15~0_Out_84 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|) .cse6 (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26| v_~get_subject_3~0_In_13) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|) .cse7)))) InVars {~get_subject_3~0=v_~get_subject_3~0_In_13, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_19|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_19|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_10|, ~is_null_1~0=v_~is_null_1~0_In_30, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_12|, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_5|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_8|, ~is_null_9~0=v_~is_null_9~0_In_29, ~get_subject_11~0=v_~get_subject_11~0_In_11} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_28|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_34|, thread2Thread1of1ForFork2_#t~ite43#1=|v_thread2Thread1of1ForFork2_#t~ite43#1_Out_26|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_70|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_44|, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_28|, ~get_subject_11~0=v_~get_subject_11~0_In_11, ~get_subject_3~0=v_~get_subject_3~0_In_13, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_94|, ~result_15~0=v_~result_15~0_Out_84, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_30|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_26|, thread2Thread1of1ForFork2_#t~ret42#1=|v_thread2Thread1of1ForFork2_#t~ret42#1_Out_20|, ~is_null_1~0=v_~is_null_1~0_In_30, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_26|, thread2Thread1of1ForFork2_#t~ite44#1=|v_thread2Thread1of1ForFork2_#t~ite44#1_Out_26|, ~is_null_9~0=v_~is_null_9~0_In_29} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_#t~ite43#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, ~result_15~0, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_#t~ret42#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~ite44#1, thread2Thread1of1ForFork2_#t~nondet23#1] [2022-12-06 05:09:12,417 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [2950] L84-7-->L86: Formula: (let ((.cse1 (= (mod v_~break_17~0_In_23 256) 0)) (.cse0 (+ v_~i_16~0_In_35 (- 1000)))) (or (and (= (ite |v_thread2Thread1of1ForFork2_#t~short32#1_53| .cse0 v_~result_15~0_In_14) v_~result_15~0_Out_58) |v_thread2Thread1of1ForFork2_#t~short32#1_54| .cse1 (let ((.cse2 (= 0 (mod (select (select |v_#memory_int_In_73| v_~ends_with_2~0.base_In_15) (+ v_~i_16~0_In_35 v_~ends_with_2~0.offset_In_15)) 256)))) (or (and .cse2 (not |v_thread2Thread1of1ForFork2_#t~short32#1_53|)) (and (not .cse2) |v_thread2Thread1of1ForFork2_#t~short32#1_53|)))) (and (not |v_thread2Thread1of1ForFork2_#t~short32#1_52|) (not .cse1) (= v_~result_15~0_Out_58 (ite |v_thread2Thread1of1ForFork2_#t~short32#1_52| .cse0 v_~result_15~0_In_14))))) InVars {~result_15~0=v_~result_15~0_In_14, #memory_int=|v_#memory_int_In_73|, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_15, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_15, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23} OutVars{thread2Thread1of1ForFork2_#t~mem31#1=|v_thread2Thread1of1ForFork2_#t~mem31#1_Out_10|, thread2Thread1of1ForFork2_#t~mem29#1=|v_thread2Thread1of1ForFork2_#t~mem29#1_Out_8|, ~result_15~0=v_~result_15~0_Out_58, thread2Thread1of1ForFork2_#t~mem28#1=|v_thread2Thread1of1ForFork2_#t~mem28#1_Out_4|, #memory_int=|v_#memory_int_In_73|, thread2Thread1of1ForFork2_#t~short32#1=|v_thread2Thread1of1ForFork2_#t~short32#1_Out_10|, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_15, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_15, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23, thread2Thread1of1ForFork2_#t~short30#1=|v_thread2Thread1of1ForFork2_#t~short30#1_Out_14|} AuxVars[|v_thread2Thread1of1ForFork2_#t~short32#1_54|, |v_thread2Thread1of1ForFork2_#t~short32#1_52|, |v_thread2Thread1of1ForFork2_#t~short32#1_53|] AssignedVars[thread2Thread1of1ForFork2_#t~mem31#1, thread2Thread1of1ForFork2_#t~mem29#1, ~result_15~0, thread2Thread1of1ForFork2_#t~mem28#1, thread2Thread1of1ForFork2_#t~short32#1, thread2Thread1of1ForFork2_#t~short30#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= (ite (and (= (mod v_~is_null_1~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, ~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:12,632 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [2783] L83-2-->L83-9: Formula: (and |v_thread2Thread1of1ForFork2_#t~short27#1_54| (= v_~result_15~0_145 (ite |v_thread2Thread1of1ForFork2_#t~short27#1_53| 0 v_~result_15~0_146)) (let ((.cse0 (= (mod (select (select |v_#memory_int_344| v_~ends_with_10~0.base_91) (+ v_~i_16~0_180 v_~ends_with_10~0.offset_91)) 256) 0))) (or (and (not .cse0) |v_thread2Thread1of1ForFork2_#t~short27#1_53|) (and .cse0 (not |v_thread2Thread1of1ForFork2_#t~short27#1_53|))))) InVars {~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_146, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_54|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} OutVars{~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_145, thread2Thread1of1ForFork2_#t~mem25#1=|v_thread2Thread1of1ForFork2_#t~mem25#1_33|, thread2Thread1of1ForFork2_#t~mem26#1=|v_thread2Thread1of1ForFork2_#t~mem26#1_25|, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_53|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} AuxVars[] AssignedVars[~result_15~0, thread2Thread1of1ForFork2_#t~mem25#1, thread2Thread1of1ForFork2_#t~mem26#1, thread2Thread1of1ForFork2_#t~short27#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= (ite (and (= (mod v_~is_null_1~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, ~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:12,768 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:09:12,769 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1314 [2022-12-06 05:09:12,769 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 173 transitions, 1690 flow [2022-12-06 05:09:12,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 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-06 05:09:12,769 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:12,769 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:12,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-06 05:09:12,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-06 05:09:12,979 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:09:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash -765662446, now seen corresponding path program 2 times [2022-12-06 05:09:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:12,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265805111] [2022-12-06 05:09:12,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:12,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:13,285 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-12-06 05:09:13,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:13,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265805111] [2022-12-06 05:09:13,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265805111] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 05:09:13,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 05:09:13,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 05:09:13,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166932624] [2022-12-06 05:09:13,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 05:09:13,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 05:09:13,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:13,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 05:09:13,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 05:09:13,287 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 52 [2022-12-06 05:09:13,287 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 173 transitions, 1690 flow. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-06 05:09:13,287 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:13,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 52 [2022-12-06 05:09:13,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:19,359 INFO L130 PetriNetUnfolder]: 28259/38445 cut-off events. [2022-12-06 05:09:19,359 INFO L131 PetriNetUnfolder]: For 96647/96647 co-relation queries the response was YES. [2022-12-06 05:09:19,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135135 conditions, 38445 events. 28259/38445 cut-off events. For 96647/96647 co-relation queries the response was YES. Maximal size of possible extension queue 998. Compared 211418 event pairs, 14779 based on Foata normal form. 4/31513 useless extension candidates. Maximal degree in co-relation 135053. Up to 35026 conditions per place. [2022-12-06 05:09:19,633 INFO L137 encePairwiseOnDemand]: 49/52 looper letters, 172 selfloop transitions, 5 changer transitions 56/233 dead transitions. [2022-12-06 05:09:19,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 233 transitions, 2435 flow [2022-12-06 05:09:19,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 05:09:19,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 05:09:19,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2022-12-06 05:09:19,634 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.46634615384615385 [2022-12-06 05:09:19,634 INFO L175 Difference]: Start difference. First operand has 104 places, 173 transitions, 1690 flow. Second operand 4 states and 97 transitions. [2022-12-06 05:09:19,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 233 transitions, 2435 flow [2022-12-06 05:09:20,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 233 transitions, 2406 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-06 05:09:20,731 INFO L231 Difference]: Finished difference. Result has 107 places, 148 transitions, 1318 flow [2022-12-06 05:09:20,731 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=52, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1318, PETRI_PLACES=107, PETRI_TRANSITIONS=148} [2022-12-06 05:09:20,731 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 61 predicate places. [2022-12-06 05:09:20,731 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:20,732 INFO L89 Accepts]: Start accepts. Operand has 107 places, 148 transitions, 1318 flow [2022-12-06 05:09:20,733 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:20,733 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:20,733 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 148 transitions, 1318 flow [2022-12-06 05:09:20,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 148 transitions, 1318 flow [2022-12-06 05:09:20,863 INFO L130 PetriNetUnfolder]: 404/1220 cut-off events. [2022-12-06 05:09:20,863 INFO L131 PetriNetUnfolder]: For 3061/3191 co-relation queries the response was YES. [2022-12-06 05:09:20,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3307 conditions, 1220 events. 404/1220 cut-off events. For 3061/3191 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8762 event pairs, 14 based on Foata normal form. 24/1028 useless extension candidates. Maximal degree in co-relation 3237. Up to 172 conditions per place. [2022-12-06 05:09:20,876 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 148 transitions, 1318 flow [2022-12-06 05:09:20,876 INFO L188 LiptonReduction]: Number of co-enabled transitions 2816 [2022-12-06 05:09:20,894 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3012] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5| 256) 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|)) (.cse3 (= (mod v_~is_null_9~0_In_31 256) 0)) (.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_38| 0)) (.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_38| 0)) (.cse4 (= (mod v_~is_null_5~0_In_28 256) 0))) (or (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) .cse1 (<= 0 (+ v_~result_18~0_Out_94 2147483648)) .cse2 (not .cse3) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26| v_~get_subject_7~0_In_13) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse4) .cse5 (<= v_~result_18~0_Out_94 2147483647) (= v_~result_18~0_Out_94 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|)) 1 0)) (= v_~get_subject_11~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|)) (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (not (and .cse3 .cse4)) 1 0)) .cse5 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~a#1_In_22|) (or (and .cse1 .cse2 .cse3 (= v_~result_18~0_Out_94 1005)) (and .cse1 .cse2 .cse4 (= (+ v_~result_18~0_Out_94 995) 0))) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88| 0)) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42| |v_thread3Thread1of1ForFork0_minus_#res#1_In_9|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~b#1_In_20|)))) InVars {~is_null_5~0=v_~is_null_5~0_In_28, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_9|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_20|, thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_22|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10|} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_38|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_Out_24|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_30|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_Out_20|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_38|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|, ~is_null_5~0=v_~is_null_5~0_In_28, ~result_18~0=v_~result_18~0_Out_94, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_Out_24|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [2950] L84-7-->L86: Formula: (let ((.cse1 (= (mod v_~break_17~0_In_23 256) 0)) (.cse0 (+ v_~i_16~0_In_35 (- 1000)))) (or (and (= (ite |v_thread2Thread1of1ForFork2_#t~short32#1_53| .cse0 v_~result_15~0_In_14) v_~result_15~0_Out_58) |v_thread2Thread1of1ForFork2_#t~short32#1_54| .cse1 (let ((.cse2 (= 0 (mod (select (select |v_#memory_int_In_73| v_~ends_with_2~0.base_In_15) (+ v_~i_16~0_In_35 v_~ends_with_2~0.offset_In_15)) 256)))) (or (and .cse2 (not |v_thread2Thread1of1ForFork2_#t~short32#1_53|)) (and (not .cse2) |v_thread2Thread1of1ForFork2_#t~short32#1_53|)))) (and (not |v_thread2Thread1of1ForFork2_#t~short32#1_52|) (not .cse1) (= v_~result_15~0_Out_58 (ite |v_thread2Thread1of1ForFork2_#t~short32#1_52| .cse0 v_~result_15~0_In_14))))) InVars {~result_15~0=v_~result_15~0_In_14, #memory_int=|v_#memory_int_In_73|, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_15, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_15, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23} OutVars{thread2Thread1of1ForFork2_#t~mem31#1=|v_thread2Thread1of1ForFork2_#t~mem31#1_Out_10|, thread2Thread1of1ForFork2_#t~mem29#1=|v_thread2Thread1of1ForFork2_#t~mem29#1_Out_8|, ~result_15~0=v_~result_15~0_Out_58, thread2Thread1of1ForFork2_#t~mem28#1=|v_thread2Thread1of1ForFork2_#t~mem28#1_Out_4|, #memory_int=|v_#memory_int_In_73|, thread2Thread1of1ForFork2_#t~short32#1=|v_thread2Thread1of1ForFork2_#t~short32#1_Out_10|, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_15, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_15, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23, thread2Thread1of1ForFork2_#t~short30#1=|v_thread2Thread1of1ForFork2_#t~short30#1_Out_14|} AuxVars[|v_thread2Thread1of1ForFork2_#t~short32#1_54|, |v_thread2Thread1of1ForFork2_#t~short32#1_52|, |v_thread2Thread1of1ForFork2_#t~short32#1_53|] AssignedVars[thread2Thread1of1ForFork2_#t~mem31#1, thread2Thread1of1ForFork2_#t~mem29#1, ~result_15~0, thread2Thread1of1ForFork2_#t~mem28#1, thread2Thread1of1ForFork2_#t~short32#1, thread2Thread1of1ForFork2_#t~short30#1] [2022-12-06 05:09:21,324 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3012] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5| 256) 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|)) (.cse3 (= (mod v_~is_null_9~0_In_31 256) 0)) (.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_38| 0)) (.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_38| 0)) (.cse4 (= (mod v_~is_null_5~0_In_28 256) 0))) (or (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) .cse1 (<= 0 (+ v_~result_18~0_Out_94 2147483648)) .cse2 (not .cse3) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26| v_~get_subject_7~0_In_13) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse4) .cse5 (<= v_~result_18~0_Out_94 2147483647) (= v_~result_18~0_Out_94 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|)) 1 0)) (= v_~get_subject_11~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|)) (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (not (and .cse3 .cse4)) 1 0)) .cse5 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~a#1_In_22|) (or (and .cse1 .cse2 .cse3 (= v_~result_18~0_Out_94 1005)) (and .cse1 .cse2 .cse4 (= (+ v_~result_18~0_Out_94 995) 0))) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88| 0)) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42| |v_thread3Thread1of1ForFork0_minus_#res#1_In_9|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~b#1_In_20|)))) InVars {~is_null_5~0=v_~is_null_5~0_In_28, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_9|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_20|, thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_22|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10|} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_38|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_Out_24|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_30|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_Out_20|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_38|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|, ~is_null_5~0=v_~is_null_5~0_In_28, ~result_18~0=v_~result_18~0_Out_94, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_Out_24|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [2783] L83-2-->L83-9: Formula: (and |v_thread2Thread1of1ForFork2_#t~short27#1_54| (= v_~result_15~0_145 (ite |v_thread2Thread1of1ForFork2_#t~short27#1_53| 0 v_~result_15~0_146)) (let ((.cse0 (= (mod (select (select |v_#memory_int_344| v_~ends_with_10~0.base_91) (+ v_~i_16~0_180 v_~ends_with_10~0.offset_91)) 256) 0))) (or (and (not .cse0) |v_thread2Thread1of1ForFork2_#t~short27#1_53|) (and .cse0 (not |v_thread2Thread1of1ForFork2_#t~short27#1_53|))))) InVars {~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_146, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_54|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} OutVars{~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_145, thread2Thread1of1ForFork2_#t~mem25#1=|v_thread2Thread1of1ForFork2_#t~mem25#1_33|, thread2Thread1of1ForFork2_#t~mem26#1=|v_thread2Thread1of1ForFork2_#t~mem26#1_25|, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_53|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} AuxVars[] AssignedVars[~result_15~0, thread2Thread1of1ForFork2_#t~mem25#1, thread2Thread1of1ForFork2_#t~mem26#1, thread2Thread1of1ForFork2_#t~short27#1] [2022-12-06 05:09:21,757 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [2950] L84-7-->L86: Formula: (let ((.cse1 (= (mod v_~break_17~0_In_23 256) 0)) (.cse0 (+ v_~i_16~0_In_35 (- 1000)))) (or (and (= (ite |v_thread2Thread1of1ForFork2_#t~short32#1_53| .cse0 v_~result_15~0_In_14) v_~result_15~0_Out_58) |v_thread2Thread1of1ForFork2_#t~short32#1_54| .cse1 (let ((.cse2 (= 0 (mod (select (select |v_#memory_int_In_73| v_~ends_with_2~0.base_In_15) (+ v_~i_16~0_In_35 v_~ends_with_2~0.offset_In_15)) 256)))) (or (and .cse2 (not |v_thread2Thread1of1ForFork2_#t~short32#1_53|)) (and (not .cse2) |v_thread2Thread1of1ForFork2_#t~short32#1_53|)))) (and (not |v_thread2Thread1of1ForFork2_#t~short32#1_52|) (not .cse1) (= v_~result_15~0_Out_58 (ite |v_thread2Thread1of1ForFork2_#t~short32#1_52| .cse0 v_~result_15~0_In_14))))) InVars {~result_15~0=v_~result_15~0_In_14, #memory_int=|v_#memory_int_In_73|, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_15, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_15, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23} OutVars{thread2Thread1of1ForFork2_#t~mem31#1=|v_thread2Thread1of1ForFork2_#t~mem31#1_Out_10|, thread2Thread1of1ForFork2_#t~mem29#1=|v_thread2Thread1of1ForFork2_#t~mem29#1_Out_8|, ~result_15~0=v_~result_15~0_Out_58, thread2Thread1of1ForFork2_#t~mem28#1=|v_thread2Thread1of1ForFork2_#t~mem28#1_Out_4|, #memory_int=|v_#memory_int_In_73|, thread2Thread1of1ForFork2_#t~short32#1=|v_thread2Thread1of1ForFork2_#t~short32#1_Out_10|, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_15, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_15, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23, thread2Thread1of1ForFork2_#t~short30#1=|v_thread2Thread1of1ForFork2_#t~short30#1_Out_14|} AuxVars[|v_thread2Thread1of1ForFork2_#t~short32#1_54|, |v_thread2Thread1of1ForFork2_#t~short32#1_52|, |v_thread2Thread1of1ForFork2_#t~short32#1_53|] AssignedVars[thread2Thread1of1ForFork2_#t~mem31#1, thread2Thread1of1ForFork2_#t~mem29#1, ~result_15~0, thread2Thread1of1ForFork2_#t~mem28#1, thread2Thread1of1ForFork2_#t~short32#1, thread2Thread1of1ForFork2_#t~short30#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= (ite (and (= (mod v_~is_null_1~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, ~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:21,943 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3017] $Ultimate##0-->L86: Formula: (and (let ((.cse0 (= (mod v_~break_17~0_314 256) 0)) (.cse1 (+ v_~i_16~0_296 (- 1000)))) (or (and |v_thread2Thread1of1ForFork2_#t~short32#1_104| .cse0 (= v_~result_15~0_280 (ite |v_thread2Thread1of1ForFork2_#t~short32#1_106| .cse1 v_~result_15~0_281)) (let ((.cse2 (= (mod (select (select |v_#memory_int_703| v_~ends_with_2~0.base_185) (+ v_~ends_with_2~0.offset_185 v_~i_16~0_296)) 256) 0))) (or (and .cse2 (not |v_thread2Thread1of1ForFork2_#t~short32#1_106|)) (and |v_thread2Thread1of1ForFork2_#t~short32#1_106| (not .cse2))))) (and (not .cse0) (not |v_thread2Thread1of1ForFork2_#t~short32#1_105|) (= v_~result_15~0_280 (ite |v_thread2Thread1of1ForFork2_#t~short32#1_105| .cse1 v_~result_15~0_281))))) (let ((.cse3 (= (mod v_~is_null_5~0_153 256) 0)) (.cse6 (= (mod v_~is_null_9~0_171 256) 0)) (.cse7 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_266| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_186|)) (.cse4 (= |v_thread3Thread1of1ForFork0_#res#1.base_58| 0)) (.cse8 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_56| 256) 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_#res#1.offset_58| 0))) (or (and (= |v_thread3Thread1of1ForFork0_minus_~b#1_125| |v_thread3Thread1of1ForFork0_minus_~b#1_124|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_63| |v_thread3Thread1of1ForFork0_minus_#in~b#1_62|) (or (and .cse3 .cse4 (= (+ v_~result_18~0_248 995) 0) .cse5) (and (= 1005 v_~result_18~0_248) .cse6 .cse4 .cse5)) .cse7 (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_266| 0)) .cse8 (= |v_thread3Thread1of1ForFork0_minus_#res#1_89| |v_thread3Thread1of1ForFork0_minus_#res#1_88|) (= (ite (not (and .cse3 .cse6)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_186|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_57| |v_thread3Thread1of1ForFork0_minus_#in~a#1_56|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_121| |v_thread3Thread1of1ForFork0_minus_~a#1_120|)) (and (= v_~get_subject_11~0_75 |v_thread3Thread1of1ForFork0_minus_#in~b#1_62|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_56| v_~get_subject_7~0_75) (not .cse3) (<= v_~result_18~0_248 2147483647) (= (+ |v_thread3Thread1of1ForFork0_minus_~b#1_124| |v_thread3Thread1of1ForFork0_minus_#res#1_88|) |v_thread3Thread1of1ForFork0_minus_~a#1_120|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_62| |v_thread3Thread1of1ForFork0_minus_~b#1_124|) (not .cse6) .cse7 .cse4 .cse8 (= |v_thread3Thread1of1ForFork0_minus_~a#1_120| |v_thread3Thread1of1ForFork0_minus_#in~a#1_56|) (<= 0 (+ v_~result_18~0_248 2147483648)) .cse5 (= v_~result_18~0_248 |v_thread3Thread1of1ForFork0_minus_#res#1_88|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_186| (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_124|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_120| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_124|))) 1 0)))))) InVars {thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_56|, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_185, ~break_17~0=v_~break_17~0_314, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_121|, ~get_subject_11~0=v_~get_subject_11~0_75, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_63|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_89|, ~is_null_5~0=v_~is_null_5~0_153, ~result_15~0=v_~result_15~0_281, #memory_int=|v_#memory_int_703|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_125|, ~get_subject_7~0=v_~get_subject_7~0_75, ~ends_with_2~0.base=v_~ends_with_2~0.base_185, ~is_null_9~0=v_~is_null_9~0_171, ~i_16~0=v_~i_16~0_296, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_57|} OutVars{thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_58|, ~break_17~0=v_~break_17~0_314, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_120|, thread2Thread1of1ForFork2_#t~short30#1=|v_thread2Thread1of1ForFork2_#t~short30#1_89|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_57|, ~get_subject_11~0=v_~get_subject_11~0_75, thread2Thread1of1ForFork2_#t~mem31#1=|v_thread2Thread1of1ForFork2_#t~mem31#1_45|, ~result_15~0=v_~result_15~0_280, thread2Thread1of1ForFork2_#t~mem28#1=|v_thread2Thread1of1ForFork2_#t~mem28#1_66|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_124|, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_59|, ~get_subject_7~0=v_~get_subject_7~0_75, ~i_16~0=v_~i_16~0_296, thread2Thread1of1ForFork2_#t~mem29#1=|v_thread2Thread1of1ForFork2_#t~mem29#1_54|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_186|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_266|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_63|, thread2Thread1of1ForFork2_#t~short32#1=|v_thread2Thread1of1ForFork2_#t~short32#1_103|, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_185, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_62|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_58|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_88|, ~is_null_5~0=v_~is_null_5~0_153, ~result_18~0=v_~result_18~0_248, #memory_int=|v_#memory_int_703|, ~ends_with_2~0.base=v_~ends_with_2~0.base_185, ~is_null_9~0=v_~is_null_9~0_171, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_56|} AuxVars[|v_thread2Thread1of1ForFork2_#t~short32#1_106|, |v_thread2Thread1of1ForFork2_#t~short32#1_105|, |v_thread2Thread1of1ForFork2_#t~short32#1_104|] AssignedVars[thread2Thread1of1ForFork2_#t~mem29#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread2Thread1of1ForFork2_#t~short32#1, thread3Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork2_#t~short30#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread2Thread1of1ForFork2_#t~mem31#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_15~0, thread2Thread1of1ForFork2_#t~mem28#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= (ite (and (= (mod v_~is_null_1~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, ~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:22,337 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [2783] L83-2-->L83-9: Formula: (and |v_thread2Thread1of1ForFork2_#t~short27#1_54| (= v_~result_15~0_145 (ite |v_thread2Thread1of1ForFork2_#t~short27#1_53| 0 v_~result_15~0_146)) (let ((.cse0 (= (mod (select (select |v_#memory_int_344| v_~ends_with_10~0.base_91) (+ v_~i_16~0_180 v_~ends_with_10~0.offset_91)) 256) 0))) (or (and (not .cse0) |v_thread2Thread1of1ForFork2_#t~short27#1_53|) (and .cse0 (not |v_thread2Thread1of1ForFork2_#t~short27#1_53|))))) InVars {~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_146, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_54|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} OutVars{~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_145, thread2Thread1of1ForFork2_#t~mem25#1=|v_thread2Thread1of1ForFork2_#t~mem25#1_33|, thread2Thread1of1ForFork2_#t~mem26#1=|v_thread2Thread1of1ForFork2_#t~mem26#1_25|, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_53|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} AuxVars[] AssignedVars[~result_15~0, thread2Thread1of1ForFork2_#t~mem25#1, thread2Thread1of1ForFork2_#t~mem26#1, thread2Thread1of1ForFork2_#t~short27#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= (ite (and (= (mod v_~is_null_1~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, ~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:22,443 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3018] $Ultimate##0-->L83-9: Formula: (and |v_thread2Thread1of1ForFork2_#t~short27#1_88| (= v_~result_15~0_284 (ite |v_thread2Thread1of1ForFork2_#t~short27#1_87| 0 v_~result_15~0_285)) (let ((.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.base_60| 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.offset_60| 0)) (.cse0 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_268| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_188|)) (.cse4 (= (mod v_~is_null_9~0_173 256) 0)) (.cse1 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_60| 256) 0)) (.cse5 (= (mod v_~is_null_5~0_155 256) 0))) (or (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_~b#1_129| |v_thread3Thread1of1ForFork0_minus_~b#1_128|) (= |v_thread3Thread1of1ForFork0_minus_#res#1_93| |v_thread3Thread1of1ForFork0_minus_#res#1_92|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_61| |v_thread3Thread1of1ForFork0_minus_#in~a#1_60|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_125| |v_thread3Thread1of1ForFork0_minus_~a#1_124|) .cse1 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_67| |v_thread3Thread1of1ForFork0_minus_#in~b#1_66|) (or (and .cse2 .cse3 (= 1005 v_~result_18~0_250) .cse4) (and .cse2 .cse3 (= (+ v_~result_18~0_250 995) 0) .cse5)) (= (ite (not (and .cse4 .cse5)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_188|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_268| 0))) (and (<= 0 (+ v_~result_18~0_250 2147483648)) (= (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_124| (+ 2147483647 |v_thread3Thread1of1ForFork0_minus_~b#1_128|)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_128|)) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_188|) .cse2 (= |v_thread3Thread1of1ForFork0_minus_~a#1_124| |v_thread3Thread1of1ForFork0_minus_#in~a#1_60|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_60| v_~get_subject_7~0_77) .cse0 (= |v_thread3Thread1of1ForFork0_minus_~a#1_124| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_128| |v_thread3Thread1of1ForFork0_minus_#res#1_92|)) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_66| |v_thread3Thread1of1ForFork0_minus_~b#1_128|) (not .cse4) (<= v_~result_18~0_250 2147483647) (= v_~result_18~0_250 |v_thread3Thread1of1ForFork0_minus_#res#1_92|) .cse1 (not .cse5) (= v_~get_subject_11~0_77 |v_thread3Thread1of1ForFork0_minus_#in~b#1_66|)))) (let ((.cse6 (= (mod (select (select |v_#memory_int_705| v_~ends_with_10~0.base_159) (+ v_~i_16~0_298 v_~ends_with_10~0.offset_159)) 256) 0))) (or (and .cse6 (not |v_thread2Thread1of1ForFork2_#t~short27#1_87|)) (and |v_thread2Thread1of1ForFork2_#t~short27#1_87| (not .cse6))))) InVars {~ends_with_10~0.offset=v_~ends_with_10~0.offset_159, thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_60|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_125|, ~get_subject_11~0=v_~get_subject_11~0_77, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_67|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_93|, ~is_null_5~0=v_~is_null_5~0_155, ~ends_with_10~0.base=v_~ends_with_10~0.base_159, ~result_15~0=v_~result_15~0_285, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_88|, #memory_int=|v_#memory_int_705|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_129|, ~get_subject_7~0=v_~get_subject_7~0_77, ~is_null_9~0=v_~is_null_9~0_173, ~i_16~0=v_~i_16~0_298, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_61|} OutVars{~ends_with_10~0.offset=v_~ends_with_10~0.offset_159, thread2Thread1of1ForFork2_#t~mem26#1=|v_thread2Thread1of1ForFork2_#t~mem26#1_39|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_60|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_124|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_59|, ~get_subject_11~0=v_~get_subject_11~0_77, ~ends_with_10~0.base=v_~ends_with_10~0.base_159, ~result_15~0=v_~result_15~0_284, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_87|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_128|, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_61|, ~get_subject_7~0=v_~get_subject_7~0_77, ~i_16~0=v_~i_16~0_298, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_188|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_268|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_65|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_66|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_60|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_92|, ~is_null_5~0=v_~is_null_5~0_155, thread2Thread1of1ForFork2_#t~mem25#1=|v_thread2Thread1of1ForFork2_#t~mem25#1_51|, ~result_18~0=v_~result_18~0_250, #memory_int=|v_#memory_int_705|, ~is_null_9~0=v_~is_null_9~0_173, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_60|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_#t~mem26#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_15~0, thread2Thread1of1ForFork2_#t~mem25#1, ~result_18~0, thread2Thread1of1ForFork2_#t~short27#1, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= (ite (and (= (mod v_~is_null_1~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, ~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:22,770 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3012] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5| 256) 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|)) (.cse3 (= (mod v_~is_null_9~0_In_31 256) 0)) (.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_38| 0)) (.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_38| 0)) (.cse4 (= (mod v_~is_null_5~0_In_28 256) 0))) (or (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) .cse1 (<= 0 (+ v_~result_18~0_Out_94 2147483648)) .cse2 (not .cse3) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26| v_~get_subject_7~0_In_13) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse4) .cse5 (<= v_~result_18~0_Out_94 2147483647) (= v_~result_18~0_Out_94 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|)) 1 0)) (= v_~get_subject_11~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|)) (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (not (and .cse3 .cse4)) 1 0)) .cse5 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~a#1_In_22|) (or (and .cse1 .cse2 .cse3 (= v_~result_18~0_Out_94 1005)) (and .cse1 .cse2 .cse4 (= (+ v_~result_18~0_Out_94 995) 0))) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88| 0)) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42| |v_thread3Thread1of1ForFork0_minus_#res#1_In_9|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~b#1_In_20|)))) InVars {~is_null_5~0=v_~is_null_5~0_In_28, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_9|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_20|, thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_22|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10|} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_38|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_Out_24|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_30|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_Out_20|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_38|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|, ~is_null_5~0=v_~is_null_5~0_In_28, ~result_18~0=v_~result_18~0_Out_94, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_Out_24|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= (ite (and (= (mod v_~is_null_1~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, ~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:23,024 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [2950] L84-7-->L86: Formula: (let ((.cse1 (= (mod v_~break_17~0_In_23 256) 0)) (.cse0 (+ v_~i_16~0_In_35 (- 1000)))) (or (and (= (ite |v_thread2Thread1of1ForFork2_#t~short32#1_53| .cse0 v_~result_15~0_In_14) v_~result_15~0_Out_58) |v_thread2Thread1of1ForFork2_#t~short32#1_54| .cse1 (let ((.cse2 (= 0 (mod (select (select |v_#memory_int_In_73| v_~ends_with_2~0.base_In_15) (+ v_~i_16~0_In_35 v_~ends_with_2~0.offset_In_15)) 256)))) (or (and .cse2 (not |v_thread2Thread1of1ForFork2_#t~short32#1_53|)) (and (not .cse2) |v_thread2Thread1of1ForFork2_#t~short32#1_53|)))) (and (not |v_thread2Thread1of1ForFork2_#t~short32#1_52|) (not .cse1) (= v_~result_15~0_Out_58 (ite |v_thread2Thread1of1ForFork2_#t~short32#1_52| .cse0 v_~result_15~0_In_14))))) InVars {~result_15~0=v_~result_15~0_In_14, #memory_int=|v_#memory_int_In_73|, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_15, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_15, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23} OutVars{thread2Thread1of1ForFork2_#t~mem31#1=|v_thread2Thread1of1ForFork2_#t~mem31#1_Out_10|, thread2Thread1of1ForFork2_#t~mem29#1=|v_thread2Thread1of1ForFork2_#t~mem29#1_Out_8|, ~result_15~0=v_~result_15~0_Out_58, thread2Thread1of1ForFork2_#t~mem28#1=|v_thread2Thread1of1ForFork2_#t~mem28#1_Out_4|, #memory_int=|v_#memory_int_In_73|, thread2Thread1of1ForFork2_#t~short32#1=|v_thread2Thread1of1ForFork2_#t~short32#1_Out_10|, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_15, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_15, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23, thread2Thread1of1ForFork2_#t~short30#1=|v_thread2Thread1of1ForFork2_#t~short30#1_Out_14|} AuxVars[|v_thread2Thread1of1ForFork2_#t~short32#1_54|, |v_thread2Thread1of1ForFork2_#t~short32#1_52|, |v_thread2Thread1of1ForFork2_#t~short32#1_53|] AssignedVars[thread2Thread1of1ForFork2_#t~mem31#1, thread2Thread1of1ForFork2_#t~mem29#1, ~result_15~0, thread2Thread1of1ForFork2_#t~mem28#1, thread2Thread1of1ForFork2_#t~short32#1, thread2Thread1of1ForFork2_#t~short30#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= (ite (and (= (mod v_~is_null_1~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, ~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:23,231 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [2950] L84-7-->L86: Formula: (let ((.cse1 (= (mod v_~break_17~0_In_23 256) 0)) (.cse0 (+ v_~i_16~0_In_35 (- 1000)))) (or (and (= (ite |v_thread2Thread1of1ForFork2_#t~short32#1_53| .cse0 v_~result_15~0_In_14) v_~result_15~0_Out_58) |v_thread2Thread1of1ForFork2_#t~short32#1_54| .cse1 (let ((.cse2 (= 0 (mod (select (select |v_#memory_int_In_73| v_~ends_with_2~0.base_In_15) (+ v_~i_16~0_In_35 v_~ends_with_2~0.offset_In_15)) 256)))) (or (and .cse2 (not |v_thread2Thread1of1ForFork2_#t~short32#1_53|)) (and (not .cse2) |v_thread2Thread1of1ForFork2_#t~short32#1_53|)))) (and (not |v_thread2Thread1of1ForFork2_#t~short32#1_52|) (not .cse1) (= v_~result_15~0_Out_58 (ite |v_thread2Thread1of1ForFork2_#t~short32#1_52| .cse0 v_~result_15~0_In_14))))) InVars {~result_15~0=v_~result_15~0_In_14, #memory_int=|v_#memory_int_In_73|, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_15, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_15, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23} OutVars{thread2Thread1of1ForFork2_#t~mem31#1=|v_thread2Thread1of1ForFork2_#t~mem31#1_Out_10|, thread2Thread1of1ForFork2_#t~mem29#1=|v_thread2Thread1of1ForFork2_#t~mem29#1_Out_8|, ~result_15~0=v_~result_15~0_Out_58, thread2Thread1of1ForFork2_#t~mem28#1=|v_thread2Thread1of1ForFork2_#t~mem28#1_Out_4|, #memory_int=|v_#memory_int_In_73|, thread2Thread1of1ForFork2_#t~short32#1=|v_thread2Thread1of1ForFork2_#t~short32#1_Out_10|, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_15, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_15, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23, thread2Thread1of1ForFork2_#t~short30#1=|v_thread2Thread1of1ForFork2_#t~short30#1_Out_14|} AuxVars[|v_thread2Thread1of1ForFork2_#t~short32#1_54|, |v_thread2Thread1of1ForFork2_#t~short32#1_52|, |v_thread2Thread1of1ForFork2_#t~short32#1_53|] AssignedVars[thread2Thread1of1ForFork2_#t~mem31#1, thread2Thread1of1ForFork2_#t~mem29#1, ~result_15~0, thread2Thread1of1ForFork2_#t~mem28#1, thread2Thread1of1ForFork2_#t~short32#1, thread2Thread1of1ForFork2_#t~short30#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= (ite (and (= (mod v_~is_null_1~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, ~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:23,398 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [2783] L83-2-->L83-9: Formula: (and |v_thread2Thread1of1ForFork2_#t~short27#1_54| (= v_~result_15~0_145 (ite |v_thread2Thread1of1ForFork2_#t~short27#1_53| 0 v_~result_15~0_146)) (let ((.cse0 (= (mod (select (select |v_#memory_int_344| v_~ends_with_10~0.base_91) (+ v_~i_16~0_180 v_~ends_with_10~0.offset_91)) 256) 0))) (or (and (not .cse0) |v_thread2Thread1of1ForFork2_#t~short27#1_53|) (and .cse0 (not |v_thread2Thread1of1ForFork2_#t~short27#1_53|))))) InVars {~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_146, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_54|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} OutVars{~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_145, thread2Thread1of1ForFork2_#t~mem25#1=|v_thread2Thread1of1ForFork2_#t~mem25#1_33|, thread2Thread1of1ForFork2_#t~mem26#1=|v_thread2Thread1of1ForFork2_#t~mem26#1_25|, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_53|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} AuxVars[] AssignedVars[~result_15~0, thread2Thread1of1ForFork2_#t~mem25#1, thread2Thread1of1ForFork2_#t~mem26#1, thread2Thread1of1ForFork2_#t~short27#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= (ite (and (= (mod v_~is_null_1~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, ~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:23,503 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [2783] L83-2-->L83-9: Formula: (and |v_thread2Thread1of1ForFork2_#t~short27#1_54| (= v_~result_15~0_145 (ite |v_thread2Thread1of1ForFork2_#t~short27#1_53| 0 v_~result_15~0_146)) (let ((.cse0 (= (mod (select (select |v_#memory_int_344| v_~ends_with_10~0.base_91) (+ v_~i_16~0_180 v_~ends_with_10~0.offset_91)) 256) 0))) (or (and (not .cse0) |v_thread2Thread1of1ForFork2_#t~short27#1_53|) (and .cse0 (not |v_thread2Thread1of1ForFork2_#t~short27#1_53|))))) InVars {~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_146, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_54|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} OutVars{~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_145, thread2Thread1of1ForFork2_#t~mem25#1=|v_thread2Thread1of1ForFork2_#t~mem25#1_33|, thread2Thread1of1ForFork2_#t~mem26#1=|v_thread2Thread1of1ForFork2_#t~mem26#1_25|, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_53|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} AuxVars[] AssignedVars[~result_15~0, thread2Thread1of1ForFork2_#t~mem25#1, thread2Thread1of1ForFork2_#t~mem26#1, thread2Thread1of1ForFork2_#t~short27#1] and [2954] $Ultimate##0-->L81-4: Formula: (and (not (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| 0)) (= v_~break_17~0_Out_42 0) (not (= (mod |v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3| 256) 0)) (= v_~i_16~0_Out_36 0) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|) (= (ite (and (= (mod v_~is_null_1~0_In_24 256) 0) (= (mod v_~is_null_9~0_In_21 256) 0)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|)) InVars {~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_#t~nondet23#1=|v_thread2Thread1of1ForFork2_#t~nondet23#1_In_3|, ~is_null_9~0=v_~is_null_9~0_In_21} OutVars{thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_72|, ~is_null_1~0=v_~is_null_1~0_In_24, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_48|, ~is_null_9~0=v_~is_null_9~0_In_21, ~break_17~0=v_~break_17~0_Out_42, ~i_16~0=v_~i_16~0_Out_36} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_#t~nondet23#1, ~break_17~0, ~i_16~0] [2022-12-06 05:09:23,613 INFO L203 LiptonReduction]: Total number of compositions: 2 [2022-12-06 05:09:23,614 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 2883 [2022-12-06 05:09:23,614 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 150 transitions, 1433 flow [2022-12-06 05:09:23,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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-06 05:09:23,614 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:23,614 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:23,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-06 05:09:23,614 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:09:23,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:23,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2035898054, now seen corresponding path program 1 times [2022-12-06 05:09:23,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:23,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039176296] [2022-12-06 05:09:23,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:23,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:24,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:24,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039176296] [2022-12-06 05:09:24,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039176296] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:09:24,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268893790] [2022-12-06 05:09:24,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:24,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:09:24,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:09:24,348 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:09:24,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-06 05:09:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:24,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-06 05:09:24,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:09:24,701 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:24,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:09:25,227 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:25,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268893790] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:09:25,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:09:25,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-12-06 05:09:25,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671961525] [2022-12-06 05:09:25,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:09:25,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 05:09:25,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:25,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 05:09:25,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-06 05:09:25,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 58 [2022-12-06 05:09:25,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 150 transitions, 1433 flow. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 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-06 05:09:25,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:25,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 58 [2022-12-06 05:09:25,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 05:09:33,933 INFO L130 PetriNetUnfolder]: 38846/52785 cut-off events. [2022-12-06 05:09:33,933 INFO L131 PetriNetUnfolder]: For 123067/123067 co-relation queries the response was YES. [2022-12-06 05:09:34,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181299 conditions, 52785 events. 38846/52785 cut-off events. For 123067/123067 co-relation queries the response was YES. Maximal size of possible extension queue 1334. Compared 304507 event pairs, 6189 based on Foata normal form. 35/42744 useless extension candidates. Maximal degree in co-relation 181184. Up to 29571 conditions per place. [2022-12-06 05:09:34,406 INFO L137 encePairwiseOnDemand]: 48/58 looper letters, 251 selfloop transitions, 60 changer transitions 23/334 dead transitions. [2022-12-06 05:09:34,406 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 334 transitions, 2904 flow [2022-12-06 05:09:34,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 05:09:34,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 05:09:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 195 transitions. [2022-12-06 05:09:34,407 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4202586206896552 [2022-12-06 05:09:34,408 INFO L175 Difference]: Start difference. First operand has 104 places, 150 transitions, 1433 flow. Second operand 8 states and 195 transitions. [2022-12-06 05:09:34,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 334 transitions, 2904 flow [2022-12-06 05:09:35,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 334 transitions, 2820 flow, removed 23 selfloop flow, removed 7 redundant places. [2022-12-06 05:09:35,789 INFO L231 Difference]: Finished difference. Result has 110 places, 178 transitions, 1797 flow [2022-12-06 05:09:35,789 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=58, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1797, PETRI_PLACES=110, PETRI_TRANSITIONS=178} [2022-12-06 05:09:35,790 INFO L294 CegarLoopForPetriNet]: 46 programPoint places, 64 predicate places. [2022-12-06 05:09:35,790 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 05:09:35,790 INFO L89 Accepts]: Start accepts. Operand has 110 places, 178 transitions, 1797 flow [2022-12-06 05:09:35,791 INFO L95 Accepts]: Finished accepts. [2022-12-06 05:09:35,791 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 05:09:35,792 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 178 transitions, 1797 flow [2022-12-06 05:09:35,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 178 transitions, 1797 flow [2022-12-06 05:09:36,000 INFO L130 PetriNetUnfolder]: 566/1816 cut-off events. [2022-12-06 05:09:36,000 INFO L131 PetriNetUnfolder]: For 5017/5172 co-relation queries the response was YES. [2022-12-06 05:09:36,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4852 conditions, 1816 events. 566/1816 cut-off events. For 5017/5172 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 14660 event pairs, 9 based on Foata normal form. 34/1518 useless extension candidates. Maximal degree in co-relation 4758. Up to 245 conditions per place. [2022-12-06 05:09:36,032 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 178 transitions, 1797 flow [2022-12-06 05:09:36,032 INFO L188 LiptonReduction]: Number of co-enabled transitions 3426 [2022-12-06 05:09:36,058 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3012] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5| 256) 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|)) (.cse3 (= (mod v_~is_null_9~0_In_31 256) 0)) (.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_38| 0)) (.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_38| 0)) (.cse4 (= (mod v_~is_null_5~0_In_28 256) 0))) (or (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) .cse1 (<= 0 (+ v_~result_18~0_Out_94 2147483648)) .cse2 (not .cse3) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26| v_~get_subject_7~0_In_13) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse4) .cse5 (<= v_~result_18~0_Out_94 2147483647) (= v_~result_18~0_Out_94 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|)) 1 0)) (= v_~get_subject_11~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|)) (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (not (and .cse3 .cse4)) 1 0)) .cse5 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~a#1_In_22|) (or (and .cse1 .cse2 .cse3 (= v_~result_18~0_Out_94 1005)) (and .cse1 .cse2 .cse4 (= (+ v_~result_18~0_Out_94 995) 0))) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88| 0)) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42| |v_thread3Thread1of1ForFork0_minus_#res#1_In_9|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~b#1_In_20|)))) InVars {~is_null_5~0=v_~is_null_5~0_In_28, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_9|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_20|, thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_22|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10|} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_38|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_Out_24|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_30|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_Out_20|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_38|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|, ~is_null_5~0=v_~is_null_5~0_In_28, ~result_18~0=v_~result_18~0_Out_94, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_Out_24|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [2783] L83-2-->L83-9: Formula: (and |v_thread2Thread1of1ForFork2_#t~short27#1_54| (= v_~result_15~0_145 (ite |v_thread2Thread1of1ForFork2_#t~short27#1_53| 0 v_~result_15~0_146)) (let ((.cse0 (= (mod (select (select |v_#memory_int_344| v_~ends_with_10~0.base_91) (+ v_~i_16~0_180 v_~ends_with_10~0.offset_91)) 256) 0))) (or (and (not .cse0) |v_thread2Thread1of1ForFork2_#t~short27#1_53|) (and .cse0 (not |v_thread2Thread1of1ForFork2_#t~short27#1_53|))))) InVars {~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_146, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_54|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} OutVars{~ends_with_10~0.offset=v_~ends_with_10~0.offset_91, ~ends_with_10~0.base=v_~ends_with_10~0.base_91, ~result_15~0=v_~result_15~0_145, thread2Thread1of1ForFork2_#t~mem25#1=|v_thread2Thread1of1ForFork2_#t~mem25#1_33|, thread2Thread1of1ForFork2_#t~mem26#1=|v_thread2Thread1of1ForFork2_#t~mem26#1_25|, thread2Thread1of1ForFork2_#t~short27#1=|v_thread2Thread1of1ForFork2_#t~short27#1_53|, #memory_int=|v_#memory_int_344|, ~i_16~0=v_~i_16~0_180} AuxVars[] AssignedVars[~result_15~0, thread2Thread1of1ForFork2_#t~mem25#1, thread2Thread1of1ForFork2_#t~mem26#1, thread2Thread1of1ForFork2_#t~short27#1] [2022-12-06 05:09:36,568 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [3012] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse0 (= (mod |v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5| 256) 0)) (.cse5 (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|)) (.cse3 (= (mod v_~is_null_9~0_In_31 256) 0)) (.cse1 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_38| 0)) (.cse2 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_38| 0)) (.cse4 (= (mod v_~is_null_5~0_In_28 256) 0))) (or (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) .cse1 (<= 0 (+ v_~result_18~0_Out_94 2147483648)) .cse2 (not .cse3) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26| v_~get_subject_7~0_In_13) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not .cse4) .cse5 (<= v_~result_18~0_Out_94 2147483647) (= v_~result_18~0_Out_94 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|)) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (or (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| 2147483647)) (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|)) 1 0)) (= v_~get_subject_11~0_In_13 |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|)) (and .cse0 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66| (ite (not (and .cse3 .cse4)) 1 0)) .cse5 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~a#1_In_22|) (or (and .cse1 .cse2 .cse3 (= v_~result_18~0_Out_94 1005)) (and .cse1 .cse2 .cse4 (= (+ v_~result_18~0_Out_94 995) 0))) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|) (not (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88| 0)) (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_42| |v_thread3Thread1of1ForFork0_minus_#res#1_In_9|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_30| |v_thread3Thread1of1ForFork0_minus_~b#1_In_20|)))) InVars {~is_null_5~0=v_~is_null_5~0_In_28, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_9|, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_20|, thread3Thread1of1ForFork0_#t~nondet45#1=|v_thread3Thread1of1ForFork0_#t~nondet45#1_In_5|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_22|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_12|, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_10|} OutVars{thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_66|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_88|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_38|, thread3Thread1of1ForFork0_#t~ite66#1=|v_thread3Thread1of1ForFork0_#t~ite66#1_Out_24|, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_30|, thread3Thread1of1ForFork0_#t~ret64#1=|v_thread3Thread1of1ForFork0_#t~ret64#1_Out_20|, ~get_subject_11~0=v_~get_subject_11~0_In_13, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_26|, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_38|, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_42|, ~is_null_5~0=v_~is_null_5~0_In_28, ~result_18~0=v_~result_18~0_Out_94, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_30|, thread3Thread1of1ForFork0_#t~ite65#1=|v_thread3Thread1of1ForFork0_#t~ite65#1_Out_24|, ~get_subject_7~0=v_~get_subject_7~0_In_13, ~is_null_9~0=v_~is_null_9~0_In_31, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_26|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, thread3Thread1of1ForFork0_#t~nondet45#1, thread3Thread1of1ForFork0_#t~ite66#1, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_#t~ret64#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_minus_#res#1, ~result_18~0, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_#t~ite65#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [2950] L84-7-->L86: Formula: (let ((.cse1 (= (mod v_~break_17~0_In_23 256) 0)) (.cse0 (+ v_~i_16~0_In_35 (- 1000)))) (or (and (= (ite |v_thread2Thread1of1ForFork2_#t~short32#1_53| .cse0 v_~result_15~0_In_14) v_~result_15~0_Out_58) |v_thread2Thread1of1ForFork2_#t~short32#1_54| .cse1 (let ((.cse2 (= 0 (mod (select (select |v_#memory_int_In_73| v_~ends_with_2~0.base_In_15) (+ v_~i_16~0_In_35 v_~ends_with_2~0.offset_In_15)) 256)))) (or (and .cse2 (not |v_thread2Thread1of1ForFork2_#t~short32#1_53|)) (and (not .cse2) |v_thread2Thread1of1ForFork2_#t~short32#1_53|)))) (and (not |v_thread2Thread1of1ForFork2_#t~short32#1_52|) (not .cse1) (= v_~result_15~0_Out_58 (ite |v_thread2Thread1of1ForFork2_#t~short32#1_52| .cse0 v_~result_15~0_In_14))))) InVars {~result_15~0=v_~result_15~0_In_14, #memory_int=|v_#memory_int_In_73|, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_15, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_15, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23} OutVars{thread2Thread1of1ForFork2_#t~mem31#1=|v_thread2Thread1of1ForFork2_#t~mem31#1_Out_10|, thread2Thread1of1ForFork2_#t~mem29#1=|v_thread2Thread1of1ForFork2_#t~mem29#1_Out_8|, ~result_15~0=v_~result_15~0_Out_58, thread2Thread1of1ForFork2_#t~mem28#1=|v_thread2Thread1of1ForFork2_#t~mem28#1_Out_4|, #memory_int=|v_#memory_int_In_73|, thread2Thread1of1ForFork2_#t~short32#1=|v_thread2Thread1of1ForFork2_#t~short32#1_Out_10|, ~ends_with_2~0.base=v_~ends_with_2~0.base_In_15, ~ends_with_2~0.offset=v_~ends_with_2~0.offset_In_15, ~i_16~0=v_~i_16~0_In_35, ~break_17~0=v_~break_17~0_In_23, thread2Thread1of1ForFork2_#t~short30#1=|v_thread2Thread1of1ForFork2_#t~short30#1_Out_14|} AuxVars[|v_thread2Thread1of1ForFork2_#t~short32#1_54|, |v_thread2Thread1of1ForFork2_#t~short32#1_52|, |v_thread2Thread1of1ForFork2_#t~short32#1_53|] AssignedVars[thread2Thread1of1ForFork2_#t~mem31#1, thread2Thread1of1ForFork2_#t~mem29#1, ~result_15~0, thread2Thread1of1ForFork2_#t~mem28#1, thread2Thread1of1ForFork2_#t~short32#1, thread2Thread1of1ForFork2_#t~short30#1] [2022-12-06 05:09:37,004 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 05:09:37,005 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1215 [2022-12-06 05:09:37,005 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 177 transitions, 1801 flow [2022-12-06 05:09:37,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 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-06 05:09:37,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 05:09:37,005 INFO L213 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 05:09:37,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-06 05:09:37,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 05:09:37,207 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 05:09:37,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 05:09:37,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1067610202, now seen corresponding path program 2 times [2022-12-06 05:09:37,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 05:09:37,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359276047] [2022-12-06 05:09:37,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 05:09:37,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 05:09:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 05:09:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:37,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 05:09:37,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359276047] [2022-12-06 05:09:37,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359276047] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 05:09:37,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021144544] [2022-12-06 05:09:37,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 05:09:37,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 05:09:37,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 05:09:37,732 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 05:09:37,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-06 05:09:37,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 05:09:37,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 05:09:37,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-06 05:09:37,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 05:09:38,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:09:38,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 44 [2022-12-06 05:09:38,184 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:38,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 05:09:38,648 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 05:09:38,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 39 [2022-12-06 05:09:38,682 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-12-06 05:09:38,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021144544] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 05:09:38,682 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 05:09:38,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 16 [2022-12-06 05:09:38,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457649889] [2022-12-06 05:09:38,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 05:09:38,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 05:09:38,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 05:09:38,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 05:09:38,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2022-12-06 05:09:38,683 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 51 [2022-12-06 05:09:38,683 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 177 transitions, 1801 flow. Second operand has 17 states, 16 states have (on average 3.8125) internal successors, (61), 17 states have internal predecessors, (61), 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-06 05:09:38,684 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 05:09:38,684 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 51 [2022-12-06 05:09:38,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand