/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 07:24:15,801 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 07:24:15,803 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 07:24:15,835 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 07:24:15,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 07:24:15,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 07:24:15,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 07:24:15,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 07:24:15,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 07:24:15,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 07:24:15,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 07:24:15,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 07:24:15,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 07:24:15,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 07:24:15,856 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 07:24:15,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 07:24:15,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 07:24:15,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 07:24:15,862 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 07:24:15,866 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 07:24:15,868 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 07:24:15,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 07:24:15,869 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 07:24:15,870 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 07:24:15,875 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 07:24:15,875 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 07:24:15,876 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 07:24:15,877 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 07:24:15,878 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 07:24:15,878 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 07:24:15,878 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 07:24:15,880 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 07:24:15,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 07:24:15,881 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 07:24:15,882 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 07:24:15,882 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 07:24:15,882 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 07:24:15,882 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 07:24:15,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 07:24:15,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 07:24:15,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 07:24:15,887 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2022-12-06 07:24:15,911 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 07:24:15,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 07:24:15,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 07:24:15,930 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 07:24:15,933 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 07:24:15,934 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 07:24:15,934 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 07:24:15,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 07:24:15,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 07:24:15,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 07:24:15,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 07:24:15,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 07:24:15,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 07:24:15,935 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 07:24:15,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 07:24:15,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 07:24:15,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 07:24:15,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 07:24:15,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 07:24:15,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 07:24:15,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 07:24:15,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:24:15,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 07:24:15,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 07:24:15,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 07:24:15,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 07:24:15,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 07:24:15,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=REPEATED_LIPTON_PN [2022-12-06 07:24:15,937 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 07:24:16,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 07:24:16,235 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 07:24:16,237 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 07:24:16,238 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 07:24:16,238 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 07:24:16,239 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2022-12-06 07:24:17,253 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 07:24:17,430 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 07:24:17,431 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c [2022-12-06 07:24:17,435 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceb01ce95/31eca6b002714ab080c445966276286b/FLAG15e580583 [2022-12-06 07:24:17,447 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceb01ce95/31eca6b002714ab080c445966276286b [2022-12-06 07:24:17,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 07:24:17,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 07:24:17,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 07:24:17,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 07:24:17,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 07:24:17,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:24:17" (1/1) ... [2022-12-06 07:24:17,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c197c3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17, skipping insertion in model container [2022-12-06 07:24:17,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 07:24:17" (1/1) ... [2022-12-06 07:24:17,459 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 07:24:17,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 07:24:17,628 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2514,2527] [2022-12-06 07:24:17,638 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:24:17,646 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 07:24:17,677 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-simpl-str-trans.wvr.c[2514,2527] [2022-12-06 07:24:17,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 07:24:17,688 INFO L208 MainTranslator]: Completed translation [2022-12-06 07:24:17,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17 WrapperNode [2022-12-06 07:24:17,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 07:24:17,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 07:24:17,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 07:24:17,691 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 07:24:17,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17" (1/1) ... [2022-12-06 07:24:17,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17" (1/1) ... [2022-12-06 07:24:17,736 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 163 [2022-12-06 07:24:17,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 07:24:17,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 07:24:17,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 07:24:17,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 07:24:17,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17" (1/1) ... [2022-12-06 07:24:17,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17" (1/1) ... [2022-12-06 07:24:17,756 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17" (1/1) ... [2022-12-06 07:24:17,756 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17" (1/1) ... [2022-12-06 07:24:17,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17" (1/1) ... [2022-12-06 07:24:17,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17" (1/1) ... [2022-12-06 07:24:17,765 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17" (1/1) ... [2022-12-06 07:24:17,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17" (1/1) ... [2022-12-06 07:24:17,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 07:24:17,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 07:24:17,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 07:24:17,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 07:24:17,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17" (1/1) ... [2022-12-06 07:24:17,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 07:24:17,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 07:24:17,818 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 07:24:17,826 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 07:24:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 07:24:17,850 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 07:24:17,851 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 07:24:17,851 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 07:24:17,852 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 07:24:17,852 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 07:24:17,852 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 07:24:17,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 07:24:17,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 07:24:17,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 07:24:17,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 07:24:17,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 07:24:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 07:24:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 07:24:17,857 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 07:24:17,928 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 07:24:17,929 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 07:24:18,159 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 07:24:18,165 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 07:24:18,165 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-06 07:24:18,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:24:18 BoogieIcfgContainer [2022-12-06 07:24:18,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 07:24:18,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 07:24:18,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 07:24:18,170 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 07:24:18,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 07:24:17" (1/3) ... [2022-12-06 07:24:18,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f77272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:24:18, skipping insertion in model container [2022-12-06 07:24:18,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 07:24:17" (2/3) ... [2022-12-06 07:24:18,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10f77272 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 07:24:18, skipping insertion in model container [2022-12-06 07:24:18,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 07:24:18" (3/3) ... [2022-12-06 07:24:18,171 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-simpl-str-trans.wvr.c [2022-12-06 07:24:18,201 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 07:24:18,201 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 07:24:18,201 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 07:24:18,302 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 07:24:18,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 189 transitions, 402 flow [2022-12-06 07:24:18,424 INFO L130 PetriNetUnfolder]: 13/186 cut-off events. [2022-12-06 07:24:18,425 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:24:18,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 13/186 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 365 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2022-12-06 07:24:18,434 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 189 transitions, 402 flow [2022-12-06 07:24:18,443 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 176 transitions, 370 flow [2022-12-06 07:24:18,445 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:18,469 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 176 transitions, 370 flow [2022-12-06 07:24:18,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 176 transitions, 370 flow [2022-12-06 07:24:18,515 INFO L130 PetriNetUnfolder]: 13/176 cut-off events. [2022-12-06 07:24:18,518 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:24:18,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 176 events. 13/176 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 364 event pairs, 0 based on Foata normal form. 0/163 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2022-12-06 07:24:18,531 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 173 places, 176 transitions, 370 flow [2022-12-06 07:24:18,531 INFO L188 LiptonReduction]: Number of co-enabled transitions 9384 [2022-12-06 07:24:24,172 INFO L203 LiptonReduction]: Total number of compositions: 160 [2022-12-06 07:24:24,209 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 07:24:24,214 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;@79e1d219, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 07:24:24,215 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 07:24:24,222 INFO L130 PetriNetUnfolder]: 0/15 cut-off events. [2022-12-06 07:24:24,222 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 07:24:24,222 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:24,223 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:24,223 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 07:24:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:24,243 INFO L85 PathProgramCache]: Analyzing trace with hash -674131319, now seen corresponding path program 1 times [2022-12-06 07:24:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:24,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902019305] [2022-12-06 07:24:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:24,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:24,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:25,013 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 07:24:25,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:25,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902019305] [2022-12-06 07:24:25,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902019305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:25,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:25,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:24:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863855719] [2022-12-06 07:24:25,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:25,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:24:25,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:25,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:24:25,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:24:25,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 07:24:25,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 50 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:25,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:25,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 07:24:25,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:25,200 INFO L130 PetriNetUnfolder]: 38/100 cut-off events. [2022-12-06 07:24:25,200 INFO L131 PetriNetUnfolder]: For 28/28 co-relation queries the response was YES. [2022-12-06 07:24:25,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 100 events. 38/100 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 284 event pairs, 2 based on Foata normal form. 1/101 useless extension candidates. Maximal degree in co-relation 169. Up to 38 conditions per place. [2022-12-06 07:24:25,202 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 32 selfloop transitions, 6 changer transitions 7/45 dead transitions. [2022-12-06 07:24:25,202 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 45 transitions, 228 flow [2022-12-06 07:24:25,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:24:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:24:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-06 07:24:25,210 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4791666666666667 [2022-12-06 07:24:25,211 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 50 flow. Second operand 6 states and 46 transitions. [2022-12-06 07:24:25,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 45 transitions, 228 flow [2022-12-06 07:24:25,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 45 transitions, 196 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-12-06 07:24:25,214 INFO L231 Difference]: Finished difference. Result has 28 places, 20 transitions, 71 flow [2022-12-06 07:24:25,215 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=71, PETRI_PLACES=28, PETRI_TRANSITIONS=20} [2022-12-06 07:24:25,217 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2022-12-06 07:24:25,217 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:25,218 INFO L89 Accepts]: Start accepts. Operand has 28 places, 20 transitions, 71 flow [2022-12-06 07:24:25,219 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:25,220 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:25,220 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 28 places, 20 transitions, 71 flow [2022-12-06 07:24:25,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 20 transitions, 71 flow [2022-12-06 07:24:25,226 INFO L130 PetriNetUnfolder]: 2/31 cut-off events. [2022-12-06 07:24:25,227 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 07:24:25,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 31 events. 2/31 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 43 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 48. Up to 6 conditions per place. [2022-12-06 07:24:25,227 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 27 places, 20 transitions, 71 flow [2022-12-06 07:24:25,227 INFO L188 LiptonReduction]: Number of co-enabled transitions 48 [2022-12-06 07:24:25,241 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [745] $Ultimate##0-->thread3EXIT: Formula: (let ((.cse4 (= v_~length_0~0_In_9 0))) (let ((.cse0 (= |v_thread3Thread1of1ForFork0_#res#1.base_Out_18| 0)) (.cse2 (not .cse4)) (.cse1 (= v_~length_4~0_In_13 0)) (.cse3 (= |v_thread3Thread1of1ForFork0_#res#1.offset_Out_18| 0))) (or (and .cse0 (not .cse1) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_12| |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (<= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483647) (= v_~to_int_1~0_In_8 |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_8|) .cse2 (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_8| v_~to_int_5~0_In_8) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_8|) (<= 0 (+ |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| 2147483648)) (= (ite (or (<= 0 |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14|) (<= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_12| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| 2147483647))) 1 0) |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|) .cse3 (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_12| (+ |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|)) (= v_~result_8~0_Out_24 |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|)) (and (= |v_thread3Thread1of1ForFork0_minus_#res#1_Out_22| |v_thread3Thread1of1ForFork0_minus_#res#1_In_3|) (= |v_thread3Thread1of1ForFork0_minus_~a#1_Out_12| |v_thread3Thread1of1ForFork0_minus_~a#1_In_8|) (= |v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_8| |v_thread3Thread1of1ForFork0_minus_#in~a#1_In_2|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18| |v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_4|) (= |v_thread3Thread1of1ForFork0_minus_#in~b#1_In_3| |v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_8|) (= |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_3| |v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|) (= |v_thread3Thread1of1ForFork0_minus_~b#1_Out_14| |v_thread3Thread1of1ForFork0_minus_~b#1_In_7|) (or (and .cse0 .cse4 .cse3 (= (ite .cse1 0 1) v_~result_8~0_Out_24)) (and .cse0 .cse2 (= (+ v_~result_8~0_Out_24 1) 0) .cse1 .cse3)))))) InVars {~length_4~0=v_~length_4~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_In_3|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_In_4|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_In_3|, ~length_0~0=v_~length_0~0_In_9, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_In_7|, ~to_int_5~0=v_~to_int_5~0_In_8, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_In_8|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_In_2|, ~to_int_1~0=v_~to_int_1~0_In_8, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_In_3|} OutVars{thread3Thread1of1ForFork0_#t~ret7#1=|v_thread3Thread1of1ForFork0_#t~ret7#1_Out_18|, thread3Thread1of1ForFork0_#t~ite8#1=|v_thread3Thread1of1ForFork0_#t~ite8#1_Out_18|, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_Out_18|, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1_Out_26|, thread3Thread1of1ForFork0_#res#1.base=|v_thread3Thread1of1ForFork0_#res#1.base_Out_18|, ~result_8~0=v_~result_8~0_Out_24, thread3Thread1of1ForFork0_minus_~a#1=|v_thread3Thread1of1ForFork0_minus_~a#1_Out_12|, ~to_int_5~0=v_~to_int_5~0_In_8, thread3Thread1of1ForFork0_minus_#in~b#1=|v_thread3Thread1of1ForFork0_minus_#in~b#1_Out_8|, ~to_int_1~0=v_~to_int_1~0_In_8, thread3Thread1of1ForFork0_#res#1.offset=|v_thread3Thread1of1ForFork0_#res#1.offset_Out_18|, thread3Thread1of1ForFork0_#t~ite9#1=|v_thread3Thread1of1ForFork0_#t~ite9#1_Out_20|, ~length_4~0=v_~length_4~0_In_13, thread3Thread1of1ForFork0_minus_#res#1=|v_thread3Thread1of1ForFork0_minus_#res#1_Out_22|, ~length_0~0=v_~length_0~0_In_9, thread3Thread1of1ForFork0_minus_~b#1=|v_thread3Thread1of1ForFork0_minus_~b#1_Out_14|, thread3Thread1of1ForFork0_minus_#in~a#1=|v_thread3Thread1of1ForFork0_minus_#in~a#1_Out_8|} AuxVars[] AssignedVars[thread3Thread1of1ForFork0_#t~ret7#1, thread3Thread1of1ForFork0_#t~ite8#1, thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork0_#res#1.base, ~result_8~0, thread3Thread1of1ForFork0_minus_~a#1, thread3Thread1of1ForFork0_minus_#in~b#1, thread3Thread1of1ForFork0_#res#1.offset, thread3Thread1of1ForFork0_#t~ite9#1, thread3Thread1of1ForFork0_minus_#res#1, thread3Thread1of1ForFork0_minus_~b#1, thread3Thread1of1ForFork0_minus_#in~a#1] and [747] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse4 (= v_~length_0~0_In_11 0))) (let ((.cse1 (not .cse4)) (.cse2 (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_20| 0)) (.cse3 (= |v_thread1Thread1of1ForFork1_#res#1.base_Out_20| 0)) (.cse0 (= v_~length_2~0_In_13 0))) (or (and (= |v_thread1Thread1of1ForFork1_minus_~b#1_In_8| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_14|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22|) (or (and .cse0 .cse1 .cse2 (= (+ v_~result_6~0_Out_30 1) 0) .cse3) (and (= (ite .cse0 0 1) v_~result_6~0_Out_30) .cse4 .cse2 .cse3)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_In_5| |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_10|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_In_4| |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_10|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_In_2| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_18|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_In_8| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_12|)) (and (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_14|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_12| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_14|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_18|)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_10| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_12|) (= v_~result_6~0_Out_30 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_18|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_12| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_Out_14| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_18|)) .cse1 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_10| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_14|) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) (= v_~to_int_3~0_In_11 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_10|) .cse3 (= v_~to_int_1~0_In_10 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_10|) (<= |v_thread1Thread1of1ForFork1_minus_#res#1_Out_18| 2147483647) (not .cse0))))) InVars {thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_In_5|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_In_4|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_In_8|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_In_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_6|, ~length_0~0=v_~length_0~0_In_11, ~length_2~0=v_~length_2~0_In_13, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_In_8|, ~to_int_3~0=v_~to_int_3~0_In_11, ~to_int_1~0=v_~to_int_1~0_In_10, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_3|} OutVars{thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_Out_22|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_Out_22|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_10|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_18|, ~result_6~0=v_~result_6~0_Out_30, ~to_int_3~0=v_~to_int_3~0_In_11, ~to_int_1~0=v_~to_int_1~0_In_10, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_10|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_14|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_Out_26|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|, ~length_0~0=v_~length_0~0_In_11, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_20|, ~length_2~0=v_~length_2~0_In_13, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_20|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, ~result_6~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] [2022-12-06 07:24:25,704 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:24:25,705 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 488 [2022-12-06 07:24:25,705 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 78 flow [2022-12-06 07:24:25,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:25,705 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:25,705 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:25,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 07:24:25,706 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 07:24:25,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:25,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1986284327, now seen corresponding path program 2 times [2022-12-06 07:24:25,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:25,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708576049] [2022-12-06 07:24:25,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:25,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:25,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:26,109 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 07:24:26,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:26,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708576049] [2022-12-06 07:24:26,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708576049] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:26,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:26,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:24:26,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490508286] [2022-12-06 07:24:26,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:26,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:24:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:24:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:24:26,119 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 17 [2022-12-06 07:24:26,119 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 78 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:26,119 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:26,119 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 17 [2022-12-06 07:24:26,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:26,266 INFO L130 PetriNetUnfolder]: 39/119 cut-off events. [2022-12-06 07:24:26,266 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-06 07:24:26,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 119 events. 39/119 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 437 event pairs, 7 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 319. Up to 60 conditions per place. [2022-12-06 07:24:26,269 INFO L137 encePairwiseOnDemand]: 11/17 looper letters, 29 selfloop transitions, 8 changer transitions 11/48 dead transitions. [2022-12-06 07:24:26,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 48 transitions, 251 flow [2022-12-06 07:24:26,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:24:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:24:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-12-06 07:24:26,271 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.45098039215686275 [2022-12-06 07:24:26,271 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 78 flow. Second operand 6 states and 46 transitions. [2022-12-06 07:24:26,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 48 transitions, 251 flow [2022-12-06 07:24:26,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 48 transitions, 247 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-06 07:24:26,273 INFO L231 Difference]: Finished difference. Result has 34 places, 22 transitions, 103 flow [2022-12-06 07:24:26,274 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=17, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=103, PETRI_PLACES=34, PETRI_TRANSITIONS=22} [2022-12-06 07:24:26,274 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2022-12-06 07:24:26,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:26,274 INFO L89 Accepts]: Start accepts. Operand has 34 places, 22 transitions, 103 flow [2022-12-06 07:24:26,276 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:26,276 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:26,276 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 22 transitions, 103 flow [2022-12-06 07:24:26,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 22 transitions, 103 flow [2022-12-06 07:24:26,284 INFO L130 PetriNetUnfolder]: 1/39 cut-off events. [2022-12-06 07:24:26,284 INFO L131 PetriNetUnfolder]: For 29/33 co-relation queries the response was YES. [2022-12-06 07:24:26,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 39 events. 1/39 cut-off events. For 29/33 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 95 event pairs, 0 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 71. Up to 7 conditions per place. [2022-12-06 07:24:26,285 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 103 flow [2022-12-06 07:24:26,285 INFO L188 LiptonReduction]: Number of co-enabled transitions 50 [2022-12-06 07:24:26,300 ERROR L112 fgCompositionFactory]: Composing non-subsequent actions: [747] $Ultimate##0-->thread1EXIT: Formula: (let ((.cse4 (= v_~length_0~0_In_11 0))) (let ((.cse1 (not .cse4)) (.cse2 (= |v_thread1Thread1of1ForFork1_#res#1.offset_Out_20| 0)) (.cse3 (= |v_thread1Thread1of1ForFork1_#res#1.base_Out_20| 0)) (.cse0 (= v_~length_2~0_In_13 0))) (or (and (= |v_thread1Thread1of1ForFork1_minus_~b#1_In_8| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_14|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_3| |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22|) (or (and .cse0 .cse1 .cse2 (= (+ v_~result_6~0_Out_30 1) 0) .cse3) (and (= (ite .cse0 0 1) v_~result_6~0_Out_30) .cse4 .cse2 .cse3)) (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_In_5| |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_10|) (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_6| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_In_4| |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_10|) (= |v_thread1Thread1of1ForFork1_minus_#res#1_In_2| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_18|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_In_8| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_12|)) (and (= (ite (or (<= 0 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_14|) (<= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_12| (+ 2147483647 |v_thread1Thread1of1ForFork1_minus_~b#1_Out_14|))) 1 0) |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) (<= 0 (+ 2147483648 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_18|)) (= |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_10| |v_thread1Thread1of1ForFork1_minus_~a#1_Out_12|) (= v_~result_6~0_Out_30 |v_thread1Thread1of1ForFork1_minus_#res#1_Out_18|) (= |v_thread1Thread1of1ForFork1_minus_~a#1_Out_12| (+ |v_thread1Thread1of1ForFork1_minus_~b#1_Out_14| |v_thread1Thread1of1ForFork1_minus_#res#1_Out_18|)) .cse1 (= |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_10| |v_thread1Thread1of1ForFork1_minus_~b#1_Out_14|) .cse2 (= |v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22| |v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|) (= v_~to_int_3~0_In_11 |v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_10|) .cse3 (= v_~to_int_1~0_In_10 |v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_10|) (<= |v_thread1Thread1of1ForFork1_minus_#res#1_Out_18| 2147483647) (not .cse0))))) InVars {thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_In_5|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_In_4|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_In_8|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_In_2|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_In_6|, ~length_0~0=v_~length_0~0_In_11, ~length_2~0=v_~length_2~0_In_13, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_In_8|, ~to_int_3~0=v_~to_int_3~0_In_11, ~to_int_1~0=v_~to_int_1~0_In_10, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_In_3|} OutVars{thread1Thread1of1ForFork1_#t~ite2#1=|v_thread1Thread1of1ForFork1_#t~ite2#1_Out_22|, thread1Thread1of1ForFork1_#t~ret1#1=|v_thread1Thread1of1ForFork1_#t~ret1#1_Out_22|, thread1Thread1of1ForFork1_minus_#in~a#1=|v_thread1Thread1of1ForFork1_minus_#in~a#1_Out_10|, thread1Thread1of1ForFork1_minus_#res#1=|v_thread1Thread1of1ForFork1_minus_#res#1_Out_18|, ~result_6~0=v_~result_6~0_Out_30, ~to_int_3~0=v_~to_int_3~0_In_11, ~to_int_1~0=v_~to_int_1~0_In_10, thread1Thread1of1ForFork1_minus_#in~b#1=|v_thread1Thread1of1ForFork1_minus_#in~b#1_Out_10|, thread1Thread1of1ForFork1_minus_~b#1=|v_thread1Thread1of1ForFork1_minus_~b#1_Out_14|, thread1Thread1of1ForFork1_#t~ite3#1=|v_thread1Thread1of1ForFork1_#t~ite3#1_Out_26|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_Out_16|, ~length_0~0=v_~length_0~0_In_11, thread1Thread1of1ForFork1_#res#1.offset=|v_thread1Thread1of1ForFork1_#res#1.offset_Out_20|, ~length_2~0=v_~length_2~0_In_13, thread1Thread1of1ForFork1_minus_~a#1=|v_thread1Thread1of1ForFork1_minus_~a#1_Out_12|, thread1Thread1of1ForFork1_#res#1.base=|v_thread1Thread1of1ForFork1_#res#1.base_Out_20|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_Out_22|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~ite2#1, thread1Thread1of1ForFork1_#t~ret1#1, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#res#1, ~result_6~0, thread1Thread1of1ForFork1_minus_#in~b#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_#t~ite3#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread1Thread1of1ForFork1_#res#1.offset, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_#res#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1] and [746] $Ultimate##0-->thread2EXIT: Formula: (let ((.cse4 (= v_~length_2~0_In_11 0))) (let ((.cse0 (not .cse4)) (.cse2 (= |v_thread2Thread1of1ForFork2_#res#1.offset_Out_26| 0)) (.cse3 (= |v_thread2Thread1of1ForFork2_#res#1.base_Out_26| 0)) (.cse1 (= v_~length_4~0_In_15 0))) (or (and (= |v_thread2Thread1of1ForFork2_minus_~b#1_In_11| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_14|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| |v_thread2Thread1of1ForFork2_minus_#in~b#1_In_4|) (= |v_thread2Thread1of1ForFork2_minus_~a#1_In_11| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_In_4| |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10|) (= |v_thread2Thread1of1ForFork2_minus_#res#1_In_3| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_6| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_3| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_20|) (or (and (= 0 (+ v_~result_7~0_Out_34 1)) .cse0 .cse1 .cse2 .cse3) (and .cse4 (= v_~result_7~0_Out_34 (ite .cse1 0 1)) .cse2 .cse3))) (and (<= |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22| 2147483647) (= v_~to_int_3~0_In_9 |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| |v_thread2Thread1of1ForFork2_minus_~b#1_Out_14|) (= |v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10| |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|) (<= 0 (+ |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22| 2147483648)) (= v_~result_7~0_Out_34 |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_20| |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|) (= (+ |v_thread2Thread1of1ForFork2_minus_~b#1_Out_14| |v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|) |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|) .cse0 (= (ite (or (<= |v_thread2Thread1of1ForFork2_minus_~a#1_Out_14| (+ 2147483647 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_14|)) (<= 0 |v_thread2Thread1of1ForFork2_minus_~b#1_Out_14|)) 1 0) |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|) (= |v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10| v_~to_int_5~0_In_10) .cse2 .cse3 (not .cse1))))) InVars {~length_4~0=v_~length_4~0_In_15, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_In_3|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_In_11|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_In_11|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_In_4|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_In_4|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_In_3|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_In_6|, ~length_2~0=v_~length_2~0_In_11, ~to_int_5~0=v_~to_int_5~0_In_10, ~to_int_3~0=v_~to_int_3~0_In_9} OutVars{thread2Thread1of1ForFork2_#res#1.offset=|v_thread2Thread1of1ForFork2_#res#1.offset_Out_26|, thread2Thread1of1ForFork2_minus_~b#1=|v_thread2Thread1of1ForFork2_minus_~b#1_Out_14|, thread2Thread1of1ForFork2_minus_#res#1=|v_thread2Thread1of1ForFork2_minus_#res#1_Out_22|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_Out_16|, ~result_7~0=v_~result_7~0_Out_34, thread2Thread1of1ForFork2_#res#1.base=|v_thread2Thread1of1ForFork2_#res#1.base_Out_26|, ~to_int_5~0=v_~to_int_5~0_In_10, ~to_int_3~0=v_~to_int_3~0_In_9, ~length_4~0=v_~length_4~0_In_15, thread2Thread1of1ForFork2_#t~ret4#1=|v_thread2Thread1of1ForFork2_#t~ret4#1_Out_22|, thread2Thread1of1ForFork2_#t~ite5#1=|v_thread2Thread1of1ForFork2_#t~ite5#1_Out_28|, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_Out_20|, thread2Thread1of1ForFork2_minus_~a#1=|v_thread2Thread1of1ForFork2_minus_~a#1_Out_14|, thread2Thread1of1ForFork2_minus_#in~a#1=|v_thread2Thread1of1ForFork2_minus_#in~a#1_Out_10|, thread2Thread1of1ForFork2_minus_#in~b#1=|v_thread2Thread1of1ForFork2_minus_#in~b#1_Out_10|, ~length_2~0=v_~length_2~0_In_11, thread2Thread1of1ForFork2_#t~ite6#1=|v_thread2Thread1of1ForFork2_#t~ite6#1_Out_26|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#res#1.offset, thread2Thread1of1ForFork2_minus_~b#1, thread2Thread1of1ForFork2_minus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, ~result_7~0, thread2Thread1of1ForFork2_#res#1.base, thread2Thread1of1ForFork2_#t~ret4#1, thread2Thread1of1ForFork2_#t~ite5#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork2_minus_~a#1, thread2Thread1of1ForFork2_minus_#in~a#1, thread2Thread1of1ForFork2_minus_#in~b#1, thread2Thread1of1ForFork2_#t~ite6#1] [2022-12-06 07:24:26,885 INFO L203 LiptonReduction]: Total number of compositions: 1 [2022-12-06 07:24:26,886 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 612 [2022-12-06 07:24:26,886 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 22 transitions, 109 flow [2022-12-06 07:24:26,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:26,886 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:26,886 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:26,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 07:24:26,887 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 07:24:26,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:26,887 INFO L85 PathProgramCache]: Analyzing trace with hash 799401121, now seen corresponding path program 1 times [2022-12-06 07:24:26,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:26,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025890724] [2022-12-06 07:24:26,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:26,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:27,195 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 07:24:27,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:27,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025890724] [2022-12-06 07:24:27,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025890724] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:27,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:27,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-06 07:24:27,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489888346] [2022-12-06 07:24:27,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:27,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 07:24:27,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:27,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 07:24:27,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-06 07:24:27,196 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 18 [2022-12-06 07:24:27,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 22 transitions, 109 flow. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:27,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:27,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 18 [2022-12-06 07:24:27,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:27,270 INFO L130 PetriNetUnfolder]: 31/99 cut-off events. [2022-12-06 07:24:27,270 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2022-12-06 07:24:27,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 99 events. 31/99 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 333 event pairs, 6 based on Foata normal form. 1/100 useless extension candidates. Maximal degree in co-relation 312. Up to 61 conditions per place. [2022-12-06 07:24:27,271 INFO L137 encePairwiseOnDemand]: 12/18 looper letters, 25 selfloop transitions, 4 changer transitions 9/38 dead transitions. [2022-12-06 07:24:27,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 217 flow [2022-12-06 07:24:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 07:24:27,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 07:24:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-12-06 07:24:27,272 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4222222222222222 [2022-12-06 07:24:27,272 INFO L175 Difference]: Start difference. First operand has 34 places, 22 transitions, 109 flow. Second operand 5 states and 38 transitions. [2022-12-06 07:24:27,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 217 flow [2022-12-06 07:24:27,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 208 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-06 07:24:27,273 INFO L231 Difference]: Finished difference. Result has 37 places, 18 transitions, 78 flow [2022-12-06 07:24:27,273 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=18, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=37, PETRI_TRANSITIONS=18} [2022-12-06 07:24:27,274 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 11 predicate places. [2022-12-06 07:24:27,274 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:27,274 INFO L89 Accepts]: Start accepts. Operand has 37 places, 18 transitions, 78 flow [2022-12-06 07:24:27,275 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:27,275 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:27,275 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 18 transitions, 78 flow [2022-12-06 07:24:27,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 18 transitions, 78 flow [2022-12-06 07:24:27,278 INFO L130 PetriNetUnfolder]: 0/29 cut-off events. [2022-12-06 07:24:27,278 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-12-06 07:24:27,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 29 events. 0/29 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 45 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2022-12-06 07:24:27,279 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 18 transitions, 78 flow [2022-12-06 07:24:27,279 INFO L188 LiptonReduction]: Number of co-enabled transitions 42 [2022-12-06 07:24:27,279 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:27,280 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 6 [2022-12-06 07:24:27,280 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 18 transitions, 78 flow [2022-12-06 07:24:27,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:27,280 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:27,280 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:27,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 07:24:27,280 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 07:24:27,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:27,281 INFO L85 PathProgramCache]: Analyzing trace with hash 757506605, now seen corresponding path program 3 times [2022-12-06 07:24:27,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:27,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220895785] [2022-12-06 07:24:27,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:27,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:27,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:27,598 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 07:24:27,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:27,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220895785] [2022-12-06 07:24:27,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220895785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:27,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:27,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:24:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054915567] [2022-12-06 07:24:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:27,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:24:27,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:27,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:24:27,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:24:27,601 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 07:24:27,601 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 18 transitions, 78 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:27,601 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:27,603 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 07:24:27,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:27,754 INFO L130 PetriNetUnfolder]: 28/84 cut-off events. [2022-12-06 07:24:27,754 INFO L131 PetriNetUnfolder]: For 111/111 co-relation queries the response was YES. [2022-12-06 07:24:27,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 84 events. 28/84 cut-off events. For 111/111 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 245 event pairs, 2 based on Foata normal form. 1/85 useless extension candidates. Maximal degree in co-relation 269. Up to 37 conditions per place. [2022-12-06 07:24:27,754 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 23 selfloop transitions, 4 changer transitions 12/39 dead transitions. [2022-12-06 07:24:27,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 215 flow [2022-12-06 07:24:27,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:24:27,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:24:27,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-12-06 07:24:27,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2022-12-06 07:24:27,758 INFO L175 Difference]: Start difference. First operand has 34 places, 18 transitions, 78 flow. Second operand 6 states and 40 transitions. [2022-12-06 07:24:27,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 215 flow [2022-12-06 07:24:27,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 200 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-12-06 07:24:27,759 INFO L231 Difference]: Finished difference. Result has 35 places, 16 transitions, 63 flow [2022-12-06 07:24:27,759 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=63, PETRI_PLACES=35, PETRI_TRANSITIONS=16} [2022-12-06 07:24:27,759 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2022-12-06 07:24:27,760 WARN L163 eatedLiptonReduction]: Counterexample is not a run of mAbstraction. Replaying acceptance of the word... [2022-12-06 07:24:27,760 INFO L89 Accepts]: Start accepts. Operand has 35 places, 16 transitions, 63 flow [2022-12-06 07:24:27,760 INFO L95 Accepts]: Finished accepts. [2022-12-06 07:24:27,760 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:27,760 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 16 transitions, 63 flow [2022-12-06 07:24:27,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 16 transitions, 63 flow [2022-12-06 07:24:27,763 INFO L130 PetriNetUnfolder]: 0/16 cut-off events. [2022-12-06 07:24:27,763 INFO L131 PetriNetUnfolder]: For 5/6 co-relation queries the response was YES. [2022-12-06 07:24:27,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 16 events. 0/16 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 5 event pairs, 0 based on Foata normal form. 0/16 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2022-12-06 07:24:27,763 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 16 transitions, 63 flow [2022-12-06 07:24:27,763 INFO L188 LiptonReduction]: Number of co-enabled transitions 22 [2022-12-06 07:24:27,764 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:27,764 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 4 [2022-12-06 07:24:27,764 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 16 transitions, 63 flow [2022-12-06 07:24:27,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:27,765 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 07:24:27,765 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 07:24:27,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 07:24:27,765 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 07:24:27,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 07:24:27,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1563980471, now seen corresponding path program 4 times [2022-12-06 07:24:27,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 07:24:27,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019186609] [2022-12-06 07:24:27,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 07:24:27,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 07:24:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 07:24:28,052 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 07:24:28,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 07:24:28,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019186609] [2022-12-06 07:24:28,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019186609] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 07:24:28,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 07:24:28,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 07:24:28,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702178845] [2022-12-06 07:24:28,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 07:24:28,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 07:24:28,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 07:24:28,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 07:24:28,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 07:24:28,055 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 16 [2022-12-06 07:24:28,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 16 transitions, 63 flow. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:28,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 07:24:28,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 16 [2022-12-06 07:24:28,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 07:24:28,199 INFO L130 PetriNetUnfolder]: 11/37 cut-off events. [2022-12-06 07:24:28,199 INFO L131 PetriNetUnfolder]: For 38/38 co-relation queries the response was YES. [2022-12-06 07:24:28,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 37 events. 11/37 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 0 based on Foata normal form. 1/38 useless extension candidates. Maximal degree in co-relation 127. Up to 12 conditions per place. [2022-12-06 07:24:28,199 INFO L137 encePairwiseOnDemand]: 11/16 looper letters, 0 selfloop transitions, 0 changer transitions 26/26 dead transitions. [2022-12-06 07:24:28,199 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 26 transitions, 137 flow [2022-12-06 07:24:28,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 07:24:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 07:24:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-12-06 07:24:28,200 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.28125 [2022-12-06 07:24:28,200 INFO L175 Difference]: Start difference. First operand has 32 places, 16 transitions, 63 flow. Second operand 6 states and 27 transitions. [2022-12-06 07:24:28,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 26 transitions, 137 flow [2022-12-06 07:24:28,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 120 flow, removed 2 selfloop flow, removed 6 redundant places. [2022-12-06 07:24:28,201 INFO L231 Difference]: Finished difference. Result has 30 places, 0 transitions, 0 flow [2022-12-06 07:24:28,201 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=16, PETRI_DIFFERENCE_MINUEND_FLOW=43, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=30, PETRI_TRANSITIONS=0} [2022-12-06 07:24:28,202 INFO L294 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2022-12-06 07:24:28,202 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-06 07:24:28,202 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 30 places, 0 transitions, 0 flow [2022-12-06 07:24:28,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 0 places, 0 transitions, 0 flow [2022-12-06 07:24:28,202 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-06 07:24:28,202 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-06 07:24:28,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 0 conditions, 0 events. 0/0 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 0. Compared 0 event pairs, 0 based on Foata normal form. 0/0 useless extension candidates. Maximal degree in co-relation 0. Up to 0 conditions per place. [2022-12-06 07:24:28,202 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 0 places, 0 transitions, 0 flow [2022-12-06 07:24:28,203 INFO L188 LiptonReduction]: Number of co-enabled transitions 0 [2022-12-06 07:24:28,203 INFO L203 LiptonReduction]: Total number of compositions: 0 [2022-12-06 07:24:28,203 INFO L143 eatedLiptonReduction]: Time needed for LBE in milliseconds: 1 [2022-12-06 07:24:28,203 INFO L495 AbstractCegarLoop]: Abstraction has has 0 places, 0 transitions, 0 flow [2022-12-06 07:24:28,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 07:24:28,205 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 07:24:28,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 07:24:28,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 07:24:28,206 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 07:24:28,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 07:24:28,206 INFO L458 BasicCegarLoop]: Path program histogram: [4, 1] [2022-12-06 07:24:28,208 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 07:24:28,208 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 07:24:28,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 07:24:28 BasicIcfg [2022-12-06 07:24:28,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 07:24:28,216 INFO L158 Benchmark]: Toolchain (without parser) took 10760.56ms. Allocated memory was 204.5MB in the beginning and 408.9MB in the end (delta: 204.5MB). Free memory was 179.8MB in the beginning and 378.4MB in the end (delta: -198.5MB). Peak memory consumption was 5.9MB. Max. memory is 8.0GB. [2022-12-06 07:24:28,217 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory is still 181.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:24:28,217 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.82ms. Allocated memory is still 204.5MB. Free memory was 179.8MB in the beginning and 168.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 07:24:28,217 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.33ms. Allocated memory is still 204.5MB. Free memory was 168.8MB in the beginning and 166.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:24:28,219 INFO L158 Benchmark]: Boogie Preprocessor took 30.76ms. Allocated memory is still 204.5MB. Free memory was 166.7MB in the beginning and 165.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 07:24:28,221 INFO L158 Benchmark]: RCFGBuilder took 398.60ms. Allocated memory is still 204.5MB. Free memory was 165.1MB in the beginning and 147.3MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-06 07:24:28,221 INFO L158 Benchmark]: TraceAbstraction took 10042.37ms. Allocated memory was 204.5MB in the beginning and 408.9MB in the end (delta: 204.5MB). Free memory was 146.3MB in the beginning and 378.4MB in the end (delta: -232.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 07:24:28,222 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 204.5MB. Free memory is still 181.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 237.82ms. Allocated memory is still 204.5MB. Free memory was 179.8MB in the beginning and 168.8MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.33ms. Allocated memory is still 204.5MB. Free memory was 168.8MB in the beginning and 166.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.76ms. Allocated memory is still 204.5MB. Free memory was 166.7MB in the beginning and 165.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 398.60ms. Allocated memory is still 204.5MB. Free memory was 165.1MB in the beginning and 147.3MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 10042.37ms. Allocated memory was 204.5MB in the beginning and 408.9MB in the end (delta: 204.5MB). Free memory was 146.3MB in the beginning and 378.4MB in the end (delta: -232.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 173 PlacesBefore, 26 PlacesAfterwards, 176 TransitionsBefore, 16 TransitionsAfterwards, 9384 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 48 TrivialYvCompositions, 99 ConcurrentYvCompositions, 13 ChoiceCompositions, 160 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6294, independent: 6294, independent conditional: 6294, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6294, independent: 6294, independent conditional: 0, independent unconditional: 6294, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6294, independent: 6294, independent conditional: 0, independent unconditional: 6294, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6294, independent: 6294, independent conditional: 0, independent unconditional: 6294, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5558, independent: 5558, independent conditional: 0, independent unconditional: 5558, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5558, independent: 5558, independent conditional: 0, independent unconditional: 5558, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6294, independent: 736, independent conditional: 0, independent unconditional: 736, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5558, unknown conditional: 0, unknown unconditional: 5558] , Statistics on independence cache: Total cache size (in pairs): 12299, Positive cache size: 12299, Positive conditional cache size: 0, Positive unconditional cache size: 12299, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.5s, 27 PlacesBefore, 28 PlacesAfterwards, 20 TransitionsBefore, 21 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 6, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, independent: 6, independent conditional: 0, independent unconditional: 6, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 6, Positive conditional cache size: 0, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.6s, 33 PlacesBefore, 34 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 50 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 15, independent: 15, independent conditional: 15, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 5, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, independent: 10, independent conditional: 10, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 34 PlacesBefore, 34 PlacesAfterwards, 18 TransitionsBefore, 18 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 32 PlacesBefore, 32 PlacesAfterwards, 16 TransitionsBefore, 16 TransitionsAfterwards, 22 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 0.0s, 0 PlacesBefore, 0 PlacesAfterwards, 0 TransitionsBefore, 0 TransitionsAfterwards, 0 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 11, Positive conditional cache size: 5, Positive unconditional cache size: 6, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - PositiveResult [Line: 80]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 273 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.9s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 382 IncrementalHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 0 mSDtfsCounter, 382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=2, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 74 ConstructedInterpolants, 0 QuantifiedInterpolants, 859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-12-06 07:24:28,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...