./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-lamport.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ff03de63 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/parallel-lamport.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 dda4e60b50ccb96ce521fa11aa956967863397082d82b1fb589f74967fe28a7c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 15:18:11,916 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 15:18:11,918 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 15:18:11,971 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 15:18:11,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 15:18:11,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 15:18:11,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 15:18:11,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 15:18:11,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 15:18:11,985 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 15:18:11,985 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 15:18:11,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 15:18:11,987 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 15:18:11,989 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 15:18:11,990 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 15:18:11,993 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 15:18:11,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 15:18:11,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 15:18:11,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 15:18:11,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 15:18:12,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 15:18:12,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 15:18:12,002 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 15:18:12,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 15:18:12,006 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 15:18:12,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 15:18:12,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 15:18:12,007 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 15:18:12,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 15:18:12,008 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 15:18:12,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 15:18:12,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 15:18:12,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 15:18:12,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 15:18:12,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 15:18:12,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 15:18:12,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 15:18:12,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 15:18:12,013 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 15:18:12,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 15:18:12,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 15:18:12,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-21 15:18:12,038 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 15:18:12,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 15:18:12,040 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 15:18:12,041 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 15:18:12,041 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-21 15:18:12,041 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-21 15:18:12,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 15:18:12,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 15:18:12,042 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 15:18:12,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 15:18:12,043 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 15:18:12,043 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 15:18:12,043 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 15:18:12,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 15:18:12,044 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-21 15:18:12,044 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-21 15:18:12,044 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-21 15:18:12,044 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 15:18:12,044 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 15:18:12,044 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 15:18:12,045 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-21 15:18:12,045 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 15:18:12,045 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 15:18:12,045 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-21 15:18:12,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:18:12,045 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 15:18:12,045 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-21 15:18:12,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-21 15:18:12,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 15:18:12,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-21 15:18:12,047 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-21 15:18:12,047 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-21 15:18:12,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-21 15:18:12,048 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 15:18:12,048 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 -> dda4e60b50ccb96ce521fa11aa956967863397082d82b1fb589f74967fe28a7c [2021-12-21 15:18:12,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 15:18:12,251 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 15:18:12,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 15:18:12,270 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 15:18:12,270 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 15:18:12,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2021-12-21 15:18:12,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7123c5cde/fa3e4768beb5430fab9f8bd4c292f32f/FLAG89abee8d5 [2021-12-21 15:18:12,688 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 15:18:12,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-lamport.wvr.c [2021-12-21 15:18:12,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7123c5cde/fa3e4768beb5430fab9f8bd4c292f32f/FLAG89abee8d5 [2021-12-21 15:18:12,706 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7123c5cde/fa3e4768beb5430fab9f8bd4c292f32f [2021-12-21 15:18:12,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 15:18:12,709 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 15:18:12,710 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 15:18:12,710 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 15:18:12,712 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 15:18:12,713 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:18:12" (1/1) ... [2021-12-21 15:18:12,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17aba1fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:18:12, skipping insertion in model container [2021-12-21 15:18:12,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 03:18:12" (1/1) ... [2021-12-21 15:18:12,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 15:18:12,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 15:18:12,886 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/parallel-lamport.wvr.c[4210,4223] [2021-12-21 15:18:12,894 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:18:12,899 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 15:18:12,917 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/parallel-lamport.wvr.c[4210,4223] [2021-12-21 15:18:12,919 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 15:18:12,929 INFO L208 MainTranslator]: Completed translation [2021-12-21 15:18:12,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:18:12 WrapperNode [2021-12-21 15:18:12,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 15:18:12,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 15:18:12,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 15:18:12,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 15:18:12,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:18:12" (1/1) ... [2021-12-21 15:18:12,941 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:18:12" (1/1) ... [2021-12-21 15:18:12,960 INFO L137 Inliner]: procedures = 25, calls = 89, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 235 [2021-12-21 15:18:12,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 15:18:12,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 15:18:12,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 15:18:12,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 15:18:12,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:18:12" (1/1) ... [2021-12-21 15:18:12,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:18:12" (1/1) ... [2021-12-21 15:18:12,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:18:12" (1/1) ... [2021-12-21 15:18:12,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:18:12" (1/1) ... [2021-12-21 15:18:12,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:18:12" (1/1) ... [2021-12-21 15:18:13,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:18:12" (1/1) ... [2021-12-21 15:18:13,004 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:18:12" (1/1) ... [2021-12-21 15:18:13,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 15:18:13,013 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 15:18:13,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 15:18:13,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 15:18:13,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:18:12" (1/1) ... [2021-12-21 15:18:13,019 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-21 15:18:13,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:18:13,039 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-21 15:18:13,045 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-21 15:18:13,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 15:18:13,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-21 15:18:13,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-21 15:18:13,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-21 15:18:13,063 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-12-21 15:18:13,063 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-12-21 15:18:13,063 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-12-21 15:18:13,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-12-21 15:18:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-12-21 15:18:13,066 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-12-21 15:18:13,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 15:18:13,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-21 15:18:13,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-21 15:18:13,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-21 15:18:13,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 15:18:13,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 15:18:13,067 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-21 15:18:13,068 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-21 15:18:13,154 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 15:18:13,168 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 15:18:13,441 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 15:18:13,503 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 15:18:13,503 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-21 15:18:13,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:18:13 BoogieIcfgContainer [2021-12-21 15:18:13,505 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 15:18:13,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-21 15:18:13,507 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-21 15:18:13,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-21 15:18:13,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 03:18:12" (1/3) ... [2021-12-21 15:18:13,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9886585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:18:13, skipping insertion in model container [2021-12-21 15:18:13,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 03:18:12" (2/3) ... [2021-12-21 15:18:13,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9886585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 03:18:13, skipping insertion in model container [2021-12-21 15:18:13,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 03:18:13" (3/3) ... [2021-12-21 15:18:13,514 INFO L111 eAbstractionObserver]: Analyzing ICFG parallel-lamport.wvr.c [2021-12-21 15:18:13,518 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-21 15:18:13,521 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-21 15:18:13,521 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-21 15:18:13,521 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-21 15:18:13,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,550 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,551 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,552 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,552 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,552 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,552 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,552 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,553 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,553 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,553 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,553 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,553 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,554 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,555 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,556 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,556 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,556 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,556 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,556 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,557 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,557 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,558 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,558 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,558 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,558 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,558 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,559 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,559 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,559 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,559 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,559 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,559 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,561 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem2#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,562 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,563 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,563 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,563 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,563 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,563 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,564 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,564 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,565 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-21 15:18:13,567 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-12-21 15:18:13,597 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-21 15:18:13,601 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-21 15:18:13,602 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-12-21 15:18:13,611 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 189 places, 186 transitions, 396 flow [2021-12-21 15:18:13,698 INFO L129 PetriNetUnfolder]: 7/183 cut-off events. [2021-12-21 15:18:13,699 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-21 15:18:13,701 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 183 events. 7/183 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/175 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2021-12-21 15:18:13,702 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 186 transitions, 396 flow [2021-12-21 15:18:13,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 172 transitions, 362 flow [2021-12-21 15:18:13,766 INFO L129 PetriNetUnfolder]: 7/171 cut-off events. [2021-12-21 15:18:13,767 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-21 15:18:13,767 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:18:13,771 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] [2021-12-21 15:18:13,771 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-21 15:18:13,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:18:13,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1585459092, now seen corresponding path program 1 times [2021-12-21 15:18:13,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:18:13,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208211341] [2021-12-21 15:18:13,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:18:13,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:18:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:18:13,997 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-21 15:18:13,999 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:18:14,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208211341] [2021-12-21 15:18:14,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208211341] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:18:14,000 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:18:14,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-21 15:18:14,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60059431] [2021-12-21 15:18:14,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:18:14,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-21 15:18:14,008 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:18:14,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-21 15:18:14,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-21 15:18:14,041 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 186 [2021-12-21 15:18:14,046 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 172 transitions, 362 flow. Second operand has 2 states, 2 states have (on average 171.0) internal successors, (342), 2 states have internal predecessors, (342), 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-21 15:18:14,047 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:18:14,047 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 186 [2021-12-21 15:18:14,048 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:18:14,186 INFO L129 PetriNetUnfolder]: 215/670 cut-off events. [2021-12-21 15:18:14,187 INFO L130 PetriNetUnfolder]: For 106/106 co-relation queries the response was YES. [2021-12-21 15:18:14,190 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1131 conditions, 670 events. 215/670 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3318 event pairs, 214 based on Foata normal form. 6/665 useless extension candidates. Maximal degree in co-relation 942. Up to 370 conditions per place. [2021-12-21 15:18:14,194 INFO L132 encePairwiseOnDemand]: 180/186 looper letters, 17 selfloop transitions, 0 changer transitions 5/166 dead transitions. [2021-12-21 15:18:14,195 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 166 transitions, 384 flow [2021-12-21 15:18:14,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-21 15:18:14,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-21 15:18:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 347 transitions. [2021-12-21 15:18:14,209 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9327956989247311 [2021-12-21 15:18:14,209 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 347 transitions. [2021-12-21 15:18:14,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 347 transitions. [2021-12-21 15:18:14,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:18:14,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 347 transitions. [2021-12-21 15:18:14,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 173.5) internal successors, (347), 2 states have internal predecessors, (347), 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-21 15:18:14,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 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-21 15:18:14,224 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 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-21 15:18:14,226 INFO L186 Difference]: Start difference. First operand has 175 places, 172 transitions, 362 flow. Second operand 2 states and 347 transitions. [2021-12-21 15:18:14,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 166 transitions, 384 flow [2021-12-21 15:18:14,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 166 transitions, 372 flow, removed 0 selfloop flow, removed 6 redundant places. [2021-12-21 15:18:14,232 INFO L242 Difference]: Finished difference. Result has 170 places, 161 transitions, 328 flow [2021-12-21 15:18:14,234 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=328, PETRI_PLACES=170, PETRI_TRANSITIONS=161} [2021-12-21 15:18:14,238 INFO L334 CegarLoopForPetriNet]: 175 programPoint places, -5 predicate places. [2021-12-21 15:18:14,238 INFO L470 AbstractCegarLoop]: Abstraction has has 170 places, 161 transitions, 328 flow [2021-12-21 15:18:14,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 171.0) internal successors, (342), 2 states have internal predecessors, (342), 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-21 15:18:14,238 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:18:14,239 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] [2021-12-21 15:18:14,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-21 15:18:14,239 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-21 15:18:14,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:18:14,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1309777273, now seen corresponding path program 1 times [2021-12-21 15:18:14,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:18:14,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040192837] [2021-12-21 15:18:14,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:18:14,241 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:18:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:18:14,531 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-21 15:18:14,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:18:14,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040192837] [2021-12-21 15:18:14,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040192837] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:18:14,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:18:14,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:18:14,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995650416] [2021-12-21 15:18:14,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:18:14,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:18:14,535 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:18:14,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:18:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:18:14,538 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 186 [2021-12-21 15:18:14,539 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 161 transitions, 328 flow. Second operand has 7 states, 7 states have (on average 147.57142857142858) internal successors, (1033), 7 states have internal predecessors, (1033), 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-21 15:18:14,539 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:18:14,539 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 186 [2021-12-21 15:18:14,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:18:14,745 INFO L129 PetriNetUnfolder]: 275/841 cut-off events. [2021-12-21 15:18:14,745 INFO L130 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2021-12-21 15:18:14,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 841 events. 275/841 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4309 event pairs, 274 based on Foata normal form. 41/873 useless extension candidates. Maximal degree in co-relation 1400. Up to 382 conditions per place. [2021-12-21 15:18:14,750 INFO L132 encePairwiseOnDemand]: 176/186 looper letters, 34 selfloop transitions, 6 changer transitions 13/178 dead transitions. [2021-12-21 15:18:14,751 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 178 transitions, 471 flow [2021-12-21 15:18:14,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 15:18:14,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-21 15:18:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1057 transitions. [2021-12-21 15:18:14,755 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8118279569892473 [2021-12-21 15:18:14,755 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1057 transitions. [2021-12-21 15:18:14,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1057 transitions. [2021-12-21 15:18:14,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:18:14,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1057 transitions. [2021-12-21 15:18:14,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 151.0) internal successors, (1057), 7 states have internal predecessors, (1057), 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-21 15:18:14,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 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-21 15:18:14,762 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 186.0) internal successors, (1488), 8 states have internal predecessors, (1488), 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-21 15:18:14,762 INFO L186 Difference]: Start difference. First operand has 170 places, 161 transitions, 328 flow. Second operand 7 states and 1057 transitions. [2021-12-21 15:18:14,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 178 transitions, 471 flow [2021-12-21 15:18:14,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 178 transitions, 471 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-21 15:18:14,770 INFO L242 Difference]: Finished difference. Result has 173 places, 162 transitions, 354 flow [2021-12-21 15:18:14,770 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=354, PETRI_PLACES=173, PETRI_TRANSITIONS=162} [2021-12-21 15:18:14,771 INFO L334 CegarLoopForPetriNet]: 175 programPoint places, -2 predicate places. [2021-12-21 15:18:14,771 INFO L470 AbstractCegarLoop]: Abstraction has has 173 places, 162 transitions, 354 flow [2021-12-21 15:18:14,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 147.57142857142858) internal successors, (1033), 7 states have internal predecessors, (1033), 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-21 15:18:14,772 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:18:14,772 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] [2021-12-21 15:18:14,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-21 15:18:14,773 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-21 15:18:14,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:18:14,773 INFO L85 PathProgramCache]: Analyzing trace with hash 710443097, now seen corresponding path program 1 times [2021-12-21 15:18:14,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:18:14,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467153537] [2021-12-21 15:18:14,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:18:14,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:18:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:18:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 15:18:14,899 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:18:14,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467153537] [2021-12-21 15:18:14,900 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467153537] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:18:14,900 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:18:14,900 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:18:14,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745818532] [2021-12-21 15:18:14,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:18:14,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:18:14,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:18:14,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:18:14,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:18:14,904 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 186 [2021-12-21 15:18:14,905 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 162 transitions, 354 flow. Second operand has 7 states, 7 states have (on average 152.42857142857142) internal successors, (1067), 7 states have internal predecessors, (1067), 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-21 15:18:14,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:18:14,906 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 186 [2021-12-21 15:18:14,906 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:18:15,258 INFO L129 PetriNetUnfolder]: 1031/2322 cut-off events. [2021-12-21 15:18:15,258 INFO L130 PetriNetUnfolder]: For 213/213 co-relation queries the response was YES. [2021-12-21 15:18:15,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4495 conditions, 2322 events. 1031/2322 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 15973 event pairs, 364 based on Foata normal form. 25/2314 useless extension candidates. Maximal degree in co-relation 4489. Up to 511 conditions per place. [2021-12-21 15:18:15,270 INFO L132 encePairwiseOnDemand]: 176/186 looper letters, 91 selfloop transitions, 18 changer transitions 0/240 dead transitions. [2021-12-21 15:18:15,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 240 transitions, 768 flow [2021-12-21 15:18:15,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:18:15,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:18:15,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1442 transitions. [2021-12-21 15:18:15,273 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8614097968936678 [2021-12-21 15:18:15,273 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1442 transitions. [2021-12-21 15:18:15,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1442 transitions. [2021-12-21 15:18:15,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:18:15,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1442 transitions. [2021-12-21 15:18:15,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 160.22222222222223) internal successors, (1442), 9 states have internal predecessors, (1442), 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-21 15:18:15,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 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-21 15:18:15,279 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 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-21 15:18:15,280 INFO L186 Difference]: Start difference. First operand has 173 places, 162 transitions, 354 flow. Second operand 9 states and 1442 transitions. [2021-12-21 15:18:15,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 240 transitions, 768 flow [2021-12-21 15:18:15,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 240 transitions, 758 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-12-21 15:18:15,284 INFO L242 Difference]: Finished difference. Result has 181 places, 176 transitions, 448 flow [2021-12-21 15:18:15,284 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=448, PETRI_PLACES=181, PETRI_TRANSITIONS=176} [2021-12-21 15:18:15,285 INFO L334 CegarLoopForPetriNet]: 175 programPoint places, 6 predicate places. [2021-12-21 15:18:15,285 INFO L470 AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 448 flow [2021-12-21 15:18:15,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 152.42857142857142) internal successors, (1067), 7 states have internal predecessors, (1067), 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-21 15:18:15,286 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:18:15,286 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] [2021-12-21 15:18:15,286 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-21 15:18:15,286 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-21 15:18:15,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:18:15,287 INFO L85 PathProgramCache]: Analyzing trace with hash 446910751, now seen corresponding path program 2 times [2021-12-21 15:18:15,287 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:18:15,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833436014] [2021-12-21 15:18:15,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:18:15,287 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:18:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:18:16,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:18:16,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:18:16,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833436014] [2021-12-21 15:18:16,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833436014] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:18:16,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346116972] [2021-12-21 15:18:16,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 15:18:16,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:18:16,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:18:16,137 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-21 15:18:16,138 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-21 15:18:16,234 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 15:18:16,234 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 15:18:16,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-21 15:18:16,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:18:16,828 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Unexpected substitution problem. [2021-12-21 15:18:16,829 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:18:16,829 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2021-12-21 15:18:16,829 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390626250] [2021-12-21 15:18:16,829 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-21 15:18:16,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-21 15:18:16,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:18:16,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-21 15:18:16,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2021-12-21 15:18:16,832 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 186 [2021-12-21 15:18:16,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 176 transitions, 448 flow. Second operand has 25 states, 25 states have (on average 103.92) internal successors, (2598), 25 states have internal predecessors, (2598), 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-21 15:18:16,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:18:16,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 186 [2021-12-21 15:18:16,835 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:18:18,961 INFO L129 PetriNetUnfolder]: 4163/8808 cut-off events. [2021-12-21 15:18:18,962 INFO L130 PetriNetUnfolder]: For 1176/1181 co-relation queries the response was YES. [2021-12-21 15:18:18,984 INFO L84 FinitePrefix]: Finished finitePrefix Result has 17569 conditions, 8808 events. 4163/8808 cut-off events. For 1176/1181 co-relation queries the response was YES. Maximal size of possible extension queue 519. Compared 78107 event pairs, 2283 based on Foata normal form. 2/8554 useless extension candidates. Maximal degree in co-relation 17558. Up to 3018 conditions per place. [2021-12-21 15:18:19,039 INFO L132 encePairwiseOnDemand]: 157/186 looper letters, 152 selfloop transitions, 32 changer transitions 8/294 dead transitions. [2021-12-21 15:18:19,040 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 294 transitions, 1120 flow [2021-12-21 15:18:19,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-21 15:18:19,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2021-12-21 15:18:19,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3021 transitions. [2021-12-21 15:18:19,045 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5800691244239631 [2021-12-21 15:18:19,045 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 3021 transitions. [2021-12-21 15:18:19,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 3021 transitions. [2021-12-21 15:18:19,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:18:19,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 3021 transitions. [2021-12-21 15:18:19,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 107.89285714285714) internal successors, (3021), 28 states have internal predecessors, (3021), 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-21 15:18:19,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 186.0) internal successors, (5394), 29 states have internal predecessors, (5394), 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-21 15:18:19,058 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 186.0) internal successors, (5394), 29 states have internal predecessors, (5394), 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-21 15:18:19,058 INFO L186 Difference]: Start difference. First operand has 181 places, 176 transitions, 448 flow. Second operand 28 states and 3021 transitions. [2021-12-21 15:18:19,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 294 transitions, 1120 flow [2021-12-21 15:18:19,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 294 transitions, 1120 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-21 15:18:19,071 INFO L242 Difference]: Finished difference. Result has 228 places, 201 transitions, 680 flow [2021-12-21 15:18:19,071 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=680, PETRI_PLACES=228, PETRI_TRANSITIONS=201} [2021-12-21 15:18:19,072 INFO L334 CegarLoopForPetriNet]: 175 programPoint places, 53 predicate places. [2021-12-21 15:18:19,072 INFO L470 AbstractCegarLoop]: Abstraction has has 228 places, 201 transitions, 680 flow [2021-12-21 15:18:19,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 103.92) internal successors, (2598), 25 states have internal predecessors, (2598), 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-21 15:18:19,073 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:18:19,073 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] [2021-12-21 15:18:19,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-21 15:18:19,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:18:19,292 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-21 15:18:19,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:18:19,293 INFO L85 PathProgramCache]: Analyzing trace with hash 858280453, now seen corresponding path program 3 times [2021-12-21 15:18:19,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:18:19,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39803506] [2021-12-21 15:18:19,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:18:19,293 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:18:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:18:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 15:18:19,362 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:18:19,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39803506] [2021-12-21 15:18:19,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39803506] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:18:19,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:18:19,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 15:18:19,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729475286] [2021-12-21 15:18:19,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:18:19,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-21 15:18:19,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:18:19,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 15:18:19,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 15:18:19,364 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 186 [2021-12-21 15:18:19,365 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 201 transitions, 680 flow. Second operand has 7 states, 7 states have (on average 152.42857142857142) internal successors, (1067), 7 states have internal predecessors, (1067), 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-21 15:18:19,365 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:18:19,365 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 186 [2021-12-21 15:18:19,366 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:18:20,061 INFO L129 PetriNetUnfolder]: 1889/4383 cut-off events. [2021-12-21 15:18:20,062 INFO L130 PetriNetUnfolder]: For 4570/4574 co-relation queries the response was YES. [2021-12-21 15:18:20,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11835 conditions, 4383 events. 1889/4383 cut-off events. For 4570/4574 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 35275 event pairs, 343 based on Foata normal form. 56/4395 useless extension candidates. Maximal degree in co-relation 11803. Up to 737 conditions per place. [2021-12-21 15:18:20,096 INFO L132 encePairwiseOnDemand]: 176/186 looper letters, 122 selfloop transitions, 24 changer transitions 16/307 dead transitions. [2021-12-21 15:18:20,096 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 307 transitions, 1561 flow [2021-12-21 15:18:20,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-21 15:18:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-21 15:18:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1439 transitions. [2021-12-21 15:18:20,099 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8596176821983273 [2021-12-21 15:18:20,099 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1439 transitions. [2021-12-21 15:18:20,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1439 transitions. [2021-12-21 15:18:20,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:18:20,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1439 transitions. [2021-12-21 15:18:20,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 159.88888888888889) internal successors, (1439), 9 states have internal predecessors, (1439), 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-21 15:18:20,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 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-21 15:18:20,106 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 186.0) internal successors, (1860), 10 states have internal predecessors, (1860), 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-21 15:18:20,106 INFO L186 Difference]: Start difference. First operand has 228 places, 201 transitions, 680 flow. Second operand 9 states and 1439 transitions. [2021-12-21 15:18:20,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 307 transitions, 1561 flow [2021-12-21 15:18:20,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 307 transitions, 1510 flow, removed 20 selfloop flow, removed 8 redundant places. [2021-12-21 15:18:20,125 INFO L242 Difference]: Finished difference. Result has 229 places, 203 transitions, 740 flow [2021-12-21 15:18:20,126 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=740, PETRI_PLACES=229, PETRI_TRANSITIONS=203} [2021-12-21 15:18:20,128 INFO L334 CegarLoopForPetriNet]: 175 programPoint places, 54 predicate places. [2021-12-21 15:18:20,128 INFO L470 AbstractCegarLoop]: Abstraction has has 229 places, 203 transitions, 740 flow [2021-12-21 15:18:20,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 152.42857142857142) internal successors, (1067), 7 states have internal predecessors, (1067), 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-21 15:18:20,128 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:18:20,129 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] [2021-12-21 15:18:20,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-21 15:18:20,129 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-21 15:18:20,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:18:20,130 INFO L85 PathProgramCache]: Analyzing trace with hash 188814389, now seen corresponding path program 4 times [2021-12-21 15:18:20,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:18:20,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644120250] [2021-12-21 15:18:20,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:18:20,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:18:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:18:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:18:21,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:18:21,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644120250] [2021-12-21 15:18:21,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644120250] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:18:21,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460336931] [2021-12-21 15:18:21,578 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 15:18:21,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:18:21,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:18:21,580 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-21 15:18:21,581 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-21 15:18:21,665 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 15:18:21,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 15:18:21,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 46 conjunts are in the unsatisfiable core [2021-12-21 15:18:21,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:18:23,160 INFO L353 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2021-12-21 15:18:23,160 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-12-21 15:18:23,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:18:23,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:18:23,665 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 15:18:23,666 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 36 [2021-12-21 15:18:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:18:24,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460336931] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 15:18:24,628 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 15:18:24,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 25, 20] total 70 [2021-12-21 15:18:24,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009853254] [2021-12-21 15:18:24,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 15:18:24,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2021-12-21 15:18:24,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:18:24,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2021-12-21 15:18:24,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=4396, Unknown=0, NotChecked=0, Total=4830 [2021-12-21 15:18:24,634 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 186 [2021-12-21 15:18:24,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 203 transitions, 740 flow. Second operand has 70 states, 70 states have (on average 89.88571428571429) internal successors, (6292), 70 states have internal predecessors, (6292), 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-21 15:18:24,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:18:24,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 186 [2021-12-21 15:18:24,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:18:37,567 INFO L129 PetriNetUnfolder]: 7010/15005 cut-off events. [2021-12-21 15:18:37,567 INFO L130 PetriNetUnfolder]: For 18556/18691 co-relation queries the response was YES. [2021-12-21 15:18:37,657 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41115 conditions, 15005 events. 7010/15005 cut-off events. For 18556/18691 co-relation queries the response was YES. Maximal size of possible extension queue 867. Compared 145900 event pairs, 975 based on Foata normal form. 47/14771 useless extension candidates. Maximal degree in co-relation 41082. Up to 4791 conditions per place. [2021-12-21 15:18:37,698 INFO L132 encePairwiseOnDemand]: 133/186 looper letters, 401 selfloop transitions, 309 changer transitions 54/864 dead transitions. [2021-12-21 15:18:37,698 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 864 transitions, 5042 flow [2021-12-21 15:18:37,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2021-12-21 15:18:37,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2021-12-21 15:18:37,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 8726 transitions. [2021-12-21 15:18:37,713 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.509934548854605 [2021-12-21 15:18:37,713 INFO L72 ComplementDD]: Start complementDD. Operand 92 states and 8726 transitions. [2021-12-21 15:18:37,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 8726 transitions. [2021-12-21 15:18:37,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:18:37,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 92 states and 8726 transitions. [2021-12-21 15:18:37,729 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 93 states, 92 states have (on average 94.84782608695652) internal successors, (8726), 92 states have internal predecessors, (8726), 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-21 15:18:37,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 93 states, 93 states have (on average 186.0) internal successors, (17298), 93 states have internal predecessors, (17298), 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-21 15:18:37,764 INFO L81 ComplementDD]: Finished complementDD. Result has 93 states, 93 states have (on average 186.0) internal successors, (17298), 93 states have internal predecessors, (17298), 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-21 15:18:37,765 INFO L186 Difference]: Start difference. First operand has 229 places, 203 transitions, 740 flow. Second operand 92 states and 8726 transitions. [2021-12-21 15:18:37,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 864 transitions, 5042 flow [2021-12-21 15:18:37,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 864 transitions, 5000 flow, removed 8 selfloop flow, removed 4 redundant places. [2021-12-21 15:18:37,856 INFO L242 Difference]: Finished difference. Result has 353 places, 553 transitions, 3674 flow [2021-12-21 15:18:37,857 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=92, PETRI_FLOW=3674, PETRI_PLACES=353, PETRI_TRANSITIONS=553} [2021-12-21 15:18:37,857 INFO L334 CegarLoopForPetriNet]: 175 programPoint places, 178 predicate places. [2021-12-21 15:18:37,857 INFO L470 AbstractCegarLoop]: Abstraction has has 353 places, 553 transitions, 3674 flow [2021-12-21 15:18:37,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 89.88571428571429) internal successors, (6292), 70 states have internal predecessors, (6292), 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-21 15:18:37,859 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:18:37,860 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] [2021-12-21 15:18:37,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-21 15:18:38,075 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,SelfDestructingSolverStorable5 [2021-12-21 15:18:38,076 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-21 15:18:38,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:18:38,077 INFO L85 PathProgramCache]: Analyzing trace with hash 543071151, now seen corresponding path program 5 times [2021-12-21 15:18:38,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:18:38,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929340266] [2021-12-21 15:18:38,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:18:38,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:18:38,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:18:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:18:38,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:18:38,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929340266] [2021-12-21 15:18:38,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929340266] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:18:38,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319534467] [2021-12-21 15:18:38,378 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 15:18:38,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:18:38,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:18:38,379 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-21 15:18:38,380 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-21 15:18:38,469 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 15:18:38,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 15:18:38,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 48 conjunts are in the unsatisfiable core [2021-12-21 15:18:38,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:18:39,513 INFO L353 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2021-12-21 15:18:39,514 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 18 [2021-12-21 15:18:39,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:18:39,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 15:18:39,656 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-21 15:18:39,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2021-12-21 15:18:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:18:40,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319534467] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 15:18:40,757 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 15:18:40,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 20] total 48 [2021-12-21 15:18:40,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73166537] [2021-12-21 15:18:40,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 15:18:40,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2021-12-21 15:18:40,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:18:40,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2021-12-21 15:18:40,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=1944, Unknown=0, NotChecked=0, Total=2256 [2021-12-21 15:18:40,761 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 186 [2021-12-21 15:18:40,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 553 transitions, 3674 flow. Second operand has 48 states, 48 states have (on average 102.5625) internal successors, (4923), 48 states have internal predecessors, (4923), 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-21 15:18:40,765 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:18:40,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 186 [2021-12-21 15:18:40,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:18:46,437 INFO L129 PetriNetUnfolder]: 8458/19871 cut-off events. [2021-12-21 15:18:46,437 INFO L130 PetriNetUnfolder]: For 175182/176197 co-relation queries the response was YES. [2021-12-21 15:18:46,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93824 conditions, 19871 events. 8458/19871 cut-off events. For 175182/176197 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 217315 event pairs, 1430 based on Foata normal form. 463/20054 useless extension candidates. Maximal degree in co-relation 93755. Up to 4265 conditions per place. [2021-12-21 15:18:46,721 INFO L132 encePairwiseOnDemand]: 147/186 looper letters, 532 selfloop transitions, 309 changer transitions 414/1361 dead transitions. [2021-12-21 15:18:46,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 1361 transitions, 13191 flow [2021-12-21 15:18:46,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-12-21 15:18:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2021-12-21 15:18:46,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 5100 transitions. [2021-12-21 15:18:46,728 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.571236559139785 [2021-12-21 15:18:46,729 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 5100 transitions. [2021-12-21 15:18:46,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 5100 transitions. [2021-12-21 15:18:46,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:18:46,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 5100 transitions. [2021-12-21 15:18:46,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 106.25) internal successors, (5100), 48 states have internal predecessors, (5100), 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-21 15:18:46,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 186.0) internal successors, (9114), 49 states have internal predecessors, (9114), 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-21 15:18:46,747 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 186.0) internal successors, (9114), 49 states have internal predecessors, (9114), 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-21 15:18:46,747 INFO L186 Difference]: Start difference. First operand has 353 places, 553 transitions, 3674 flow. Second operand 48 states and 5100 transitions. [2021-12-21 15:18:46,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 1361 transitions, 13191 flow [2021-12-21 15:18:48,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 1361 transitions, 12072 flow, removed 533 selfloop flow, removed 31 redundant places. [2021-12-21 15:18:48,076 INFO L242 Difference]: Finished difference. Result has 385 places, 665 transitions, 5639 flow [2021-12-21 15:18:48,077 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=3191, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=167, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=5639, PETRI_PLACES=385, PETRI_TRANSITIONS=665} [2021-12-21 15:18:48,078 INFO L334 CegarLoopForPetriNet]: 175 programPoint places, 210 predicate places. [2021-12-21 15:18:48,078 INFO L470 AbstractCegarLoop]: Abstraction has has 385 places, 665 transitions, 5639 flow [2021-12-21 15:18:48,079 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 102.5625) internal successors, (4923), 48 states have internal predecessors, (4923), 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-21 15:18:48,079 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:18:48,079 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] [2021-12-21 15:18:48,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-21 15:18:48,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:18:48,288 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-21 15:18:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:18:48,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1185558227, now seen corresponding path program 6 times [2021-12-21 15:18:48,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:18:48,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623239915] [2021-12-21 15:18:48,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:18:48,289 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:18:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:18:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 15:18:49,090 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:18:49,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623239915] [2021-12-21 15:18:49,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623239915] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 15:18:49,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809558482] [2021-12-21 15:18:49,091 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-21 15:18:49,091 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:18:49,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 15:18:49,092 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 15:18:49,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 15:18:49,175 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2021-12-21 15:18:49,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 15:18:49,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-21 15:18:49,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 15:18:49,221 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-12-21 15:18:49,283 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-21 15:18:49,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-12-21 15:18:49,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2021-12-21 15:18:49,896 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: Unexpected substitution problem. [2021-12-21 15:18:49,896 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2021-12-21 15:18:49,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2021-12-21 15:18:49,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458287855] [2021-12-21 15:18:49,896 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2021-12-21 15:18:49,897 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2021-12-21 15:18:49,897 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:18:49,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-12-21 15:18:49,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1663, Unknown=0, NotChecked=0, Total=1806 [2021-12-21 15:18:49,899 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 186 [2021-12-21 15:18:49,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 665 transitions, 5639 flow. Second operand has 29 states, 29 states have (on average 91.79310344827586) internal successors, (2662), 29 states have internal predecessors, (2662), 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-21 15:18:49,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:18:49,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 186 [2021-12-21 15:18:49,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:18:54,963 INFO L129 PetriNetUnfolder]: 6707/16860 cut-off events. [2021-12-21 15:18:54,963 INFO L130 PetriNetUnfolder]: For 213219/214372 co-relation queries the response was YES. [2021-12-21 15:18:55,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92499 conditions, 16860 events. 6707/16860 cut-off events. For 213219/214372 co-relation queries the response was YES. Maximal size of possible extension queue 1085. Compared 188021 event pairs, 1814 based on Foata normal form. 340/16904 useless extension candidates. Maximal degree in co-relation 92414. Up to 5145 conditions per place. [2021-12-21 15:18:55,193 INFO L132 encePairwiseOnDemand]: 154/186 looper letters, 450 selfloop transitions, 164 changer transitions 142/856 dead transitions. [2021-12-21 15:18:55,193 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 856 transitions, 8989 flow [2021-12-21 15:18:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-21 15:18:55,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2021-12-21 15:18:55,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2968 transitions. [2021-12-21 15:18:55,196 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5147415886229622 [2021-12-21 15:18:55,196 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2968 transitions. [2021-12-21 15:18:55,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2968 transitions. [2021-12-21 15:18:55,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:18:55,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2968 transitions. [2021-12-21 15:18:55,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 95.74193548387096) internal successors, (2968), 31 states have internal predecessors, (2968), 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-21 15:18:55,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 186.0) internal successors, (5952), 32 states have internal predecessors, (5952), 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-21 15:18:55,205 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 186.0) internal successors, (5952), 32 states have internal predecessors, (5952), 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-21 15:18:55,205 INFO L186 Difference]: Start difference. First operand has 385 places, 665 transitions, 5639 flow. Second operand 31 states and 2968 transitions. [2021-12-21 15:18:55,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 856 transitions, 8989 flow [2021-12-21 15:18:57,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 856 transitions, 8613 flow, removed 158 selfloop flow, removed 31 redundant places. [2021-12-21 15:18:57,202 INFO L242 Difference]: Finished difference. Result has 381 places, 647 transitions, 5614 flow [2021-12-21 15:18:57,203 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=5341, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=501, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=5614, PETRI_PLACES=381, PETRI_TRANSITIONS=647} [2021-12-21 15:18:57,203 INFO L334 CegarLoopForPetriNet]: 175 programPoint places, 206 predicate places. [2021-12-21 15:18:57,203 INFO L470 AbstractCegarLoop]: Abstraction has has 381 places, 647 transitions, 5614 flow [2021-12-21 15:18:57,204 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 91.79310344827586) internal successors, (2662), 29 states have internal predecessors, (2662), 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-21 15:18:57,204 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:18:57,204 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] [2021-12-21 15:18:57,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-21 15:18:57,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 15:18:57,405 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-21 15:18:57,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:18:57,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1607174483, now seen corresponding path program 7 times [2021-12-21 15:18:57,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:18:57,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674552237] [2021-12-21 15:18:57,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:18:57,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:18:57,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:18:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 15:18:57,479 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:18:57,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674552237] [2021-12-21 15:18:57,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674552237] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:18:57,480 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:18:57,480 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 15:18:57,480 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364952066] [2021-12-21 15:18:57,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:18:57,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-21 15:18:57,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:18:57,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 15:18:57,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-21 15:18:57,482 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 186 [2021-12-21 15:18:57,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 647 transitions, 5614 flow. Second operand has 8 states, 8 states have (on average 151.875) internal successors, (1215), 8 states have internal predecessors, (1215), 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-21 15:18:57,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:18:57,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 186 [2021-12-21 15:18:57,483 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:19:03,989 INFO L129 PetriNetUnfolder]: 13049/31040 cut-off events. [2021-12-21 15:19:03,990 INFO L130 PetriNetUnfolder]: For 419520/420279 co-relation queries the response was YES. [2021-12-21 15:19:04,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 171176 conditions, 31040 events. 13049/31040 cut-off events. For 419520/420279 co-relation queries the response was YES. Maximal size of possible extension queue 1665. Compared 363709 event pairs, 1680 based on Foata normal form. 346/30914 useless extension candidates. Maximal degree in co-relation 171093. Up to 7032 conditions per place. [2021-12-21 15:19:04,800 INFO L132 encePairwiseOnDemand]: 175/186 looper letters, 1288 selfloop transitions, 35 changer transitions 259/1832 dead transitions. [2021-12-21 15:19:04,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 1832 transitions, 24450 flow [2021-12-21 15:19:04,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-21 15:19:04,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-21 15:19:04,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1755 transitions. [2021-12-21 15:19:04,802 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8577712609970675 [2021-12-21 15:19:04,802 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1755 transitions. [2021-12-21 15:19:04,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1755 transitions. [2021-12-21 15:19:04,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:19:04,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1755 transitions. [2021-12-21 15:19:04,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 159.54545454545453) internal successors, (1755), 11 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-21 15:19:04,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 186.0) internal successors, (2232), 12 states have internal predecessors, (2232), 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-21 15:19:04,808 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 186.0) internal successors, (2232), 12 states have internal predecessors, (2232), 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-21 15:19:04,808 INFO L186 Difference]: Start difference. First operand has 381 places, 647 transitions, 5614 flow. Second operand 11 states and 1755 transitions. [2021-12-21 15:19:04,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 1832 transitions, 24450 flow [2021-12-21 15:19:08,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 1832 transitions, 23363 flow, removed 63 selfloop flow, removed 28 redundant places. [2021-12-21 15:19:08,343 INFO L242 Difference]: Finished difference. Result has 359 places, 640 transitions, 5355 flow [2021-12-21 15:19:08,344 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=5373, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5355, PETRI_PLACES=359, PETRI_TRANSITIONS=640} [2021-12-21 15:19:08,344 INFO L334 CegarLoopForPetriNet]: 175 programPoint places, 184 predicate places. [2021-12-21 15:19:08,344 INFO L470 AbstractCegarLoop]: Abstraction has has 359 places, 640 transitions, 5355 flow [2021-12-21 15:19:08,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 151.875) internal successors, (1215), 8 states have internal predecessors, (1215), 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-21 15:19:08,345 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-21 15:19:08,345 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] [2021-12-21 15:19:08,345 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-21 15:19:08,345 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-12-21 15:19:08,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 15:19:08,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1794266773, now seen corresponding path program 8 times [2021-12-21 15:19:08,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 15:19:08,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816787649] [2021-12-21 15:19:08,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 15:19:08,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 15:19:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 15:19:08,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 15:19:08,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 15:19:08,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816787649] [2021-12-21 15:19:08,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816787649] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 15:19:08,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 15:19:08,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 15:19:08,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698499999] [2021-12-21 15:19:08,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 15:19:08,401 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-21 15:19:08,401 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 15:19:08,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 15:19:08,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 15:19:08,401 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 186 [2021-12-21 15:19:08,402 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 640 transitions, 5355 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-21 15:19:08,402 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-21 15:19:08,402 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 186 [2021-12-21 15:19:08,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-21 15:19:11,628 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] L68-->L71: Formula: (= v_~i~0_28 (select (select |v_#memory_int_30| v_~f~0.base_19) (+ v_~f~0.offset_19 (* v_~i1~0_7 4)))) InVars {#memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, ~f~0.base=v_~f~0.base_19, ~f~0.offset=v_~f~0.offset_19} OutVars{~i~0=v_~i~0_28, ~f~0.base=v_~f~0.base_19, #memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, ~f~0.offset=v_~f~0.offset_19, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_1|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork2_#t~mem1#1][439], [Black: 741#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 743#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (not (= (+ (* ~j~0 4) ~f~0.offset) 0)) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1874#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (or (not (< ~j~0 ~n~0)) (not (<= 0 ~j~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0))) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 826#(= ~j~0 ~i~0), Black: 1921#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 711#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 725#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1913#(and (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (<= ~n~0 1) (= ~f~0.offset 0)), Black: 1956#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 (+ (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 1)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (<= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1886#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1897#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1924#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (<= ~n~0 (+ (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 1)) (<= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)) (<= ~n~0 ~j~0) (< ~j~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 1880#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 3101#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1928#(and (or (<= (+ ~j~0 1) 0) (= ~i~0 0) (<= ~n~0 ~j~0)) (or (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= ~n~0 1)) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (= ~f~0.offset 0)), Black: 1255#(and (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= 0 ~i~0) (< ~i~0 ~n~0) (<= ~n~0 1) (= ~f~0.offset 0)), Black: 1846#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 822#(and (or (<= (+ ~j~0 1) 0) (= ~i~0 0) (<= ~n~0 ~j~0)) (or (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= ~n~0 1)) (= ~f~0.offset 0)), Black: 1890#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2006#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= ~j~0 0) (<= ~n~0 0)) (or (and (<= ~n~0 (+ (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 1)) (<= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)) (<= ~n~0 ~j~0) (< ~j~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (or (<= ~n~0 (+ ~j~0 1)) (<= ~n~0 0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1266#(and (< ~j~0 1) (<= 0 ~i~0) (<= 0 ~j~0) (< ~i~0 1)), Black: 1926#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (not (= (+ (* ~j~0 4) ~f~0.offset) 0))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 1894#(and (or (<= (+ ~j~0 1) 0) (= ~i~0 0) (<= ~n~0 ~j~0)) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= ~n~0 1) (= ~f~0.offset 0)), 15#L71true, Black: 1947#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (< ~i~0 ~n~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 1888#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1932#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 1) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 823#(and (or (<= (+ (* ~j~0 4) ~f~0.offset) 0) (not (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (<= ~n~0 1)) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (= ~f~0.offset 0)), Black: 788#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 1902#(and (or (<= (+ ~j~0 1) 0) (= ~i~0 0) (<= ~n~0 ~j~0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 1942#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (<= ~n~0 (+ (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 1)) (<= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)) (<= ~n~0 ~j~0) (< ~j~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 781#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1962#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (<= ~n~0 (+ (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 1)) (<= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)) (<= ~n~0 ~j~0) (< ~j~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 ~j~0) (not (= (+ (* ~j~0 4) ~f~0.offset) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 784#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1951#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1916#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1949#(and (or (<= (+ (* ~j~0 4) ~f~0.offset) 0) (not (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (<= ~n~0 1)) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 ~j~0) (not (= (+ (* ~j~0 4) ~f~0.offset) 0))) (= ~f~0.offset 0)), Black: 3726#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 795#true, 3775#true, 143#L156-1true, 31#L120true, 11#L106true, Black: 3767#(and (<= 1 ~n1~0) (= ~tmp2~0 0) (<= ~n1~0 1) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0)), Black: 3752#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 3758#(and (= ~tmp2~0 0) (= ~n2~0 0) (= ~n1~0 0)), Black: 3769#(and (<= 1 ~n1~0) (= ~tmp2~0 0) (<= ~n1~0 1) (= ~tmp1~0 0)), 192#true, Black: 205#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 207#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n~0 0)), 226#(and (= ~tmp2~0 0) (<= 1 ~n2~0)), 709#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 219#(and (= ~tmp2~0 0) (= ~n1~0 0)), Black: 3147#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~i~0 ~n~0) (<= 0 ~j~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= (select (select |#memory_int| ~f~0.base) 0) ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 228#(and (= ~tmp2~0 0) (<= 1 ~n2~0) (<= ~n2~0 ~tmp1~0) (<= (+ ~n2~0 1) ~n1~0)), 3749#true, Black: 3163#(and (<= ~i~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3145#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (select (select |#memory_int| ~f~0.base) 0) ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3159#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3153#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~i~0 ~n~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 723#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3157#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= (select (select |#memory_int| ~f~0.base) 0) ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3143#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~i~0 ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 715#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 729#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (and (or (<= (+ ~n~0 ~j~0) (+ ~i~0 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0)) (or (< 0 (+ (* ~j~0 4) ~f~0.offset 1)) (<= ~i~0 ~j~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3119#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 721#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 727#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3139#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~i~0 ~n~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 737#(and (or (and (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= ~n~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~n~0 ~j~0) (+ ~i~0 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (< 0 (+ (* ~j~0 4) ~f~0.offset 1)) (<= ~i~0 ~j~0)) (<= ~n~0 1) (or (and (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= ~n~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3149#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~i~0 ~n~0) (<= 0 ~j~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= (select (select |#memory_int| ~f~0.base) 0) ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3161#(and (<= ~i~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 717#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3155#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~i~0 ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 733#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~n~0 ~j~0) (+ ~i~0 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (< 0 (+ (* ~j~0 4) ~f~0.offset 1)) (<= ~i~0 ~j~0)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2020#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (<= ~n~0 (+ (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 1)) (<= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)) (<= ~n~0 ~j~0) (< ~j~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 3151#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 745#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1906#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 731#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (and (or (<= (+ ~n~0 ~j~0) (+ ~i~0 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0)) (or (< 0 (+ (* ~j~0 4) ~f~0.offset 1)) (<= ~i~0 ~j~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (or (and (or (<= (+ ~n~0 ~j~0) (+ ~i~0 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0)) (or (< 0 (+ (* ~j~0 4) ~f~0.offset 1)) (<= ~i~0 ~j~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 739#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1966#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 719#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1262#(and (< ~j~0 1) (<= 0 ~i~0) (<= 0 ~j~0) (< ~i~0 1) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 1) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (= ~f~0.offset 0)), Black: 735#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~n~0 ~j~0) (+ ~i~0 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (< 0 (+ (* ~j~0 4) ~f~0.offset 1)) (<= ~i~0 ~j~0)) (or (and (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1936#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0))]) [2021-12-21 15:19:11,630 INFO L384 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2021-12-21 15:19:11,630 INFO L387 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2021-12-21 15:19:11,630 INFO L387 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2021-12-21 15:19:11,631 INFO L387 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2021-12-21 15:19:11,651 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([547] L68-->L71: Formula: (= v_~i~0_28 (select (select |v_#memory_int_30| v_~f~0.base_19) (+ v_~f~0.offset_19 (* v_~i1~0_7 4)))) InVars {#memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, ~f~0.base=v_~f~0.base_19, ~f~0.offset=v_~f~0.offset_19} OutVars{~i~0=v_~i~0_28, ~f~0.base=v_~f~0.base_19, #memory_int=|v_#memory_int_30|, ~i1~0=v_~i1~0_7, ~f~0.offset=v_~f~0.offset_19, thread1Thread1of1ForFork2_#t~mem1#1=|v_thread1Thread1of1ForFork2_#t~mem1#1_1|} AuxVars[] AssignedVars[~i~0, thread1Thread1of1ForFork2_#t~mem1#1][439], [Black: 741#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 743#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (not (= (+ (* ~j~0 4) ~f~0.offset) 0)) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1874#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (and (or (not (< ~j~0 ~n~0)) (not (<= 0 ~j~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0))) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 826#(= ~j~0 ~i~0), Black: 1921#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 711#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 725#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1913#(and (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (<= ~n~0 1) (= ~f~0.offset 0)), Black: 1956#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (<= ~n~0 (+ (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 1)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (<= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1886#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1897#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1924#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (<= ~n~0 (+ (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 1)) (<= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)) (<= ~n~0 ~j~0) (< ~j~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 1880#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1928#(and (or (<= (+ ~j~0 1) 0) (= ~i~0 0) (<= ~n~0 ~j~0)) (or (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= ~n~0 1)) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (= ~f~0.offset 0)), 3101#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1255#(and (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= 0 ~i~0) (< ~i~0 ~n~0) (<= ~n~0 1) (= ~f~0.offset 0)), Black: 1846#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 822#(and (or (<= (+ ~j~0 1) 0) (= ~i~0 0) (<= ~n~0 ~j~0)) (or (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= ~n~0 1)) (= ~f~0.offset 0)), Black: 1890#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2006#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= ~j~0 0) (<= ~n~0 0)) (or (and (<= ~n~0 (+ (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 1)) (<= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)) (<= ~n~0 ~j~0) (< ~j~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (or (<= ~n~0 (+ ~j~0 1)) (<= ~n~0 0)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1266#(and (< ~j~0 1) (<= 0 ~i~0) (<= 0 ~j~0) (< ~i~0 1)), Black: 1926#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (not (= (+ (* ~j~0 4) ~f~0.offset) 0))) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 1894#(and (or (<= (+ ~j~0 1) 0) (= ~i~0 0) (<= ~n~0 ~j~0)) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= ~n~0 1) (= ~f~0.offset 0)), Black: 1947#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (<= 0 ~i~0) (< ~i~0 ~n~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), 15#L71true, Black: 1888#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1932#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 1) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 823#(and (or (<= (+ (* ~j~0 4) ~f~0.offset) 0) (not (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (<= ~n~0 1)) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (= ~f~0.offset 0)), Black: 1902#(and (or (<= (+ ~j~0 1) 0) (= ~i~0 0) (<= ~n~0 ~j~0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 788#(and (<= 1 ~n1~0) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0) (<= ~n1~0 ~tmp2~0)), Black: 1942#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (<= ~n~0 (+ (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 1)) (<= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)) (<= ~n~0 ~j~0) (< ~j~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 781#(and (= ~n2~0 0) (= ~tmp1~0 0)), Black: 784#(and (<= 1 ~n1~0) (= ~n2~0 0) (= ~tmp1~0 0)), Black: 1962#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (<= ~n~0 (+ (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 1)) (<= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)) (<= ~n~0 ~j~0) (< ~j~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 ~j~0) (not (= (+ (* ~j~0 4) ~f~0.offset) 0))) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 1951#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 1916#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1949#(and (or (<= (+ (* ~j~0 4) ~f~0.offset) 0) (not (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (<= ~n~0 1)) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (or (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 ~j~0) (not (= (+ (* ~j~0 4) ~f~0.offset) 0))) (= ~f~0.offset 0)), Black: 3726#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= ~n~0 1) (= (select |#valid| |ULTIMATE.start_main_~#t3~0#1.base|) 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 795#true, 3775#true, 143#L156-1true, 31#L120true, 11#L106true, Black: 3767#(and (<= 1 ~n1~0) (= ~tmp2~0 0) (<= ~n1~0 1) (= ~tmp1~0 0) (<= ~n1~0 ~n2~0)), Black: 3752#(and (= ~n2~0 0) (= ~n1~0 0)), Black: 3758#(and (= ~tmp2~0 0) (= ~n2~0 0) (= ~n1~0 0)), 192#true, Black: 205#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), Black: 207#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n~0 0)), 226#(and (= ~tmp2~0 0) (<= 1 ~n2~0)), 709#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 219#(and (= ~tmp2~0 0) (= ~n1~0 0)), Black: 3147#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~i~0 ~n~0) (<= 0 ~j~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= (select (select |#memory_int| ~f~0.base) 0) ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 228#(and (= ~tmp2~0 0) (<= 1 ~n2~0) (<= ~n2~0 ~tmp1~0) (<= (+ ~n2~0 1) ~n1~0)), Black: 3163#(and (<= ~i~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 3769#(and (<= 1 ~n1~0) (= ~tmp2~0 0) (<= ~n1~0 1) (= ~tmp1~0 0)), Black: 3145#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (select (select |#memory_int| ~f~0.base) 0) ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3159#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3153#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~i~0 ~n~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 723#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_main_#t~ret12#1.offset| 0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3157#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= ~j~0 ~i~0) (= (select (select |#memory_int| ~f~0.base) 0) ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3143#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~i~0 ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 715#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 729#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (and (or (<= (+ ~n~0 ~j~0) (+ ~i~0 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0)) (or (< 0 (+ (* ~j~0 4) ~f~0.offset 1)) (<= ~i~0 ~j~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3119#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 721#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 727#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3139#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~i~0 ~n~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 737#(and (or (and (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= ~n~0 1)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~n~0 ~j~0) (+ ~i~0 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (< 0 (+ (* ~j~0 4) ~f~0.offset 1)) (<= ~i~0 ~j~0)) (<= ~n~0 1) (or (and (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= ~n~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3149#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~i~0 ~n~0) (<= 0 ~j~0) (<= ~n~0 1) (= ~j~0 ~i~0) (= (select (select |#memory_int| ~f~0.base) 0) ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 3161#(and (<= ~i~0 0) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 717#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 3155#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 0 ~i~0) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (< ~i~0 ~n~0) (= (select (select |#memory_int| ~f~0.base) (+ (* ~i~0 4) ~f~0.offset)) ~j~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 733#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~n~0 ~j~0) (+ ~i~0 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (< 0 (+ (* ~j~0 4) ~f~0.offset 1)) (<= ~i~0 ~j~0)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 2020#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (and (<= ~n~0 (+ (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 1)) (<= (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset)) 0)) (<= ~n~0 ~j~0) (< ~j~0 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 3151#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (<= ~n~0 1) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1906#(and (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~i~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 ~n~0) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (or (<= (+ ~j~0 1) 0) (<= ~n~0 ~j~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0)) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 745#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (= ~j~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 731#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (and (or (<= (+ ~n~0 ~j~0) (+ ~i~0 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0)) (or (< 0 (+ (* ~j~0 4) ~f~0.offset 1)) (<= ~i~0 ~j~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (or (and (or (<= (+ ~n~0 ~j~0) (+ ~i~0 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0)) (or (< 0 (+ (* ~j~0 4) ~f~0.offset 1)) (<= ~i~0 ~j~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 1966#(and (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0)), Black: 739#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), Black: 719#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 1262#(and (< ~j~0 1) (<= 0 ~i~0) (<= 0 ~j~0) (< ~i~0 1) (exists ((v_~j~0_34 Int)) (and (< v_~j~0_34 1) (<= 0 v_~j~0_34) (= (select (select |#memory_int| ~f~0.base) (+ (* v_~j~0_34 4) ~f~0.offset)) ~j~0))) (= ~f~0.offset 0)), Black: 1936#(and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (not (= ~f~0.base |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= ~f~0.base |ULTIMATE.start_main_~#t3~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t3~0#1.base|)) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t3~0#1.base|) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (= ~i~0 (select (select |#memory_int| ~f~0.base) (+ (* ~j~0 4) ~f~0.offset))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= 0 ~j~0) (< ~j~0 ~n~0) (not (= ~f~0.base |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t1~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_#res#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (not (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |ULTIMATE.start_main_~#t2~0#1.base|)) (<= ~n~0 1) (= ~j~0 ~i~0) (= (+ (* ~i2~0 4) ~f~0.offset) 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|) (= (+ (* ~i1~0 4) ~f~0.offset) 0)), Black: 735#(and (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (or (<= (+ ~n~0 ~j~0) (+ ~i~0 1)) (<= (+ (* ~j~0 4) ~f~0.offset) 0)) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (or (< 0 (+ (* ~j~0 4) ~f~0.offset 1)) (<= ~i~0 ~j~0)) (or (and (<= (+ (* ~j~0 4) ~f~0.offset) 0) (<= 0 ~j~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (<= ~n~0 1) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|))]) [2021-12-21 15:19:11,652 INFO L384 tUnfolder$Statistics]: this new event has 141 ancestors and is cut-off event [2021-12-21 15:19:11,652 INFO L387 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2021-12-21 15:19:11,652 INFO L387 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2021-12-21 15:19:11,652 INFO L387 tUnfolder$Statistics]: existing Event has 141 ancestors and is cut-off event [2021-12-21 15:19:12,376 INFO L129 PetriNetUnfolder]: 7288/20765 cut-off events. [2021-12-21 15:19:12,376 INFO L130 PetriNetUnfolder]: For 242209/243116 co-relation queries the response was YES. [2021-12-21 15:19:12,628 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107124 conditions, 20765 events. 7288/20765 cut-off events. For 242209/243116 co-relation queries the response was YES. Maximal size of possible extension queue 1333. Compared 255859 event pairs, 2365 based on Foata normal form. 119/20237 useless extension candidates. Maximal degree in co-relation 107042. Up to 10577 conditions per place. [2021-12-21 15:19:12,694 INFO L132 encePairwiseOnDemand]: 183/186 looper letters, 400 selfloop transitions, 2 changer transitions 27/720 dead transitions. [2021-12-21 15:19:12,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 720 transitions, 7229 flow [2021-12-21 15:19:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 15:19:12,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-21 15:19:12,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2021-12-21 15:19:12,696 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9032258064516129 [2021-12-21 15:19:12,696 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2021-12-21 15:19:12,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2021-12-21 15:19:12,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 15:19:12,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2021-12-21 15:19:12,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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-21 15:19:12,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 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-21 15:19:12,698 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 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-21 15:19:12,698 INFO L186 Difference]: Start difference. First operand has 359 places, 640 transitions, 5355 flow. Second operand 3 states and 504 transitions. [2021-12-21 15:19:12,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 720 transitions, 7229 flow