./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 03:06:15,756 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 03:06:15,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 03:06:15,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 03:06:15,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 03:06:15,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 03:06:15,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 03:06:15,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 03:06:15,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 03:06:15,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 03:06:15,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 03:06:15,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 03:06:15,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 03:06:15,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 03:06:15,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 03:06:15,814 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 03:06:15,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 03:06:15,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 03:06:15,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 03:06:15,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 03:06:15,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 03:06:15,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 03:06:15,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 03:06:15,833 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 03:06:15,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 03:06:15,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 03:06:15,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 03:06:15,852 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 03:06:15,852 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 03:06:15,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 03:06:15,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 03:06:15,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 03:06:15,854 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 03:06:15,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 03:06:15,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 03:06:15,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 03:06:15,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 03:06:15,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 03:06:15,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 03:06:15,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 03:06:15,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 03:06:15,858 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 03:06:15,884 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 03:06:15,886 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 03:06:15,887 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 03:06:15,888 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 03:06:15,888 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 03:06:15,889 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 03:06:15,889 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 03:06:15,890 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 03:06:15,890 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 03:06:15,890 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 03:06:15,890 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 03:06:15,891 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 03:06:15,891 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 03:06:15,891 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 03:06:15,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 03:06:15,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 03:06:15,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 03:06:15,892 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 03:06:15,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 03:06:15,892 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 03:06:15,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 03:06:15,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 03:06:15,892 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 03:06:15,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 03:06:15,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:06:15,893 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 03:06:15,893 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 03:06:15,893 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 03:06:15,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 03:06:15,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 03:06:15,894 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 03:06:15,894 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 03:06:15,894 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 03:06:15,894 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f83ae5bec1717d6f197d4259600c0d1f406909832409df09253b7bf70d3f66fc [2021-12-28 03:06:16,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 03:06:16,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 03:06:16,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 03:06:16,149 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 03:06:16,151 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 03:06:16,152 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2021-12-28 03:06:16,195 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f500ca2e3/eb58cb388d1f406daed2bae3b607206e/FLAG0d83134fe [2021-12-28 03:06:16,545 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 03:06:16,546 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c [2021-12-28 03:06:16,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f500ca2e3/eb58cb388d1f406daed2bae3b607206e/FLAG0d83134fe [2021-12-28 03:06:16,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f500ca2e3/eb58cb388d1f406daed2bae3b607206e [2021-12-28 03:06:16,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 03:06:16,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 03:06:16,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 03:06:16,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 03:06:16,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 03:06:16,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:06:16" (1/1) ... [2021-12-28 03:06:16,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e8d085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:06:16, skipping insertion in model container [2021-12-28 03:06:16,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:06:16" (1/1) ... [2021-12-28 03:06:16,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 03:06:16,980 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 03:06:17,110 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2021-12-28 03:06:17,116 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:06:17,123 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 03:06:17,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2021-12-28 03:06:17,169 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 03:06:17,211 INFO L208 MainTranslator]: Completed translation [2021-12-28 03:06:17,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:06:17 WrapperNode [2021-12-28 03:06:17,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 03:06:17,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 03:06:17,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 03:06:17,214 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 03:06:17,218 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:06:17" (1/1) ... [2021-12-28 03:06:17,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:06:17" (1/1) ... [2021-12-28 03:06:17,271 INFO L137 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 346 [2021-12-28 03:06:17,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 03:06:17,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 03:06:17,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 03:06:17,272 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 03:06:17,278 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:06:17" (1/1) ... [2021-12-28 03:06:17,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:06:17" (1/1) ... [2021-12-28 03:06:17,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:06:17" (1/1) ... [2021-12-28 03:06:17,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:06:17" (1/1) ... [2021-12-28 03:06:17,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:06:17" (1/1) ... [2021-12-28 03:06:17,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:06:17" (1/1) ... [2021-12-28 03:06:17,317 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:06:17" (1/1) ... [2021-12-28 03:06:17,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 03:06:17,322 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 03:06:17,322 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 03:06:17,322 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 03:06:17,323 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:06:17" (1/1) ... [2021-12-28 03:06:17,331 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 03:06:17,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:06:17,350 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) [2021-12-28 03:06:17,361 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 [2021-12-28 03:06:17,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 03:06:17,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 03:06:17,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 03:06:17,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 03:06:17,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-28 03:06:17,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-28 03:06:17,389 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-28 03:06:17,389 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-28 03:06:17,390 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-28 03:06:17,391 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-28 03:06:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2021-12-28 03:06:17,391 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2021-12-28 03:06:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 03:06:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-28 03:06:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-28 03:06:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 03:06:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 03:06:17,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 03:06:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 03:06:17,393 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-28 03:06:17,502 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 03:06:17,504 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 03:06:17,850 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 03:06:17,952 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 03:06:17,953 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-12-28 03:06:17,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:06:17 BoogieIcfgContainer [2021-12-28 03:06:17,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 03:06:17,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 03:06:17,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 03:06:17,958 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 03:06:17,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:06:16" (1/3) ... [2021-12-28 03:06:17,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c50332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:06:17, skipping insertion in model container [2021-12-28 03:06:17,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:06:17" (2/3) ... [2021-12-28 03:06:17,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11c50332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:06:17, skipping insertion in model container [2021-12-28 03:06:17,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:06:17" (3/3) ... [2021-12-28 03:06:17,963 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2021-12-28 03:06:17,966 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-28 03:06:17,966 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 03:06:17,966 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 03:06:17,967 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-28 03:06:18,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,013 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,014 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,015 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,016 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,016 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,016 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,016 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,016 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,016 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,017 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,017 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,017 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,017 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,017 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,018 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,018 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,018 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,018 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,018 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,019 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,020 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,021 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,022 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,022 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,023 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,024 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,024 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,024 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,024 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,025 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,025 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,025 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,025 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,025 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,025 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,026 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,026 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,026 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,026 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,026 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,026 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,028 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,028 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,028 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,028 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,028 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,029 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,029 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,031 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,031 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,031 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,032 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,032 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,032 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,033 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,033 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,033 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,037 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,037 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,037 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,037 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,037 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,038 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,038 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,038 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,038 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,038 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,039 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,040 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,041 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,044 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,044 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,047 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,047 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,047 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~post15#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,047 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,047 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_~cond~3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,047 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~mem13#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,047 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,048 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#t~ret14#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,048 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,048 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,048 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,048 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,048 WARN L322 ript$VariableManager]: TermVariabe |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,049 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,049 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_~cond~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,049 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,049 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,050 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,050 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,050 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,050 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,050 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,050 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post9#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,051 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem10#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,051 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,051 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~post12#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,051 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,051 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,051 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,051 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_~cond~2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,052 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,052 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~a#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,052 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_#in~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,052 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,053 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_plus_~b#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,053 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~ret11#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,054 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_~cond~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,055 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork3_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-28 03:06:18,060 INFO L148 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2021-12-28 03:06:18,105 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 03:06:18,112 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 03:06:18,112 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-12-28 03:06:18,125 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 256 places, 265 transitions, 562 flow [2021-12-28 03:06:18,182 INFO L129 PetriNetUnfolder]: 22/261 cut-off events. [2021-12-28 03:06:18,183 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-28 03:06:18,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 261 events. 22/261 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 128 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 222. Up to 2 conditions per place. [2021-12-28 03:06:18,187 INFO L82 GeneralOperation]: Start removeDead. Operand has 256 places, 265 transitions, 562 flow [2021-12-28 03:06:18,191 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 239 places, 248 transitions, 520 flow [2021-12-28 03:06:18,228 INFO L129 PetriNetUnfolder]: 22/247 cut-off events. [2021-12-28 03:06:18,229 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-12-28 03:06:18,229 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:18,230 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:18,230 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:18,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:18,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1929909788, now seen corresponding path program 1 times [2021-12-28 03:06:18,240 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:18,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531214169] [2021-12-28 03:06:18,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:18,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:06:18,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:18,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531214169] [2021-12-28 03:06:18,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531214169] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:06:18,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:06:18,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 03:06:18,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984052590] [2021-12-28 03:06:18,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:06:18,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-28 03:06:18,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-28 03:06:18,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 03:06:18,493 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 265 [2021-12-28 03:06:18,498 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 248 transitions, 520 flow. Second operand has 2 states, 2 states have (on average 242.0) internal successors, (484), 2 states have internal predecessors, (484), 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) [2021-12-28 03:06:18,499 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:18,499 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 265 [2021-12-28 03:06:18,500 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:06:18,616 INFO L129 PetriNetUnfolder]: 124/548 cut-off events. [2021-12-28 03:06:18,616 INFO L130 PetriNetUnfolder]: For 105/106 co-relation queries the response was YES. [2021-12-28 03:06:18,620 INFO L84 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 548 events. 124/548 cut-off events. For 105/106 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1720 event pairs, 51 based on Foata normal form. 128/613 useless extension candidates. Maximal degree in co-relation 504. Up to 163 conditions per place. [2021-12-28 03:06:18,622 INFO L132 encePairwiseOnDemand]: 250/265 looper letters, 12 selfloop transitions, 0 changer transitions 8/233 dead transitions. [2021-12-28 03:06:18,623 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 233 transitions, 514 flow [2021-12-28 03:06:18,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-28 03:06:18,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-28 03:06:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 501 transitions. [2021-12-28 03:06:18,638 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9452830188679245 [2021-12-28 03:06:18,639 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 501 transitions. [2021-12-28 03:06:18,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 501 transitions. [2021-12-28 03:06:18,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:06:18,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 501 transitions. [2021-12-28 03:06:18,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 250.5) internal successors, (501), 2 states have internal predecessors, (501), 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) [2021-12-28 03:06:18,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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) [2021-12-28 03:06:18,654 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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) [2021-12-28 03:06:18,655 INFO L186 Difference]: Start difference. First operand has 239 places, 248 transitions, 520 flow. Second operand 2 states and 501 transitions. [2021-12-28 03:06:18,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 233 transitions, 514 flow [2021-12-28 03:06:18,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 233 transitions, 498 flow, removed 0 selfloop flow, removed 8 redundant places. [2021-12-28 03:06:18,664 INFO L242 Difference]: Finished difference. Result has 232 places, 225 transitions, 458 flow [2021-12-28 03:06:18,665 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=458, PETRI_PLACES=232, PETRI_TRANSITIONS=225} [2021-12-28 03:06:18,669 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -7 predicate places. [2021-12-28 03:06:18,669 INFO L470 AbstractCegarLoop]: Abstraction has has 232 places, 225 transitions, 458 flow [2021-12-28 03:06:18,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 242.0) internal successors, (484), 2 states have internal predecessors, (484), 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) [2021-12-28 03:06:18,670 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:18,670 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:18,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 03:06:18,671 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:18,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:18,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1432313826, now seen corresponding path program 1 times [2021-12-28 03:06:18,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:18,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592768613] [2021-12-28 03:06:18,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:18,672 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:18,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:06:18,984 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:18,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592768613] [2021-12-28 03:06:18,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592768613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:06:18,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:06:18,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:06:18,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997656319] [2021-12-28 03:06:18,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:06:18,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:06:18,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:18,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:06:18,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:06:18,990 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 265 [2021-12-28 03:06:18,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 225 transitions, 458 flow. Second operand has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 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) [2021-12-28 03:06:18,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:18,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 265 [2021-12-28 03:06:18,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:06:19,152 INFO L129 PetriNetUnfolder]: 134/552 cut-off events. [2021-12-28 03:06:19,152 INFO L130 PetriNetUnfolder]: For 31/32 co-relation queries the response was YES. [2021-12-28 03:06:19,154 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 552 events. 134/552 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1675 event pairs, 14 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 775. Up to 133 conditions per place. [2021-12-28 03:06:19,159 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 50 selfloop transitions, 3 changer transitions 4/237 dead transitions. [2021-12-28 03:06:19,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 237 transitions, 601 flow [2021-12-28 03:06:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 03:06:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-12-28 03:06:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1038 transitions. [2021-12-28 03:06:19,166 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7833962264150943 [2021-12-28 03:06:19,167 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1038 transitions. [2021-12-28 03:06:19,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1038 transitions. [2021-12-28 03:06:19,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:06:19,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1038 transitions. [2021-12-28 03:06:19,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 207.6) internal successors, (1038), 5 states have internal predecessors, (1038), 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) [2021-12-28 03:06:19,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 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) [2021-12-28 03:06:19,173 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 265.0) internal successors, (1590), 6 states have internal predecessors, (1590), 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) [2021-12-28 03:06:19,173 INFO L186 Difference]: Start difference. First operand has 232 places, 225 transitions, 458 flow. Second operand 5 states and 1038 transitions. [2021-12-28 03:06:19,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 237 transitions, 601 flow [2021-12-28 03:06:19,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 237 transitions, 601 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-28 03:06:19,181 INFO L242 Difference]: Finished difference. Result has 231 places, 227 transitions, 481 flow [2021-12-28 03:06:19,182 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=481, PETRI_PLACES=231, PETRI_TRANSITIONS=227} [2021-12-28 03:06:19,183 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2021-12-28 03:06:19,183 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 227 transitions, 481 flow [2021-12-28 03:06:19,184 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 204.2) internal successors, (1021), 5 states have internal predecessors, (1021), 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) [2021-12-28 03:06:19,184 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:19,184 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:19,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 03:06:19,184 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:19,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:19,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1766303309, now seen corresponding path program 1 times [2021-12-28 03:06:19,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:19,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622938024] [2021-12-28 03:06:19,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:19,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:06:19,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:19,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622938024] [2021-12-28 03:06:19,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622938024] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:06:19,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:06:19,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 03:06:19,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524612122] [2021-12-28 03:06:19,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:06:19,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 03:06:19,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:19,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 03:06:19,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:06:19,254 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2021-12-28 03:06:19,255 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 227 transitions, 481 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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) [2021-12-28 03:06:19,255 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:19,255 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2021-12-28 03:06:19,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:06:19,364 INFO L129 PetriNetUnfolder]: 208/757 cut-off events. [2021-12-28 03:06:19,364 INFO L130 PetriNetUnfolder]: For 138/140 co-relation queries the response was YES. [2021-12-28 03:06:19,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 757 events. 208/757 cut-off events. For 138/140 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3026 event pairs, 36 based on Foata normal form. 13/694 useless extension candidates. Maximal degree in co-relation 1181. Up to 207 conditions per place. [2021-12-28 03:06:19,368 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 30 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2021-12-28 03:06:19,368 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 239 transitions, 581 flow [2021-12-28 03:06:19,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 03:06:19,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-28 03:06:19,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 723 transitions. [2021-12-28 03:06:19,370 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.909433962264151 [2021-12-28 03:06:19,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 723 transitions. [2021-12-28 03:06:19,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 723 transitions. [2021-12-28 03:06:19,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:06:19,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 723 transitions. [2021-12-28 03:06:19,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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) [2021-12-28 03:06:19,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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) [2021-12-28 03:06:19,373 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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) [2021-12-28 03:06:19,373 INFO L186 Difference]: Start difference. First operand has 231 places, 227 transitions, 481 flow. Second operand 3 states and 723 transitions. [2021-12-28 03:06:19,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 239 transitions, 581 flow [2021-12-28 03:06:19,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 239 transitions, 573 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-12-28 03:06:19,378 INFO L242 Difference]: Finished difference. Result has 229 places, 228 transitions, 488 flow [2021-12-28 03:06:19,378 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=488, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2021-12-28 03:06:19,380 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -10 predicate places. [2021-12-28 03:06:19,380 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 488 flow [2021-12-28 03:06:19,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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) [2021-12-28 03:06:19,381 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:19,381 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:19,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 03:06:19,381 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:19,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1267494493, now seen corresponding path program 1 times [2021-12-28 03:06:19,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:19,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057955433] [2021-12-28 03:06:19,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:19,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:06:19,476 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:19,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057955433] [2021-12-28 03:06:19,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057955433] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:06:19,476 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:06:19,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 03:06:19,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216585341] [2021-12-28 03:06:19,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:06:19,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-28 03:06:19,477 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:19,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 03:06:19,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 03:06:19,478 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 265 [2021-12-28 03:06:19,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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) [2021-12-28 03:06:19,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:19,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 265 [2021-12-28 03:06:19,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:06:19,605 INFO L129 PetriNetUnfolder]: 153/696 cut-off events. [2021-12-28 03:06:19,605 INFO L130 PetriNetUnfolder]: For 212/215 co-relation queries the response was YES. [2021-12-28 03:06:19,607 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1092 conditions, 696 events. 153/696 cut-off events. For 212/215 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2788 event pairs, 27 based on Foata normal form. 12/635 useless extension candidates. Maximal degree in co-relation 1086. Up to 171 conditions per place. [2021-12-28 03:06:19,610 INFO L132 encePairwiseOnDemand]: 262/265 looper letters, 31 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2021-12-28 03:06:19,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 240 transitions, 597 flow [2021-12-28 03:06:19,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-28 03:06:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-28 03:06:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2021-12-28 03:06:19,612 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9081761006289308 [2021-12-28 03:06:19,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 722 transitions. [2021-12-28 03:06:19,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 722 transitions. [2021-12-28 03:06:19,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:06:19,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 722 transitions. [2021-12-28 03:06:19,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 240.66666666666666) internal successors, (722), 3 states have internal predecessors, (722), 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) [2021-12-28 03:06:19,615 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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) [2021-12-28 03:06:19,615 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 265.0) internal successors, (1060), 4 states have internal predecessors, (1060), 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) [2021-12-28 03:06:19,615 INFO L186 Difference]: Start difference. First operand has 229 places, 228 transitions, 488 flow. Second operand 3 states and 722 transitions. [2021-12-28 03:06:19,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 240 transitions, 597 flow [2021-12-28 03:06:19,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 240 transitions, 594 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-28 03:06:19,626 INFO L242 Difference]: Finished difference. Result has 231 places, 229 transitions, 500 flow [2021-12-28 03:06:19,626 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=500, PETRI_PLACES=231, PETRI_TRANSITIONS=229} [2021-12-28 03:06:19,627 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, -8 predicate places. [2021-12-28 03:06:19,627 INFO L470 AbstractCegarLoop]: Abstraction has has 231 places, 229 transitions, 500 flow [2021-12-28 03:06:19,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 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) [2021-12-28 03:06:19,628 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:19,628 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:19,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 03:06:19,628 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:19,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:19,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1061679038, now seen corresponding path program 1 times [2021-12-28 03:06:19,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:19,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126147820] [2021-12-28 03:06:19,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:19,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 03:06:19,701 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:19,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126147820] [2021-12-28 03:06:19,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126147820] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:06:19,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:06:19,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:06:19,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109322967] [2021-12-28 03:06:19,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:06:19,702 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:06:19,702 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:19,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:06:19,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:06:19,704 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2021-12-28 03:06:19,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 229 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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) [2021-12-28 03:06:19,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:19,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2021-12-28 03:06:19,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:06:19,901 INFO L129 PetriNetUnfolder]: 109/773 cut-off events. [2021-12-28 03:06:19,901 INFO L130 PetriNetUnfolder]: For 229/230 co-relation queries the response was YES. [2021-12-28 03:06:19,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 773 events. 109/773 cut-off events. For 229/230 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2942 event pairs, 36 based on Foata normal form. 8/712 useless extension candidates. Maximal degree in co-relation 1224. Up to 167 conditions per place. [2021-12-28 03:06:19,905 INFO L132 encePairwiseOnDemand]: 255/265 looper letters, 84 selfloop transitions, 11 changer transitions 0/270 dead transitions. [2021-12-28 03:06:19,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 270 transitions, 793 flow [2021-12-28 03:06:19,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:06:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 03:06:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1881 transitions. [2021-12-28 03:06:19,908 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7886792452830189 [2021-12-28 03:06:19,908 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1881 transitions. [2021-12-28 03:06:19,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1881 transitions. [2021-12-28 03:06:19,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:06:19,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1881 transitions. [2021-12-28 03:06:19,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 209.0) internal successors, (1881), 9 states have internal predecessors, (1881), 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) [2021-12-28 03:06:19,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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) [2021-12-28 03:06:19,916 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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) [2021-12-28 03:06:19,916 INFO L186 Difference]: Start difference. First operand has 231 places, 229 transitions, 500 flow. Second operand 9 states and 1881 transitions. [2021-12-28 03:06:19,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 270 transitions, 793 flow [2021-12-28 03:06:19,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 270 transitions, 790 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-28 03:06:19,922 INFO L242 Difference]: Finished difference. Result has 240 places, 233 transitions, 540 flow [2021-12-28 03:06:19,922 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=540, PETRI_PLACES=240, PETRI_TRANSITIONS=233} [2021-12-28 03:06:19,924 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places. [2021-12-28 03:06:19,924 INFO L470 AbstractCegarLoop]: Abstraction has has 240 places, 233 transitions, 540 flow [2021-12-28 03:06:19,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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) [2021-12-28 03:06:19,925 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:19,925 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:19,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 03:06:19,925 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:19,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:19,926 INFO L85 PathProgramCache]: Analyzing trace with hash 848372614, now seen corresponding path program 1 times [2021-12-28 03:06:19,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:19,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711753980] [2021-12-28 03:06:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:19,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 03:06:20,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:20,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711753980] [2021-12-28 03:06:20,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711753980] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:06:20,017 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:06:20,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 03:06:20,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820852344] [2021-12-28 03:06:20,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:06:20,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 03:06:20,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:20,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 03:06:20,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-28 03:06:20,020 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 265 [2021-12-28 03:06:20,021 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 233 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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) [2021-12-28 03:06:20,021 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:20,021 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 265 [2021-12-28 03:06:20,022 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:06:20,215 INFO L129 PetriNetUnfolder]: 127/1067 cut-off events. [2021-12-28 03:06:20,215 INFO L130 PetriNetUnfolder]: For 321/323 co-relation queries the response was YES. [2021-12-28 03:06:20,218 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1659 conditions, 1067 events. 127/1067 cut-off events. For 321/323 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4977 event pairs, 42 based on Foata normal form. 15/997 useless extension candidates. Maximal degree in co-relation 1650. Up to 219 conditions per place. [2021-12-28 03:06:20,220 INFO L132 encePairwiseOnDemand]: 255/265 looper letters, 75 selfloop transitions, 12 changer transitions 0/262 dead transitions. [2021-12-28 03:06:20,221 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 262 transitions, 794 flow [2021-12-28 03:06:20,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:06:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 03:06:20,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1869 transitions. [2021-12-28 03:06:20,224 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7836477987421384 [2021-12-28 03:06:20,224 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1869 transitions. [2021-12-28 03:06:20,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1869 transitions. [2021-12-28 03:06:20,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:06:20,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1869 transitions. [2021-12-28 03:06:20,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 207.66666666666666) internal successors, (1869), 9 states have internal predecessors, (1869), 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) [2021-12-28 03:06:20,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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) [2021-12-28 03:06:20,232 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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) [2021-12-28 03:06:20,233 INFO L186 Difference]: Start difference. First operand has 240 places, 233 transitions, 540 flow. Second operand 9 states and 1869 transitions. [2021-12-28 03:06:20,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 248 places, 262 transitions, 794 flow [2021-12-28 03:06:20,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 262 transitions, 785 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-28 03:06:20,239 INFO L242 Difference]: Finished difference. Result has 247 places, 237 transitions, 575 flow [2021-12-28 03:06:20,239 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=575, PETRI_PLACES=247, PETRI_TRANSITIONS=237} [2021-12-28 03:06:20,241 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places. [2021-12-28 03:06:20,241 INFO L470 AbstractCegarLoop]: Abstraction has has 247 places, 237 transitions, 575 flow [2021-12-28 03:06:20,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.0) internal successors, (1230), 6 states have internal predecessors, (1230), 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) [2021-12-28 03:06:20,242 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:20,242 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:20,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 03:06:20,242 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:20,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:20,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1769428669, now seen corresponding path program 1 times [2021-12-28 03:06:20,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:20,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860962722] [2021-12-28 03:06:20,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:20,244 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 03:06:20,424 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:20,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860962722] [2021-12-28 03:06:20,424 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860962722] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:06:20,424 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:06:20,425 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 03:06:20,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310470969] [2021-12-28 03:06:20,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:06:20,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 03:06:20,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:20,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 03:06:20,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-28 03:06:20,430 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2021-12-28 03:06:20,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 237 transitions, 575 flow. Second operand has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 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) [2021-12-28 03:06:20,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:20,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2021-12-28 03:06:20,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:06:21,652 INFO L129 PetriNetUnfolder]: 3272/9314 cut-off events. [2021-12-28 03:06:21,653 INFO L130 PetriNetUnfolder]: For 2799/2802 co-relation queries the response was YES. [2021-12-28 03:06:21,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16569 conditions, 9314 events. 3272/9314 cut-off events. For 2799/2802 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 87639 event pairs, 1597 based on Foata normal form. 0/7843 useless extension candidates. Maximal degree in co-relation 16558. Up to 1850 conditions per place. [2021-12-28 03:06:21,750 INFO L132 encePairwiseOnDemand]: 254/265 looper letters, 117 selfloop transitions, 11 changer transitions 0/291 dead transitions. [2021-12-28 03:06:21,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 291 transitions, 998 flow [2021-12-28 03:06:21,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:06:21,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 03:06:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1795 transitions. [2021-12-28 03:06:21,754 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7526205450733753 [2021-12-28 03:06:21,754 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1795 transitions. [2021-12-28 03:06:21,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1795 transitions. [2021-12-28 03:06:21,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:06:21,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1795 transitions. [2021-12-28 03:06:21,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 199.44444444444446) internal successors, (1795), 9 states have internal predecessors, (1795), 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) [2021-12-28 03:06:21,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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) [2021-12-28 03:06:21,760 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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) [2021-12-28 03:06:21,760 INFO L186 Difference]: Start difference. First operand has 247 places, 237 transitions, 575 flow. Second operand 9 states and 1795 transitions. [2021-12-28 03:06:21,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 291 transitions, 998 flow [2021-12-28 03:06:21,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 291 transitions, 987 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-28 03:06:21,766 INFO L242 Difference]: Finished difference. Result has 255 places, 240 transitions, 606 flow [2021-12-28 03:06:21,766 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=606, PETRI_PLACES=255, PETRI_TRANSITIONS=240} [2021-12-28 03:06:21,767 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places. [2021-12-28 03:06:21,767 INFO L470 AbstractCegarLoop]: Abstraction has has 255 places, 240 transitions, 606 flow [2021-12-28 03:06:21,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 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) [2021-12-28 03:06:21,768 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:21,768 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:21,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 03:06:21,769 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:21,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:21,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1581181163, now seen corresponding path program 1 times [2021-12-28 03:06:21,769 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:21,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980234931] [2021-12-28 03:06:21,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:21,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:21,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 03:06:21,939 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:21,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980234931] [2021-12-28 03:06:21,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980234931] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:06:21,939 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:06:21,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 03:06:21,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80864862] [2021-12-28 03:06:21,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:06:21,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 03:06:21,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:21,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 03:06:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-28 03:06:21,942 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 265 [2021-12-28 03:06:21,943 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 240 transitions, 606 flow. Second operand has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 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) [2021-12-28 03:06:21,943 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:21,943 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 265 [2021-12-28 03:06:21,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:06:22,886 INFO L129 PetriNetUnfolder]: 2420/7206 cut-off events. [2021-12-28 03:06:22,887 INFO L130 PetriNetUnfolder]: For 2888/2926 co-relation queries the response was YES. [2021-12-28 03:06:22,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13425 conditions, 7206 events. 2420/7206 cut-off events. For 2888/2926 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 63264 event pairs, 1207 based on Foata normal form. 0/6226 useless extension candidates. Maximal degree in co-relation 13411. Up to 1609 conditions per place. [2021-12-28 03:06:22,925 INFO L132 encePairwiseOnDemand]: 254/265 looper letters, 87 selfloop transitions, 9 changer transitions 21/280 dead transitions. [2021-12-28 03:06:22,925 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 280 transitions, 960 flow [2021-12-28 03:06:22,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:06:22,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 03:06:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1788 transitions. [2021-12-28 03:06:22,928 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7496855345911949 [2021-12-28 03:06:22,929 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1788 transitions. [2021-12-28 03:06:22,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1788 transitions. [2021-12-28 03:06:22,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:06:22,929 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1788 transitions. [2021-12-28 03:06:22,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 198.66666666666666) internal successors, (1788), 9 states have internal predecessors, (1788), 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) [2021-12-28 03:06:22,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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) [2021-12-28 03:06:22,935 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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) [2021-12-28 03:06:22,935 INFO L186 Difference]: Start difference. First operand has 255 places, 240 transitions, 606 flow. Second operand 9 states and 1788 transitions. [2021-12-28 03:06:22,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 280 transitions, 960 flow [2021-12-28 03:06:22,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 280 transitions, 944 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-12-28 03:06:22,942 INFO L242 Difference]: Finished difference. Result has 260 places, 238 transitions, 602 flow [2021-12-28 03:06:22,942 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=602, PETRI_PLACES=260, PETRI_TRANSITIONS=238} [2021-12-28 03:06:22,942 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 21 predicate places. [2021-12-28 03:06:22,943 INFO L470 AbstractCegarLoop]: Abstraction has has 260 places, 238 transitions, 602 flow [2021-12-28 03:06:22,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 193.25) internal successors, (1546), 8 states have internal predecessors, (1546), 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) [2021-12-28 03:06:22,943 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:22,943 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:22,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 03:06:22,944 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:22,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash 670833297, now seen corresponding path program 1 times [2021-12-28 03:06:22,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:22,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527673091] [2021-12-28 03:06:22,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:22,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 03:06:23,136 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:23,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527673091] [2021-12-28 03:06:23,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527673091] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:06:23,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060420383] [2021-12-28 03:06:23,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:23,137 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:06:23,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:06:23,138 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:06:23,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 03:06:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:23,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-28 03:06:23,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:06:23,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 03:06:23,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:06:24,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-28 03:06:24,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060420383] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-28 03:06:24,410 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-28 03:06:24,410 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 8] total 22 [2021-12-28 03:06:24,410 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36447717] [2021-12-28 03:06:24,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:06:24,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-28 03:06:24,411 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:24,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-28 03:06:24,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2021-12-28 03:06:24,413 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 265 [2021-12-28 03:06:24,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 238 transitions, 602 flow. Second operand has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 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) [2021-12-28 03:06:24,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:24,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 265 [2021-12-28 03:06:24,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:06:25,616 INFO L129 PetriNetUnfolder]: 3111/6652 cut-off events. [2021-12-28 03:06:25,616 INFO L130 PetriNetUnfolder]: For 3365/3381 co-relation queries the response was YES. [2021-12-28 03:06:25,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14591 conditions, 6652 events. 3111/6652 cut-off events. For 3365/3381 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 46322 event pairs, 179 based on Foata normal form. 200/6442 useless extension candidates. Maximal degree in co-relation 14575. Up to 885 conditions per place. [2021-12-28 03:06:25,666 INFO L132 encePairwiseOnDemand]: 246/265 looper letters, 156 selfloop transitions, 39 changer transitions 3/355 dead transitions. [2021-12-28 03:06:25,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 355 transitions, 1383 flow [2021-12-28 03:06:25,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-28 03:06:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-12-28 03:06:25,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3802 transitions. [2021-12-28 03:06:25,676 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7173584905660377 [2021-12-28 03:06:25,676 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3802 transitions. [2021-12-28 03:06:25,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3802 transitions. [2021-12-28 03:06:25,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:06:25,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3802 transitions. [2021-12-28 03:06:25,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 190.1) internal successors, (3802), 20 states have internal predecessors, (3802), 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) [2021-12-28 03:06:25,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 265.0) internal successors, (5565), 21 states have internal predecessors, (5565), 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) [2021-12-28 03:06:25,695 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 265.0) internal successors, (5565), 21 states have internal predecessors, (5565), 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) [2021-12-28 03:06:25,695 INFO L186 Difference]: Start difference. First operand has 260 places, 238 transitions, 602 flow. Second operand 20 states and 3802 transitions. [2021-12-28 03:06:25,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 355 transitions, 1383 flow [2021-12-28 03:06:25,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 355 transitions, 1335 flow, removed 14 selfloop flow, removed 10 redundant places. [2021-12-28 03:06:25,715 INFO L242 Difference]: Finished difference. Result has 276 places, 256 transitions, 790 flow [2021-12-28 03:06:25,715 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=790, PETRI_PLACES=276, PETRI_TRANSITIONS=256} [2021-12-28 03:06:25,716 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 37 predicate places. [2021-12-28 03:06:25,716 INFO L470 AbstractCegarLoop]: Abstraction has has 276 places, 256 transitions, 790 flow [2021-12-28 03:06:25,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 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) [2021-12-28 03:06:25,717 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:25,718 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:25,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-28 03:06:25,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:06:25,932 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:25,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:25,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1881327333, now seen corresponding path program 1 times [2021-12-28 03:06:25,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:25,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532036494] [2021-12-28 03:06:25,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:25,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:26,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 03:06:26,153 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:26,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532036494] [2021-12-28 03:06:26,155 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532036494] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:06:26,155 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:06:26,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 03:06:26,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824020900] [2021-12-28 03:06:26,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:06:26,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:06:26,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:26,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:06:26,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:06:26,158 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 265 [2021-12-28 03:06:26,159 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 256 transitions, 790 flow. Second operand has 9 states, 9 states have (on average 189.33333333333334) internal successors, (1704), 9 states have internal predecessors, (1704), 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) [2021-12-28 03:06:26,159 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:26,160 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 265 [2021-12-28 03:06:26,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:06:27,215 INFO L129 PetriNetUnfolder]: 2365/4801 cut-off events. [2021-12-28 03:06:27,215 INFO L130 PetriNetUnfolder]: For 9509/9509 co-relation queries the response was YES. [2021-12-28 03:06:27,238 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12699 conditions, 4801 events. 2365/4801 cut-off events. For 9509/9509 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 31209 event pairs, 396 based on Foata normal form. 134/4536 useless extension candidates. Maximal degree in co-relation 12677. Up to 1800 conditions per place. [2021-12-28 03:06:27,259 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 116 selfloop transitions, 15 changer transitions 7/300 dead transitions. [2021-12-28 03:06:27,259 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 300 transitions, 1264 flow [2021-12-28 03:06:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:06:27,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 03:06:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1755 transitions. [2021-12-28 03:06:27,264 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7358490566037735 [2021-12-28 03:06:27,264 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1755 transitions. [2021-12-28 03:06:27,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1755 transitions. [2021-12-28 03:06:27,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:06:27,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1755 transitions. [2021-12-28 03:06:27,268 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 195.0) internal successors, (1755), 9 states have internal predecessors, (1755), 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) [2021-12-28 03:06:27,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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) [2021-12-28 03:06:27,272 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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) [2021-12-28 03:06:27,272 INFO L186 Difference]: Start difference. First operand has 276 places, 256 transitions, 790 flow. Second operand 9 states and 1755 transitions. [2021-12-28 03:06:27,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 300 transitions, 1264 flow [2021-12-28 03:06:27,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 300 transitions, 1191 flow, removed 9 selfloop flow, removed 12 redundant places. [2021-12-28 03:06:27,304 INFO L242 Difference]: Finished difference. Result has 272 places, 258 transitions, 798 flow [2021-12-28 03:06:27,305 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=798, PETRI_PLACES=272, PETRI_TRANSITIONS=258} [2021-12-28 03:06:27,305 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 33 predicate places. [2021-12-28 03:06:27,305 INFO L470 AbstractCegarLoop]: Abstraction has has 272 places, 258 transitions, 798 flow [2021-12-28 03:06:27,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 189.33333333333334) internal successors, (1704), 9 states have internal predecessors, (1704), 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) [2021-12-28 03:06:27,306 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:27,306 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:27,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 03:06:27,307 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:27,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:27,307 INFO L85 PathProgramCache]: Analyzing trace with hash 195790739, now seen corresponding path program 1 times [2021-12-28 03:06:27,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:27,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628813242] [2021-12-28 03:06:27,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:27,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:27,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 03:06:27,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:27,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628813242] [2021-12-28 03:06:27,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628813242] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:06:27,400 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:06:27,400 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 03:06:27,400 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514310127] [2021-12-28 03:06:27,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:06:27,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 03:06:27,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:27,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 03:06:27,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-28 03:06:27,403 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 265 [2021-12-28 03:06:27,404 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 258 transitions, 798 flow. Second operand has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 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) [2021-12-28 03:06:27,404 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:27,404 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 265 [2021-12-28 03:06:27,404 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:06:27,847 INFO L129 PetriNetUnfolder]: 864/2281 cut-off events. [2021-12-28 03:06:27,848 INFO L130 PetriNetUnfolder]: For 5799/5850 co-relation queries the response was YES. [2021-12-28 03:06:27,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6394 conditions, 2281 events. 864/2281 cut-off events. For 5799/5850 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14496 event pairs, 74 based on Foata normal form. 26/2075 useless extension candidates. Maximal degree in co-relation 6372. Up to 538 conditions per place. [2021-12-28 03:06:27,886 INFO L132 encePairwiseOnDemand]: 259/265 looper letters, 63 selfloop transitions, 23 changer transitions 0/302 dead transitions. [2021-12-28 03:06:27,886 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 302 transitions, 1200 flow [2021-12-28 03:06:27,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 03:06:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-12-28 03:06:27,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1425 transitions. [2021-12-28 03:06:27,890 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8962264150943396 [2021-12-28 03:06:27,891 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1425 transitions. [2021-12-28 03:06:27,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1425 transitions. [2021-12-28 03:06:27,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:06:27,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1425 transitions. [2021-12-28 03:06:27,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 237.5) internal successors, (1425), 6 states have internal predecessors, (1425), 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) [2021-12-28 03:06:27,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 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) [2021-12-28 03:06:27,898 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 265.0) internal successors, (1855), 7 states have internal predecessors, (1855), 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) [2021-12-28 03:06:27,898 INFO L186 Difference]: Start difference. First operand has 272 places, 258 transitions, 798 flow. Second operand 6 states and 1425 transitions. [2021-12-28 03:06:27,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 302 transitions, 1200 flow [2021-12-28 03:06:27,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 302 transitions, 1159 flow, removed 9 selfloop flow, removed 8 redundant places. [2021-12-28 03:06:27,911 INFO L242 Difference]: Finished difference. Result has 271 places, 270 transitions, 953 flow [2021-12-28 03:06:27,912 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=758, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=953, PETRI_PLACES=271, PETRI_TRANSITIONS=270} [2021-12-28 03:06:27,912 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 32 predicate places. [2021-12-28 03:06:27,912 INFO L470 AbstractCegarLoop]: Abstraction has has 271 places, 270 transitions, 953 flow [2021-12-28 03:06:27,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 232.4) internal successors, (1162), 5 states have internal predecessors, (1162), 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) [2021-12-28 03:06:27,913 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:27,913 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:27,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 03:06:27,914 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:27,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:27,914 INFO L85 PathProgramCache]: Analyzing trace with hash -514632839, now seen corresponding path program 1 times [2021-12-28 03:06:27,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:27,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68909569] [2021-12-28 03:06:27,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:27,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:28,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-28 03:06:28,032 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:28,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68909569] [2021-12-28 03:06:28,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68909569] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:06:28,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944581001] [2021-12-28 03:06:28,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:28,033 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:06:28,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:06:28,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:06:28,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 03:06:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:28,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-28 03:06:28,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:06:28,640 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 03:06:28,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:06:29,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 03:06:29,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944581001] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-28 03:06:29,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-28 03:06:29,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5, 6] total 11 [2021-12-28 03:06:29,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524860409] [2021-12-28 03:06:29,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:06:29,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 03:06:29,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:29,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 03:06:29,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-12-28 03:06:29,018 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 265 [2021-12-28 03:06:29,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 270 transitions, 953 flow. Second operand has 7 states, 7 states have (on average 224.57142857142858) internal successors, (1572), 7 states have internal predecessors, (1572), 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) [2021-12-28 03:06:29,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:29,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 265 [2021-12-28 03:06:29,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:06:30,402 INFO L129 PetriNetUnfolder]: 4525/9682 cut-off events. [2021-12-28 03:06:30,402 INFO L130 PetriNetUnfolder]: For 45844/46244 co-relation queries the response was YES. [2021-12-28 03:06:30,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32947 conditions, 9682 events. 4525/9682 cut-off events. For 45844/46244 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 83372 event pairs, 699 based on Foata normal form. 54/8446 useless extension candidates. Maximal degree in co-relation 32922. Up to 2009 conditions per place. [2021-12-28 03:06:30,488 INFO L132 encePairwiseOnDemand]: 253/265 looper letters, 150 selfloop transitions, 56 changer transitions 0/414 dead transitions. [2021-12-28 03:06:30,488 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 414 transitions, 2463 flow [2021-12-28 03:06:30,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-28 03:06:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-28 03:06:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2529 transitions. [2021-12-28 03:06:30,493 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8675814751286449 [2021-12-28 03:06:30,493 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2529 transitions. [2021-12-28 03:06:30,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2529 transitions. [2021-12-28 03:06:30,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:06:30,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2529 transitions. [2021-12-28 03:06:30,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 229.9090909090909) internal successors, (2529), 11 states have internal predecessors, (2529), 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) [2021-12-28 03:06:30,500 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 265.0) internal successors, (3180), 12 states have internal predecessors, (3180), 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) [2021-12-28 03:06:30,501 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 265.0) internal successors, (3180), 12 states have internal predecessors, (3180), 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) [2021-12-28 03:06:30,501 INFO L186 Difference]: Start difference. First operand has 271 places, 270 transitions, 953 flow. Second operand 11 states and 2529 transitions. [2021-12-28 03:06:30,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 414 transitions, 2463 flow [2021-12-28 03:06:30,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 414 transitions, 2403 flow, removed 20 selfloop flow, removed 2 redundant places. [2021-12-28 03:06:30,579 INFO L242 Difference]: Finished difference. Result has 285 places, 309 transitions, 1456 flow [2021-12-28 03:06:30,579 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1456, PETRI_PLACES=285, PETRI_TRANSITIONS=309} [2021-12-28 03:06:30,580 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 46 predicate places. [2021-12-28 03:06:30,580 INFO L470 AbstractCegarLoop]: Abstraction has has 285 places, 309 transitions, 1456 flow [2021-12-28 03:06:30,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 224.57142857142858) internal successors, (1572), 7 states have internal predecessors, (1572), 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) [2021-12-28 03:06:30,580 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:30,581 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:30,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-12-28 03:06:30,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2021-12-28 03:06:30,795 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:30,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash 778151649, now seen corresponding path program 2 times [2021-12-28 03:06:30,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:30,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497672309] [2021-12-28 03:06:30,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:30,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 03:06:30,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:30,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497672309] [2021-12-28 03:06:30,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497672309] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 03:06:30,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 03:06:30,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 03:06:30,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574859334] [2021-12-28 03:06:30,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 03:06:30,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 03:06:30,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:30,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 03:06:30,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-12-28 03:06:30,990 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 265 [2021-12-28 03:06:30,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 309 transitions, 1456 flow. Second operand has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 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) [2021-12-28 03:06:30,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:30,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 265 [2021-12-28 03:06:30,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:06:32,811 INFO L129 PetriNetUnfolder]: 7558/14275 cut-off events. [2021-12-28 03:06:32,811 INFO L130 PetriNetUnfolder]: For 59580/59619 co-relation queries the response was YES. [2021-12-28 03:06:32,906 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51675 conditions, 14275 events. 7558/14275 cut-off events. For 59580/59619 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 115295 event pairs, 2183 based on Foata normal form. 251/13713 useless extension candidates. Maximal degree in co-relation 51645. Up to 7112 conditions per place. [2021-12-28 03:06:32,977 INFO L132 encePairwiseOnDemand]: 256/265 looper letters, 219 selfloop transitions, 18 changer transitions 0/408 dead transitions. [2021-12-28 03:06:32,978 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 408 transitions, 2781 flow [2021-12-28 03:06:32,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-28 03:06:32,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-28 03:06:32,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1751 transitions. [2021-12-28 03:06:32,981 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7341719077568134 [2021-12-28 03:06:32,981 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1751 transitions. [2021-12-28 03:06:32,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1751 transitions. [2021-12-28 03:06:32,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:06:32,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1751 transitions. [2021-12-28 03:06:32,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 194.55555555555554) internal successors, (1751), 9 states have internal predecessors, (1751), 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) [2021-12-28 03:06:32,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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) [2021-12-28 03:06:32,988 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 265.0) internal successors, (2650), 10 states have internal predecessors, (2650), 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) [2021-12-28 03:06:32,988 INFO L186 Difference]: Start difference. First operand has 285 places, 309 transitions, 1456 flow. Second operand 9 states and 1751 transitions. [2021-12-28 03:06:32,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 408 transitions, 2781 flow [2021-12-28 03:06:33,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 408 transitions, 2758 flow, removed 9 selfloop flow, removed 2 redundant places. [2021-12-28 03:06:33,432 INFO L242 Difference]: Finished difference. Result has 293 places, 315 transitions, 1549 flow [2021-12-28 03:06:33,432 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=265, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1549, PETRI_PLACES=293, PETRI_TRANSITIONS=315} [2021-12-28 03:06:33,433 INFO L334 CegarLoopForPetriNet]: 239 programPoint places, 54 predicate places. [2021-12-28 03:06:33,433 INFO L470 AbstractCegarLoop]: Abstraction has has 293 places, 315 transitions, 1549 flow [2021-12-28 03:06:33,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 190.0) internal successors, (1710), 9 states have internal predecessors, (1710), 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) [2021-12-28 03:06:33,433 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-28 03:06:33,434 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 03:06:33,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 03:06:33,434 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION (and 1 more)] === [2021-12-28 03:06:33,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 03:06:33,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1347663800, now seen corresponding path program 1 times [2021-12-28 03:06:33,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 03:06:33,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915587608] [2021-12-28 03:06:33,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:33,435 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 03:06:33,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:35,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 03:06:35,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 03:06:35,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915587608] [2021-12-28 03:06:35,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915587608] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 03:06:35,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95839730] [2021-12-28 03:06:35,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 03:06:35,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 03:06:35,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 03:06:35,904 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-28 03:06:35,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 03:06:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 03:06:36,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 89 conjunts are in the unsatisfiable core [2021-12-28 03:06:36,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 03:06:41,536 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 03:06:41,537 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-28 03:06:41,548 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2021-12-28 03:06:41,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 31 [2021-12-28 03:06:41,606 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 03:06:41,607 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 03:06:42,579 INFO L353 Elim1Store]: treesize reduction 31, result has 88.8 percent of original size [2021-12-28 03:06:42,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 88 treesize of output 269 [2021-12-28 03:06:51,583 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-28 03:06:51,584 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95839730] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 03:06:51,584 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 03:06:51,584 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 25] total 91 [2021-12-28 03:06:51,584 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729778038] [2021-12-28 03:06:51,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 03:06:51,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2021-12-28 03:06:51,585 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 03:06:51,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2021-12-28 03:06:51,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1503, Invalid=6687, Unknown=0, NotChecked=0, Total=8190 [2021-12-28 03:06:51,592 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 265 [2021-12-28 03:06:51,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 315 transitions, 1549 flow. Second operand has 91 states, 91 states have (on average 109.98901098901099) internal successors, (10009), 91 states have internal predecessors, (10009), 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) [2021-12-28 03:06:51,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-28 03:06:51,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 265 [2021-12-28 03:06:51,598 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-28 03:07:00,559 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][636], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 264#(= ~total~0 0), 202#L143-4true, 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 40#L79true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:00,559 INFO L384 tUnfolder$Statistics]: this new event has 191 ancestors and is cut-off event [2021-12-28 03:07:00,559 INFO L387 tUnfolder$Statistics]: existing Event has 184 ancestors and is cut-off event [2021-12-28 03:07:00,560 INFO L387 tUnfolder$Statistics]: existing Event has 187 ancestors and is cut-off event [2021-12-28 03:07:00,560 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-28 03:07:01,325 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][636], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, 109#L82true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 264#(= ~total~0 0), 202#L143-4true, 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:01,325 INFO L384 tUnfolder$Statistics]: this new event has 192 ancestors and is cut-off event [2021-12-28 03:07:01,325 INFO L387 tUnfolder$Statistics]: existing Event has 188 ancestors and is cut-off event [2021-12-28 03:07:01,326 INFO L387 tUnfolder$Statistics]: existing Event has 185 ancestors and is cut-off event [2021-12-28 03:07:01,326 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-12-28 03:07:03,943 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 240#L118true, Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 40#L79true, 17#L58true, Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:03,946 INFO L384 tUnfolder$Statistics]: this new event has 194 ancestors and is cut-off event [2021-12-28 03:07:03,946 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-28 03:07:03,946 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-28 03:07:03,946 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-28 03:07:04,942 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 240#L118true, Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:04,942 INFO L384 tUnfolder$Statistics]: this new event has 195 ancestors and is cut-off event [2021-12-28 03:07:04,943 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-28 03:07:04,943 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-12-28 03:07:04,943 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-12-28 03:07:06,145 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), 24#L115true, Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 38#L144-4true, 17#L58true, 40#L79true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:06,147 INFO L384 tUnfolder$Statistics]: this new event has 196 ancestors and is cut-off event [2021-12-28 03:07:06,147 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2021-12-28 03:07:06,147 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-12-28 03:07:06,147 INFO L387 tUnfolder$Statistics]: existing Event has 190 ancestors and is cut-off event [2021-12-28 03:07:07,565 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 240#L118true, Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 40#L79true, 74#L145-1true, Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:07,565 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2021-12-28 03:07:07,565 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-28 03:07:07,565 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-28 03:07:07,565 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-12-28 03:07:07,566 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 240#L118true, Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, 40#L79true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:07,566 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2021-12-28 03:07:07,566 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-28 03:07:07,566 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-28 03:07:07,566 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-12-28 03:07:07,567 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 38#L144-4true, 17#L58true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:07,567 INFO L384 tUnfolder$Statistics]: this new event has 197 ancestors and is cut-off event [2021-12-28 03:07:07,567 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-28 03:07:07,567 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-12-28 03:07:07,568 INFO L387 tUnfolder$Statistics]: existing Event has 191 ancestors and is cut-off event [2021-12-28 03:07:08,500 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 240#L118true, Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 74#L145-1true, Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:08,500 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-12-28 03:07:08,500 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-28 03:07:08,500 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-28 03:07:08,500 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-28 03:07:08,501 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 240#L118true, Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:08,501 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-12-28 03:07:08,502 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-28 03:07:08,502 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-12-28 03:07:08,502 INFO L387 tUnfolder$Statistics]: existing Event has 192 ancestors and is cut-off event [2021-12-28 03:07:08,516 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 99#L61true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:08,516 INFO L384 tUnfolder$Statistics]: this new event has 198 ancestors and is cut-off event [2021-12-28 03:07:08,516 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-28 03:07:08,516 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-28 03:07:08,516 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-28 03:07:09,489 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 40#L79true, 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:09,490 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2021-12-28 03:07:09,490 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-12-28 03:07:09,490 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-12-28 03:07:09,490 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-12-28 03:07:09,491 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, 40#L79true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:09,491 INFO L384 tUnfolder$Statistics]: this new event has 199 ancestors and is cut-off event [2021-12-28 03:07:09,491 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-12-28 03:07:09,491 INFO L387 tUnfolder$Statistics]: existing Event has 199 ancestors and is cut-off event [2021-12-28 03:07:09,491 INFO L387 tUnfolder$Statistics]: existing Event has 193 ancestors and is cut-off event [2021-12-28 03:07:10,524 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 240#L118true, Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 40#L79true, 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:10,524 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2021-12-28 03:07:10,524 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-28 03:07:10,524 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2021-12-28 03:07:10,524 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-28 03:07:10,525 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:10,539 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2021-12-28 03:07:10,539 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-28 03:07:10,539 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2021-12-28 03:07:10,539 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-28 03:07:10,541 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 38#L144-4true, 17#L58true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:10,541 INFO L384 tUnfolder$Statistics]: this new event has 200 ancestors and is cut-off event [2021-12-28 03:07:10,541 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-28 03:07:10,541 INFO L387 tUnfolder$Statistics]: existing Event has 194 ancestors and is cut-off event [2021-12-28 03:07:10,541 INFO L387 tUnfolder$Statistics]: existing Event has 200 ancestors and is cut-off event [2021-12-28 03:07:11,196 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 240#L118true, Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:11,196 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2021-12-28 03:07:11,197 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2021-12-28 03:07:11,197 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-28 03:07:11,197 INFO L387 tUnfolder$Statistics]: existing Event has 195 ancestors and is cut-off event [2021-12-28 03:07:11,205 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 99#L61true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:11,206 INFO L384 tUnfolder$Statistics]: this new event has 201 ancestors and is cut-off event [2021-12-28 03:07:11,206 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-28 03:07:11,206 INFO L387 tUnfolder$Statistics]: existing Event has 201 ancestors and is cut-off event [2021-12-28 03:07:11,206 INFO L387 tUnfolder$Statistics]: existing Event has 198 ancestors and is cut-off event [2021-12-28 03:07:12,021 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 40#L79true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:12,021 INFO L384 tUnfolder$Statistics]: this new event has 202 ancestors and is cut-off event [2021-12-28 03:07:12,021 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2021-12-28 03:07:12,022 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-12-28 03:07:12,022 INFO L387 tUnfolder$Statistics]: existing Event has 196 ancestors and is cut-off event [2021-12-28 03:07:12,615 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([993] L52-->L58: Formula: (and (not (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| 0)) (= (+ 1 v_~q1_back~0_64) v_~q1_back~0_63) (not (= (ite (and (<= 0 v_~q1_back~0_64) (< v_~q1_back~0_64 v_~n1~0_22)) 1 0) 0)) (not (= (ite (= (select (select |v_#memory_int_76| v_~f~0.base_36) (+ (* v_~i~0_34 4) v_~f~0.offset_36)) (select (select |v_#memory_int_76| v_~q1~0.base_23) (+ v_~q1~0.offset_23 (* 4 v_~q1_back~0_64)))) 1 0) 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1| (ite (< v_~q1_back~0_64 2147483647) 1 0)) (= |v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1| |v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|) (= v_~i~0_33 (+ v_~i~0_34 1))) InVars {~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_34, ~q1_back~0=v_~q1_back~0_64, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, ~q1~0.base=v_~q1~0.base_23, #memory_int=|v_#memory_int_76|, ~f~0.offset=v_~f~0.offset_36} OutVars{~q1~0.offset=v_~q1~0.offset_23, ~i~0=v_~i~0_33, ~f~0.base=v_~f~0.base_36, ~n1~0=v_~n1~0_22, thread1Thread1of1ForFork3_#t~post3#1=|v_thread1Thread1of1ForFork3_#t~post3#1_1|, ~f~0.offset=v_~f~0.offset_36, thread1Thread1of1ForFork3_#t~mem2#1=|v_thread1Thread1of1ForFork3_#t~mem2#1_1|, thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1_1|, ~q1_back~0=v_~q1_back~0_63, ~q1~0.base=v_~q1~0.base_23, thread1Thread1of1ForFork3_#t~post4#1=|v_thread1Thread1of1ForFork3_#t~post4#1_1|, #memory_int=|v_#memory_int_76|, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1_1|, thread1Thread1of1ForFork3_#t~mem1#1=|v_thread1Thread1of1ForFork3_#t~mem1#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork3_assume_abort_if_not_#in~cond#1, ~i~0, ~q1_back~0, thread1Thread1of1ForFork3_#t~post4#1, thread1Thread1of1ForFork3_#t~post3#1, thread1Thread1of1ForFork3_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork3_#t~mem1#1, thread1Thread1of1ForFork3_#t~mem2#1][867], [3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 24#L115true, Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), Black: 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 4400#(or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), 180#L93true, Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), 1710#(<= ~q2_front~0 ~q2_back~0), Black: 282#(<= ~q2_back~0 ~q2_front~0), 1125#(not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 17#L58true, 74#L145-1true, Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:12,615 INFO L384 tUnfolder$Statistics]: this new event has 203 ancestors and is cut-off event [2021-12-28 03:07:12,615 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-12-28 03:07:12,615 INFO L387 tUnfolder$Statistics]: existing Event has 203 ancestors and is cut-off event [2021-12-28 03:07:12,615 INFO L387 tUnfolder$Statistics]: existing Event has 197 ancestors and is cut-off event [2021-12-28 03:07:13,361 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, 56#L145-2true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:13,362 INFO L384 tUnfolder$Statistics]: this new event has 205 ancestors and is cut-off event [2021-12-28 03:07:13,362 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2021-12-28 03:07:13,362 INFO L387 tUnfolder$Statistics]: existing Event has 202 ancestors and is cut-off event [2021-12-28 03:07:13,362 INFO L387 tUnfolder$Statistics]: existing Event has 205 ancestors and is cut-off event [2021-12-28 03:07:13,924 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), 109#L82true, Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 151#L146-1true, Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:13,924 INFO L384 tUnfolder$Statistics]: this new event has 207 ancestors and is cut-off event [2021-12-28 03:07:13,924 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2021-12-28 03:07:13,924 INFO L387 tUnfolder$Statistics]: existing Event has 204 ancestors and is cut-off event [2021-12-28 03:07:13,925 INFO L387 tUnfolder$Statistics]: existing Event has 207 ancestors and is cut-off event [2021-12-28 03:07:14,571 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 264#(= ~total~0 0), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 228#L146-2true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:14,571 INFO L384 tUnfolder$Statistics]: this new event has 211 ancestors and is cut-off event [2021-12-28 03:07:14,572 INFO L387 tUnfolder$Statistics]: existing Event has 211 ancestors and is cut-off event [2021-12-28 03:07:14,572 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2021-12-28 03:07:14,572 INFO L387 tUnfolder$Statistics]: existing Event has 208 ancestors and is cut-off event [2021-12-28 03:07:14,681 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1009] L93-->L97: Formula: (let ((.cse0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) (and (= v_~total~0_58 |v_thread3Thread1of1ForFork2_plus_#in~a#1_1|) (<= 0 (+ v_~total~0_57 2147483648)) (<= v_~total~0_57 2147483647) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|) (= (+ v_~q1_front~0_53 1) v_~q1_front~0_52) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| (select (select |v_#memory_int_82| v_~q1~0.base_29) (+ v_~q1~0.offset_29 (* 4 v_~q1_front~0_53)))) (= |v_thread3Thread1of1ForFork2_plus_#in~a#1_1| |v_thread3Thread1of1ForFork2_plus_~a#1_1|) (= |v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1| (ite (or (<= .cse0 2147483647) (<= |v_thread3Thread1of1ForFork2_plus_~b#1_1| 0)) 1 0)) (= .cse0 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (= v_~total~0_57 |v_thread3Thread1of1ForFork2_plus_#res#1_1|) (not (= 0 |v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|)) (not (= (ite (and (< v_~q1_front~0_53 v_~q1_back~0_67) (<= 0 v_~q1_front~0_53) (< v_~q1_front~0_53 v_~n1~0_24)) 1 0) 0)) (not (= (ite (or (<= 0 |v_thread3Thread1of1ForFork2_plus_~b#1_1|) (<= 0 (+ |v_thread3Thread1of1ForFork2_plus_~a#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1| 2147483648))) 1 0) 0)) (= |v_thread3Thread1of1ForFork2_plus_#in~b#1_1| |v_thread3Thread1of1ForFork2_plus_~b#1_1|))) InVars {~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_53, ~q1_back~0=v_~q1_back~0_67, ~n1~0=v_~n1~0_24, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, ~total~0=v_~total~0_58} OutVars{thread3Thread1of1ForFork2_#t~mem10#1=|v_thread3Thread1of1ForFork2_#t~mem10#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_1|, ~q1~0.offset=v_~q1~0.offset_29, ~q1_front~0=v_~q1_front~0_52, thread3Thread1of1ForFork2_#t~post12#1=|v_thread3Thread1of1ForFork2_#t~post12#1_1|, ~n1~0=v_~n1~0_24, thread3Thread1of1ForFork2_plus_#res#1=|v_thread3Thread1of1ForFork2_plus_#res#1_1|, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork2_plus_#in~a#1=|v_thread3Thread1of1ForFork2_plus_#in~a#1_1|, ~total~0=v_~total~0_57, thread3Thread1of1ForFork2_plus_~a#1=|v_thread3Thread1of1ForFork2_plus_~a#1_1|, thread3Thread1of1ForFork2_plus_#in~b#1=|v_thread3Thread1of1ForFork2_plus_#in~b#1_1|, ~q1_back~0=v_~q1_back~0_67, ~q1~0.base=v_~q1~0.base_29, #memory_int=|v_#memory_int_82|, thread3Thread1of1ForFork2_plus_~b#1=|v_thread3Thread1of1ForFork2_plus_~b#1_1|, thread3Thread1of1ForFork2_#t~ret11#1=|v_thread3Thread1of1ForFork2_#t~ret11#1_1|} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_#t~mem10#1, thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork2_plus_~a#1, ~q1_front~0, thread3Thread1of1ForFork2_#t~post12#1, thread3Thread1of1ForFork2_plus_#in~b#1, thread3Thread1of1ForFork2_plus_#res#1, thread3Thread1of1ForFork2_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork2_plus_#in~a#1, thread3Thread1of1ForFork2_plus_~b#1, thread3Thread1of1ForFork2_#t~ret11#1, ~total~0][722], [Black: 3070#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 3066#(and (<= (+ ~q1_front~0 1) ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), Black: 2264#(<= (+ ~q1_front~0 1) ~q1_back~0), Black: 1724#(<= ~q1_front~0 ~q1_back~0), 4656#(and (or (<= 1 ~q2_front~0) (< ~q1_front~0 0) (<= ~n1~0 ~q1_front~0) (not (< ~q1_back~0 ~n1~0)) (< ~q2_front~0 0) (not (<= 0 ~q2_back~0)) (not (<= 0 ~q1_back~0)) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0) (= (* ~q1_back~0 4) (* ~q1_front~0 4))) (<= 1 ~q2_back~0)) (or (< ~q1_front~0 0) (<= 1 ~q1_back~0) (<= 1 ~q1_front~0) (< ~q1_back~0 0) (and (< 0 (+ ~total~0 1)) (= (* ~i~0 4) (* ~j~0 4)) (<= ~total~0 0)))), Black: 3068#(and (<= ~q1_front~0 ~q1_back~0) (or (<= (+ ~q1_front~0 1) ~q1_back~0) (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0))), 3064#(and (<= ~q1_front~0 ~q1_back~0) (not (<= (mod |thread3Thread1of1ForFork2_~cond~2#1| 256) 0))), 259#true, Black: 1657#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (or (< ~i~0 ~N~0) (<= |ULTIMATE.start_create_fresh_int_array_#in~size#1| 0)) (or (not (< |ULTIMATE.start_create_fresh_int_array_~i~1#1| |ULTIMATE.start_create_fresh_int_array_~size#1|)) (< ~i~0 ~N~0)) (or (<= |ULTIMATE.start_create_fresh_int_array_~size#1| 0) (< ~i~0 ~N~0))), Black: 1673#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1054#(or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), 69#L147-1true, Black: 264#(= ~total~0 0), Black: 1661#(and (<= ~i~0 0) (or (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 1667#(and (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 330#(and (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= ~j~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~N~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 1669#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0)), Black: 1671#(and (or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)) (<= ~i~0 0) (< ~i~0 ~N~0) (not (<= (mod |thread1Thread1of1ForFork3_~cond~0#1| 256) 0))), Black: 358#true, Black: 277#(<= ~q1_back~0 ~q1_front~0), Black: 3096#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (= ~i~0 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|) (or (< ~i~0 ~N~0) (< ~q1_front~0 ~q1_back~0))), Black: 3086#(and (<= (div |thread3Thread1of1ForFork2_~cond~2#1| 256) 0) (<= 1 |thread3Thread1of1ForFork2_~cond~2#1|)), Black: 282#(<= ~q2_back~0 ~q2_front~0), 3078#true, 1058#(or (= (mod |thread4Thread1of1ForFork0_~cond~3#1| 256) 0) (< ~q2_front~0 0) (<= ~q2_back~0 ~q2_front~0)), Black: 1694#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 294#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 1714#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= (+ 1 ~q2_front~0) ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), Black: 1710#(<= ~q2_front~0 ~q2_back~0), Black: 1716#(and (<= 1 |thread4Thread1of1ForFork0_~cond~3#1|) (<= ~q2_front~0 ~q2_back~0) (<= (div |thread4Thread1of1ForFork0_~cond~3#1| 256) 0)), 198#L110-1true, 176#L97true, 1711#(<= (+ 1 ~q2_front~0) ~q2_back~0), Black: 311#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|))]) [2021-12-28 03:07:14,681 INFO L384 tUnfolder$Statistics]: this new event has 213 ancestors and is cut-off event [2021-12-28 03:07:14,681 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2021-12-28 03:07:14,681 INFO L387 tUnfolder$Statistics]: existing Event has 210 ancestors and is cut-off event [2021-12-28 03:07:14,681 INFO L387 tUnfolder$Statistics]: existing Event has 213 ancestors and is cut-off event [2021-12-28 03:07:15,250 INFO L129 PetriNetUnfolder]: 55321/103718 cut-off events. [2021-12-28 03:07:15,250 INFO L130 PetriNetUnfolder]: For 447193/449504 co-relation queries the response was YES. [2021-12-28 03:07:16,078 INFO L84 FinitePrefix]: Finished finitePrefix Result has 379107 conditions, 103718 events. 55321/103718 cut-off events. For 447193/449504 co-relation queries the response was YES. Maximal size of possible extension queue 4184. Compared 1098930 event pairs, 2924 based on Foata normal form. 316/98668 useless extension candidates. Maximal degree in co-relation 379075. Up to 23137 conditions per place. [2021-12-28 03:07:16,682 INFO L132 encePairwiseOnDemand]: 191/265 looper letters, 702 selfloop transitions, 535 changer transitions 12/1355 dead transitions. [2021-12-28 03:07:16,682 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 1355 transitions, 10485 flow [2021-12-28 03:07:16,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2021-12-28 03:07:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2021-12-28 03:07:16,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 10794 transitions. [2021-12-28 03:07:16,704 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4333199518265757 [2021-12-28 03:07:16,705 INFO L72 ComplementDD]: Start complementDD. Operand 94 states and 10794 transitions. [2021-12-28 03:07:16,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 94 states and 10794 transitions. [2021-12-28 03:07:16,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 03:07:16,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 94 states and 10794 transitions. [2021-12-28 03:07:16,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 95 states, 94 states have (on average 114.82978723404256) internal successors, (10794), 94 states have internal predecessors, (10794), 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) [2021-12-28 03:07:16,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 95 states, 95 states have (on average 265.0) internal successors, (25175), 95 states have internal predecessors, (25175), 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) [2021-12-28 03:07:16,741 INFO L81 ComplementDD]: Finished complementDD. Result has 95 states, 95 states have (on average 265.0) internal successors, (25175), 95 states have internal predecessors, (25175), 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) [2021-12-28 03:07:16,741 INFO L186 Difference]: Start difference. First operand has 293 places, 315 transitions, 1549 flow. Second operand 94 states and 10794 transitions. [2021-12-28 03:07:16,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 1355 transitions, 10485 flow