./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-figure1-alt.wvr.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-figure1-alt.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 fd523f7f98069bc15a8892c75be26f15a858863c31fc6ea863dcd5f92e46c458 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:52:48,560 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:52:48,563 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:52:48,597 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:52:48,597 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:52:48,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:52:48,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:52:48,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:52:48,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:52:48,610 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:52:48,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:52:48,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:52:48,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:52:48,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:52:48,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:52:48,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:52:48,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:52:48,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:52:48,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:52:48,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:52:48,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:52:48,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:52:48,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:52:48,630 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:52:48,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:52:48,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:52:48,637 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:52:48,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:52:48,638 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:52:48,639 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:52:48,639 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:52:48,640 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:52:48,641 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:52:48,642 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:52:48,643 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:52:48,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:52:48,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:52:48,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:52:48,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:52:48,646 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:52:48,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:52:48,647 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 20:52:48,685 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:52:48,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:52:48,686 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:52:48,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:52:48,687 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:52:48,687 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:52:48,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:52:48,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:52:48,688 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:52:48,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:52:48,689 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:52:48,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:52:48,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:52:48,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:52:48,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:52:48,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:52:48,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:52:48,690 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:52:48,690 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:52:48,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:52:48,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:52:48,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:52:48,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:52:48,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:52:48,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:52:48,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:52:48,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:52:48,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:52:48,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:52:48,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:52:48,693 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:52:48,693 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:52:48,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:52:48,694 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 -> fd523f7f98069bc15a8892c75be26f15a858863c31fc6ea863dcd5f92e46c458 [2022-02-20 20:52:48,932 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:52:48,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:52:48,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:52:48,962 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:52:48,962 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:52:48,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-figure1-alt.wvr.c [2022-02-20 20:52:49,032 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1cefef91/678debd866ed42b9b041640ef27714c3/FLAGf950b3634 [2022-02-20 20:52:49,477 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:52:49,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-figure1-alt.wvr.c [2022-02-20 20:52:49,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1cefef91/678debd866ed42b9b041640ef27714c3/FLAGf950b3634 [2022-02-20 20:52:49,506 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1cefef91/678debd866ed42b9b041640ef27714c3 [2022-02-20 20:52:49,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:52:49,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:52:49,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:52:49,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:52:49,517 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:52:49,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:52:49" (1/1) ... [2022-02-20 20:52:49,518 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d99d574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:52:49, skipping insertion in model container [2022-02-20 20:52:49,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:52:49" (1/1) ... [2022-02-20 20:52:49,524 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:52:49,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:52:49,736 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-figure1-alt.wvr.c[2087,2100] [2022-02-20 20:52:49,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:52:49,752 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:52:49,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-figure1-alt.wvr.c[2087,2100] [2022-02-20 20:52:49,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:52:49,800 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:52:49,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:52:49 WrapperNode [2022-02-20 20:52:49,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:52:49,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:52:49,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:52:49,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:52:49,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:52:49" (1/1) ... [2022-02-20 20:52:49,816 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:52:49" (1/1) ... [2022-02-20 20:52:49,845 INFO L137 Inliner]: procedures = 21, calls = 25, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 76 [2022-02-20 20:52:49,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:52:49,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:52:49,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:52:49,847 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:52:49,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:52:49" (1/1) ... [2022-02-20 20:52:49,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:52:49" (1/1) ... [2022-02-20 20:52:49,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:52:49" (1/1) ... [2022-02-20 20:52:49,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:52:49" (1/1) ... [2022-02-20 20:52:49,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:52:49" (1/1) ... [2022-02-20 20:52:49,880 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:52:49" (1/1) ... [2022-02-20 20:52:49,882 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:52:49" (1/1) ... [2022-02-20 20:52:49,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:52:49,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:52:49,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:52:49,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:52:49,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:52:49" (1/1) ... [2022-02-20 20:52:49,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:52:49,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:52:49,924 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 20:52:49,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 20:52:49,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:52:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-02-20 20:52:49,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-02-20 20:52:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-02-20 20:52:49,959 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-02-20 20:52:49,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:52:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:52:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:52:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 20:52:49,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 20:52:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:52:49,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:52:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 20:52:49,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:52:49,962 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-20 20:52:50,055 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:52:50,057 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:52:50,229 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:52:50,292 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:52:50,292 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 20:52:50,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:52:50 BoogieIcfgContainer [2022-02-20 20:52:50,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:52:50,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:52:50,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:52:50,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:52:50,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:52:49" (1/3) ... [2022-02-20 20:52:50,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676a6d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:52:50, skipping insertion in model container [2022-02-20 20:52:50,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:52:49" (2/3) ... [2022-02-20 20:52:50,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676a6d28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:52:50, skipping insertion in model container [2022-02-20 20:52:50,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:52:50" (3/3) ... [2022-02-20 20:52:50,300 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-figure1-alt.wvr.c [2022-02-20 20:52:50,304 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:52:50,304 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:52:50,305 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:52:50,305 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:52:50,365 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,366 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,366 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,370 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,372 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,373 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,375 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,376 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,376 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,376 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,377 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,377 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,377 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,377 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,377 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,378 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,378 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,378 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,378 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,379 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,381 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,382 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,383 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,385 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,386 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,387 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,388 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,389 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,389 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,389 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,389 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,390 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,393 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,394 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,394 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,394 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,394 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,394 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,394 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,396 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,396 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,396 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,396 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,396 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:52:50,407 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-02-20 20:52:50,453 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:52:50,461 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 [2022-02-20 20:52:50,461 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:52:50,477 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 89 transitions, 194 flow [2022-02-20 20:52:50,523 INFO L129 PetriNetUnfolder]: 6/87 cut-off events. [2022-02-20 20:52:50,526 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:52:50,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 87 events. 6/87 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 52. Up to 2 conditions per place. [2022-02-20 20:52:50,531 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 89 transitions, 194 flow [2022-02-20 20:52:50,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 79 places, 78 transitions, 168 flow [2022-02-20 20:52:50,563 INFO L129 PetriNetUnfolder]: 6/77 cut-off events. [2022-02-20 20:52:50,563 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:52:50,563 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:52:50,564 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] [2022-02-20 20:52:50,564 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:52:50,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:52:50,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1515800342, now seen corresponding path program 1 times [2022-02-20 20:52:50,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:52:50,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804793528] [2022-02-20 20:52:50,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:52:50,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:52:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:52:50,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {93#true} [204] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {93#true} [186] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {93#true} is VALID [2022-02-20 20:52:50,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {93#true} [209] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {93#true} [212] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {93#true} [180] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {93#true} [199] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {93#true} [197] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {93#true} [166] L21-3-->L21-4: Formula: (and (= (select |v_#length_2| 2) 25) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {93#true} [221] L21-4-->L38: Formula: (= 0 v_~N1~0_3) InVars {} OutVars{~N1~0=v_~N1~0_3} AuxVars[] AssignedVars[~N1~0] {93#true} is VALID [2022-02-20 20:52:50,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {93#true} [222] L38-->L38-1: Formula: (= 0 v_~N2~0_3) InVars {} OutVars{~N2~0=v_~N2~0_3} AuxVars[] AssignedVars[~N2~0] {93#true} is VALID [2022-02-20 20:52:50,842 INFO L290 TraceCheckUtils]: 10: Hoare triple {93#true} [167] L38-1-->L-1-3: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] {93#true} is VALID [2022-02-20 20:52:50,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {93#true} [215] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {93#true} [194] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {93#true} [161] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {93#true} is VALID [2022-02-20 20:52:50,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {93#true} [192] L-1-6-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {93#true} is VALID [2022-02-20 20:52:50,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {93#true} [216] L62-->L62-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {93#true} is VALID [2022-02-20 20:52:50,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {93#true} [202] L62-1-->L62-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {93#true} is VALID [2022-02-20 20:52:50,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {93#true} [179] L62-2-->L64: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {93#true} [168] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~N1~0_4) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~N1~0=v_~N1~0_4} AuxVars[] AssignedVars[~N1~0] {93#true} is VALID [2022-02-20 20:52:50,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {93#true} [210] L64-1-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {93#true} is VALID [2022-02-20 20:52:50,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {93#true} [228] L65-->L65-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet6#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {93#true} [206] L65-1-->L65-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_3| v_~N2~0_4) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|, ~N2~0=v_~N2~0_4} AuxVars[] AssignedVars[~N2~0] {93#true} is VALID [2022-02-20 20:52:50,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {93#true} [185] L65-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {93#true} is VALID [2022-02-20 20:52:50,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {93#true} [203] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {93#true} [173] L67-1-->L67-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~N1~0_5) (<= 0 v_~N2~0_5)) 1 0)) InVars {~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5} OutVars{~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {93#true} is VALID [2022-02-20 20:52:50,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {93#true} [160] L67-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {93#true} is VALID [2022-02-20 20:52:50,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {93#true} [176] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {93#true} is VALID [2022-02-20 20:52:50,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {93#true} [201] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {93#true} [195] L34-1-->L70: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {93#true} is VALID [2022-02-20 20:52:50,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {93#true} [225] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {93#true} is VALID [2022-02-20 20:52:50,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {93#true} [177] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {93#true} is VALID [2022-02-20 20:52:50,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {93#true} [175] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {93#true} is VALID [2022-02-20 20:52:50,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {93#true} [253] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] {93#true} is VALID [2022-02-20 20:52:50,851 INFO L290 TraceCheckUtils]: 33: Hoare triple {93#true} [162] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {93#true} is VALID [2022-02-20 20:52:50,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {93#true} [205] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {93#true} is VALID [2022-02-20 20:52:50,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {93#true} [149] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {93#true} is VALID [2022-02-20 20:52:50,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {93#true} [170] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {93#true} is VALID [2022-02-20 20:52:50,852 INFO L290 TraceCheckUtils]: 37: Hoare triple {93#true} [211] L71-2-->L71-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {93#true} is VALID [2022-02-20 20:52:50,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {93#true} [251] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_8|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] {93#true} is VALID [2022-02-20 20:52:50,853 INFO L290 TraceCheckUtils]: 39: Hoare triple {93#true} [240] thread2ENTRY-->L51-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] {93#true} is VALID [2022-02-20 20:52:50,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {93#true} [241] L51-4-->L51-5: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {94#false} is VALID [2022-02-20 20:52:50,854 INFO L290 TraceCheckUtils]: 41: Hoare triple {94#false} [244] L51-5-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] {94#false} is VALID [2022-02-20 20:52:50,854 INFO L290 TraceCheckUtils]: 42: Hoare triple {94#false} [246] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#false} is VALID [2022-02-20 20:52:50,854 INFO L290 TraceCheckUtils]: 43: Hoare triple {94#false} [159] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {94#false} is VALID [2022-02-20 20:52:50,855 INFO L290 TraceCheckUtils]: 44: Hoare triple {94#false} [190] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {94#false} is VALID [2022-02-20 20:52:50,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {94#false} [224] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {94#false} is VALID [2022-02-20 20:52:50,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {94#false} [230] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] {94#false} is VALID [2022-02-20 20:52:50,855 INFO L290 TraceCheckUtils]: 47: Hoare triple {94#false} [232] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N1~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_1} AuxVars[] AssignedVars[] {94#false} is VALID [2022-02-20 20:52:50,856 INFO L290 TraceCheckUtils]: 48: Hoare triple {94#false} [234] L41-5-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] {94#false} is VALID [2022-02-20 20:52:50,860 INFO L290 TraceCheckUtils]: 49: Hoare triple {94#false} [236] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#false} is VALID [2022-02-20 20:52:50,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {94#false} [254] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] {94#false} is VALID [2022-02-20 20:52:50,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {94#false} [153] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {94#false} is VALID [2022-02-20 20:52:50,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {94#false} [182] L73-->L73-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {94#false} is VALID [2022-02-20 20:52:50,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {94#false} [255] thread2EXIT-->L73-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} AuxVars[] AssignedVars[] {94#false} is VALID [2022-02-20 20:52:50,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {94#false} [183] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {94#false} is VALID [2022-02-20 20:52:50,862 INFO L290 TraceCheckUtils]: 55: Hoare triple {94#false} [213] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#false} is VALID [2022-02-20 20:52:50,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {94#false} [178] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (not (= v_~counter~0_7 (+ (* (- 1) v_~N2~0_6) v_~N1~0_6))) 1 0)) InVars {~counter~0=v_~counter~0_7, ~N1~0=v_~N1~0_6, ~N2~0=v_~N2~0_6} OutVars{~counter~0=v_~counter~0_7, ~N1~0=v_~N1~0_6, ~N2~0=v_~N2~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {94#false} is VALID [2022-02-20 20:52:50,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {94#false} [198] L75-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {94#false} is VALID [2022-02-20 20:52:50,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {94#false} [187] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {94#false} is VALID [2022-02-20 20:52:50,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {94#false} [155] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {94#false} is VALID [2022-02-20 20:52:50,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {94#false} [164] L34-3-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#false} is VALID [2022-02-20 20:52:50,864 INFO L290 TraceCheckUtils]: 61: Hoare triple {94#false} [226] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {94#false} is VALID [2022-02-20 20:52:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:52:50,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:52:50,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804793528] [2022-02-20 20:52:50,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804793528] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:52:50,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:52:50,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:52:50,868 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555773906] [2022-02-20 20:52:50,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:52:50,886 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 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) Word has length 62 [2022-02-20 20:52:50,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:52:50,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:50,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:52:50,958 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 20:52:50,958 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:52:50,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 20:52:50,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 20:52:50,985 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 89 [2022-02-20 20:52:50,990 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 168 flow. Second operand has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:50,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:52:50,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 89 [2022-02-20 20:52:50,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:52:51,046 INFO L129 PetriNetUnfolder]: 11/107 cut-off events. [2022-02-20 20:52:51,047 INFO L130 PetriNetUnfolder]: For 21/22 co-relation queries the response was YES. [2022-02-20 20:52:51,048 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 107 events. 11/107 cut-off events. For 21/22 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 146 event pairs, 3 based on Foata normal form. 11/109 useless extension candidates. Maximal degree in co-relation 67. Up to 19 conditions per place. [2022-02-20 20:52:51,049 INFO L132 encePairwiseOnDemand]: 85/89 looper letters, 6 selfloop transitions, 0 changer transitions 2/74 dead transitions. [2022-02-20 20:52:51,051 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 172 flow [2022-02-20 20:52:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 20:52:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-02-20 20:52:51,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 166 transitions. [2022-02-20 20:52:51,077 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9325842696629213 [2022-02-20 20:52:51,077 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 166 transitions. [2022-02-20 20:52:51,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 166 transitions. [2022-02-20 20:52:51,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:52:51,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 166 transitions. [2022-02-20 20:52:51,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 83.0) internal successors, (166), 2 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:51,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:51,091 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:51,093 INFO L186 Difference]: Start difference. First operand has 79 places, 78 transitions, 168 flow. Second operand 2 states and 166 transitions. [2022-02-20 20:52:51,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 172 flow [2022-02-20 20:52:51,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 74 transitions, 164 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-02-20 20:52:51,105 INFO L242 Difference]: Finished difference. Result has 76 places, 72 transitions, 148 flow [2022-02-20 20:52:51,108 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=148, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2022-02-20 20:52:51,111 INFO L334 CegarLoopForPetriNet]: 79 programPoint places, -3 predicate places. [2022-02-20 20:52:51,112 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 72 transitions, 148 flow [2022-02-20 20:52:51,146 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 447 states, 446 states have (on average 2.4551569506726456) internal successors, (1095), 446 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:51,149 INFO L78 Accepts]: Start accepts. Automaton has has 447 states, 446 states have (on average 2.4551569506726456) internal successors, (1095), 446 states have internal predecessors, (1095), 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) Word has length 62 [2022-02-20 20:52:51,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:52:51,149 INFO L470 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 148 flow [2022-02-20 20:52:51,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.5) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:51,149 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:52:51,150 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] [2022-02-20 20:52:51,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:52:51,150 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:52:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:52:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash -79113043, now seen corresponding path program 1 times [2022-02-20 20:52:51,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:52:51,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181512746] [2022-02-20 20:52:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:52:51,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:52:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:52:51,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#true} [204] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {544#true} is VALID [2022-02-20 20:52:51,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#true} [186] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {544#true} is VALID [2022-02-20 20:52:51,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {544#true} [209] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {544#true} is VALID [2022-02-20 20:52:51,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {544#true} [212] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {544#true} is VALID [2022-02-20 20:52:51,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {544#true} [180] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {544#true} is VALID [2022-02-20 20:52:51,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {544#true} [199] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {544#true} is VALID [2022-02-20 20:52:51,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {544#true} [197] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {544#true} is VALID [2022-02-20 20:52:51,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {544#true} [166] L21-3-->L21-4: Formula: (and (= (select |v_#length_2| 2) 25) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {544#true} is VALID [2022-02-20 20:52:51,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {544#true} [221] L21-4-->L38: Formula: (= 0 v_~N1~0_3) InVars {} OutVars{~N1~0=v_~N1~0_3} AuxVars[] AssignedVars[~N1~0] {544#true} is VALID [2022-02-20 20:52:51,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {544#true} [222] L38-->L38-1: Formula: (= 0 v_~N2~0_3) InVars {} OutVars{~N2~0=v_~N2~0_3} AuxVars[] AssignedVars[~N2~0] {544#true} is VALID [2022-02-20 20:52:51,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {544#true} [167] L38-1-->L-1-3: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] {546#(= ~counter~0 0)} is VALID [2022-02-20 20:52:51,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#(= ~counter~0 0)} [215] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {546#(= ~counter~0 0)} is VALID [2022-02-20 20:52:51,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {546#(= ~counter~0 0)} [194] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {546#(= ~counter~0 0)} is VALID [2022-02-20 20:52:51,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {546#(= ~counter~0 0)} [161] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {546#(= ~counter~0 0)} is VALID [2022-02-20 20:52:51,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {546#(= ~counter~0 0)} [192] L-1-6-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {546#(= ~counter~0 0)} is VALID [2022-02-20 20:52:51,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {546#(= ~counter~0 0)} [216] L62-->L62-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {546#(= ~counter~0 0)} is VALID [2022-02-20 20:52:51,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {546#(= ~counter~0 0)} [202] L62-1-->L62-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {546#(= ~counter~0 0)} is VALID [2022-02-20 20:52:51,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {546#(= ~counter~0 0)} [179] L62-2-->L64: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {546#(= ~counter~0 0)} is VALID [2022-02-20 20:52:51,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {546#(= ~counter~0 0)} [168] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~N1~0_4) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~N1~0=v_~N1~0_4} AuxVars[] AssignedVars[~N1~0] {546#(= ~counter~0 0)} is VALID [2022-02-20 20:52:51,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {546#(= ~counter~0 0)} [210] L64-1-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {546#(= ~counter~0 0)} is VALID [2022-02-20 20:52:51,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {546#(= ~counter~0 0)} [228] L65-->L65-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet6#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[] {546#(= ~counter~0 0)} is VALID [2022-02-20 20:52:51,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {546#(= ~counter~0 0)} [206] L65-1-->L65-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_3| v_~N2~0_4) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|, ~N2~0=v_~N2~0_4} AuxVars[] AssignedVars[~N2~0] {547#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:52:51,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {547#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [185] L65-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {547#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:52:51,926 INFO L290 TraceCheckUtils]: 23: Hoare triple {547#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [203] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {547#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:52:51,927 INFO L290 TraceCheckUtils]: 24: Hoare triple {547#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [173] L67-1-->L67-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~N1~0_5) (<= 0 v_~N2~0_5)) 1 0)) InVars {~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5} OutVars{~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {548#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {548#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [160] L67-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {548#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {548#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [176] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {549#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {549#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [201] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,931 INFO L290 TraceCheckUtils]: 28: Hoare triple {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [195] L34-1-->L70: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [225] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [177] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,934 INFO L290 TraceCheckUtils]: 31: Hoare triple {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [175] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,934 INFO L290 TraceCheckUtils]: 32: Hoare triple {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [253] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [162] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [205] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [149] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,938 INFO L290 TraceCheckUtils]: 36: Hoare triple {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [170] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [211] L71-2-->L71-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [251] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_8|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:52:51,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {550#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [240] thread2ENTRY-->L51-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] {551#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~N1~0)) (not (<= ~N1~0 ~N2~0)))))} is VALID [2022-02-20 20:52:51,941 INFO L290 TraceCheckUtils]: 40: Hoare triple {551#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~N1~0)) (not (<= ~N1~0 ~N2~0)))))} [242] L51-4-->L51-5: Formula: (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N2~0_1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_1} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_1} AuxVars[] AssignedVars[] {552#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (< ~N2~0 (+ ~N1~0 1))))} is VALID [2022-02-20 20:52:51,942 INFO L290 TraceCheckUtils]: 41: Hoare triple {552#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (< ~N2~0 (+ ~N1~0 1))))} [244] L51-5-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] {552#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (< ~N2~0 (+ ~N1~0 1))))} is VALID [2022-02-20 20:52:51,943 INFO L290 TraceCheckUtils]: 42: Hoare triple {552#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (< ~N2~0 (+ ~N1~0 1))))} [246] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {552#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (< ~N2~0 (+ ~N1~0 1))))} is VALID [2022-02-20 20:52:51,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {552#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (< ~N2~0 (+ ~N1~0 1))))} [230] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] {553#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (= thread1Thread1of1ForFork1_~i~0 0) (< ~N2~0 (+ ~N1~0 1))))} is VALID [2022-02-20 20:52:51,947 INFO L290 TraceCheckUtils]: 44: Hoare triple {553#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (= thread1Thread1of1ForFork1_~i~0 0) (< ~N2~0 (+ ~N1~0 1))))} [232] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N1~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_1} AuxVars[] AssignedVars[] {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:52:51,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} [234] L41-5-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:52:51,949 INFO L290 TraceCheckUtils]: 46: Hoare triple {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} [236] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:52:51,949 INFO L290 TraceCheckUtils]: 47: Hoare triple {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} [159] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:52:51,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} [190] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:52:51,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} [224] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:52:51,952 INFO L290 TraceCheckUtils]: 50: Hoare triple {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} [254] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:52:51,953 INFO L290 TraceCheckUtils]: 51: Hoare triple {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} [153] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:52:51,955 INFO L290 TraceCheckUtils]: 52: Hoare triple {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} [182] L73-->L73-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:52:51,956 INFO L290 TraceCheckUtils]: 53: Hoare triple {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} [255] thread2EXIT-->L73-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} AuxVars[] AssignedVars[] {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:52:51,969 INFO L290 TraceCheckUtils]: 54: Hoare triple {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} [183] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:52:51,970 INFO L290 TraceCheckUtils]: 55: Hoare triple {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} [213] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:52:51,970 INFO L290 TraceCheckUtils]: 56: Hoare triple {554#(= ~N1~0 (+ ~counter~0 ~N2~0))} [178] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (not (= v_~counter~0_7 (+ (* (- 1) v_~N2~0_6) v_~N1~0_6))) 1 0)) InVars {~counter~0=v_~counter~0_7, ~N1~0=v_~N1~0_6, ~N2~0=v_~N2~0_6} OutVars{~counter~0=v_~counter~0_7, ~N1~0=v_~N1~0_6, ~N2~0=v_~N2~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {555#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:52:51,971 INFO L290 TraceCheckUtils]: 57: Hoare triple {555#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [198] L75-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {555#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:52:51,971 INFO L290 TraceCheckUtils]: 58: Hoare triple {555#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [187] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {556#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:52:51,975 INFO L290 TraceCheckUtils]: 59: Hoare triple {556#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [155] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {545#false} is VALID [2022-02-20 20:52:51,975 INFO L290 TraceCheckUtils]: 60: Hoare triple {545#false} [164] L34-3-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {545#false} is VALID [2022-02-20 20:52:51,975 INFO L290 TraceCheckUtils]: 61: Hoare triple {545#false} [226] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {545#false} is VALID [2022-02-20 20:52:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:52:51,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:52:51,976 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181512746] [2022-02-20 20:52:51,976 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181512746] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:52:51,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:52:51,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 20:52:51,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004401889] [2022-02-20 20:52:51,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:52:51,978 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 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) Word has length 62 [2022-02-20 20:52:51,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:52:51,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:52,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:52:52,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 20:52:52,039 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:52:52,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 20:52:52,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-20 20:52:52,043 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 89 [2022-02-20 20:52:52,044 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 148 flow. Second operand has 13 states, 13 states have (on average 54.61538461538461) internal successors, (710), 13 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:52,044 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:52:52,044 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 89 [2022-02-20 20:52:52,044 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:52:52,859 INFO L129 PetriNetUnfolder]: 67/249 cut-off events. [2022-02-20 20:52:52,859 INFO L130 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2022-02-20 20:52:52,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 249 events. 67/249 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 975 event pairs, 37 based on Foata normal form. 6/224 useless extension candidates. Maximal degree in co-relation 418. Up to 102 conditions per place. [2022-02-20 20:52:52,862 INFO L132 encePairwiseOnDemand]: 76/89 looper letters, 43 selfloop transitions, 11 changer transitions 6/103 dead transitions. [2022-02-20 20:52:52,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 103 transitions, 337 flow [2022-02-20 20:52:52,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:52:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-02-20 20:52:52,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 698 transitions. [2022-02-20 20:52:52,874 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.653558052434457 [2022-02-20 20:52:52,874 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 698 transitions. [2022-02-20 20:52:52,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 698 transitions. [2022-02-20 20:52:52,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:52:52,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 698 transitions. [2022-02-20 20:52:52,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 58.166666666666664) internal successors, (698), 12 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:52,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:52,880 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:52,880 INFO L186 Difference]: Start difference. First operand has 76 places, 72 transitions, 148 flow. Second operand 12 states and 698 transitions. [2022-02-20 20:52:52,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 103 transitions, 337 flow [2022-02-20 20:52:52,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 103 transitions, 337 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:52:52,884 INFO L242 Difference]: Finished difference. Result has 92 places, 79 transitions, 213 flow [2022-02-20 20:52:52,884 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=213, PETRI_PLACES=92, PETRI_TRANSITIONS=79} [2022-02-20 20:52:52,885 INFO L334 CegarLoopForPetriNet]: 79 programPoint places, 13 predicate places. [2022-02-20 20:52:52,885 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 79 transitions, 213 flow [2022-02-20 20:52:52,924 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 636 states, 633 states have (on average 2.4139020537124805) internal successors, (1528), 635 states have internal predecessors, (1528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:52,926 INFO L78 Accepts]: Start accepts. Automaton has has 636 states, 633 states have (on average 2.4139020537124805) internal successors, (1528), 635 states have internal predecessors, (1528), 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) Word has length 62 [2022-02-20 20:52:52,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:52:52,927 INFO L470 AbstractCegarLoop]: Abstraction has has 92 places, 79 transitions, 213 flow [2022-02-20 20:52:52,927 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 54.61538461538461) internal successors, (710), 13 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:52,928 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:52:52,928 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] [2022-02-20 20:52:52,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:52:52,928 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:52:52,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:52:52,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1768634669, now seen corresponding path program 2 times [2022-02-20 20:52:52,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:52:52,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059866777] [2022-02-20 20:52:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:52:52,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:52:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:52:53,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {1220#true} [204] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-02-20 20:52:53,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {1220#true} [186] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1220#true} is VALID [2022-02-20 20:52:53,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {1220#true} [209] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-02-20 20:52:53,424 INFO L290 TraceCheckUtils]: 3: Hoare triple {1220#true} [212] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-02-20 20:52:53,424 INFO L290 TraceCheckUtils]: 4: Hoare triple {1220#true} [180] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-02-20 20:52:53,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {1220#true} [199] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-02-20 20:52:53,425 INFO L290 TraceCheckUtils]: 6: Hoare triple {1220#true} [197] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-02-20 20:52:53,425 INFO L290 TraceCheckUtils]: 7: Hoare triple {1220#true} [166] L21-3-->L21-4: Formula: (and (= (select |v_#length_2| 2) 25) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {1220#true} is VALID [2022-02-20 20:52:53,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {1220#true} [221] L21-4-->L38: Formula: (= 0 v_~N1~0_3) InVars {} OutVars{~N1~0=v_~N1~0_3} AuxVars[] AssignedVars[~N1~0] {1220#true} is VALID [2022-02-20 20:52:53,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {1220#true} [222] L38-->L38-1: Formula: (= 0 v_~N2~0_3) InVars {} OutVars{~N2~0=v_~N2~0_3} AuxVars[] AssignedVars[~N2~0] {1220#true} is VALID [2022-02-20 20:52:53,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {1220#true} [167] L38-1-->L-1-3: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] {1222#(= ~counter~0 0)} is VALID [2022-02-20 20:52:53,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {1222#(= ~counter~0 0)} [215] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1222#(= ~counter~0 0)} is VALID [2022-02-20 20:52:53,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {1222#(= ~counter~0 0)} [194] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1222#(= ~counter~0 0)} is VALID [2022-02-20 20:52:53,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {1222#(= ~counter~0 0)} [161] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {1222#(= ~counter~0 0)} is VALID [2022-02-20 20:52:53,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {1222#(= ~counter~0 0)} [192] L-1-6-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {1222#(= ~counter~0 0)} is VALID [2022-02-20 20:52:53,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {1222#(= ~counter~0 0)} [216] L62-->L62-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {1222#(= ~counter~0 0)} is VALID [2022-02-20 20:52:53,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {1222#(= ~counter~0 0)} [202] L62-1-->L62-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {1222#(= ~counter~0 0)} is VALID [2022-02-20 20:52:53,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {1222#(= ~counter~0 0)} [179] L62-2-->L64: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {1222#(= ~counter~0 0)} is VALID [2022-02-20 20:52:53,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {1222#(= ~counter~0 0)} [168] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~N1~0_4) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~N1~0=v_~N1~0_4} AuxVars[] AssignedVars[~N1~0] {1222#(= ~counter~0 0)} is VALID [2022-02-20 20:52:53,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {1222#(= ~counter~0 0)} [210] L64-1-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {1222#(= ~counter~0 0)} is VALID [2022-02-20 20:52:53,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {1222#(= ~counter~0 0)} [228] L65-->L65-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet6#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[] {1222#(= ~counter~0 0)} is VALID [2022-02-20 20:52:53,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {1222#(= ~counter~0 0)} [206] L65-1-->L65-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_3| v_~N2~0_4) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|, ~N2~0=v_~N2~0_4} AuxVars[] AssignedVars[~N2~0] {1223#(or (= ~N1~0 (+ ~counter~0 ~N2~0)) (not (= ~N2~0 ~N1~0)))} is VALID [2022-02-20 20:52:53,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {1223#(or (= ~N1~0 (+ ~counter~0 ~N2~0)) (not (= ~N2~0 ~N1~0)))} [185] L65-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {1223#(or (= ~N1~0 (+ ~counter~0 ~N2~0)) (not (= ~N2~0 ~N1~0)))} is VALID [2022-02-20 20:52:53,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {1223#(or (= ~N1~0 (+ ~counter~0 ~N2~0)) (not (= ~N2~0 ~N1~0)))} [203] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1223#(or (= ~N1~0 (+ ~counter~0 ~N2~0)) (not (= ~N2~0 ~N1~0)))} is VALID [2022-02-20 20:52:53,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {1223#(or (= ~N1~0 (+ ~counter~0 ~N2~0)) (not (= ~N2~0 ~N1~0)))} [173] L67-1-->L67-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~N1~0_5) (<= 0 v_~N2~0_5)) 1 0)) InVars {~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5} OutVars{~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {1224#(or (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0))))} is VALID [2022-02-20 20:52:53,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {1224#(or (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0))))} [160] L67-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1224#(or (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0))))} is VALID [2022-02-20 20:52:53,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {1224#(or (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0))))} [176] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1225#(or (and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 20:52:53,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {1225#(or (and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} [201] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} is VALID [2022-02-20 20:52:53,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} [195] L34-1-->L70: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} is VALID [2022-02-20 20:52:53,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} [225] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} is VALID [2022-02-20 20:52:53,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} [177] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} is VALID [2022-02-20 20:52:53,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} [175] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} is VALID [2022-02-20 20:52:53,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} [253] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} is VALID [2022-02-20 20:52:53,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} [162] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} is VALID [2022-02-20 20:52:53,442 INFO L290 TraceCheckUtils]: 34: Hoare triple {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} [205] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} is VALID [2022-02-20 20:52:53,443 INFO L290 TraceCheckUtils]: 35: Hoare triple {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} [149] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} is VALID [2022-02-20 20:52:53,444 INFO L290 TraceCheckUtils]: 36: Hoare triple {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} [170] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} is VALID [2022-02-20 20:52:53,445 INFO L290 TraceCheckUtils]: 37: Hoare triple {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} [211] L71-2-->L71-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} is VALID [2022-02-20 20:52:53,445 INFO L290 TraceCheckUtils]: 38: Hoare triple {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} [251] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_8|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} is VALID [2022-02-20 20:52:53,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {1226#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (<= 0 ~N2~0) (<= ~N1~0 ~N2~0)))} [230] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] {1227#(and (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~N1~0 ~N2~0)) (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))))} is VALID [2022-02-20 20:52:53,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {1227#(and (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~N1~0 ~N2~0)) (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))))} [232] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N1~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_1} AuxVars[] AssignedVars[] {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} [234] L41-5-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} [236] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,450 INFO L290 TraceCheckUtils]: 43: Hoare triple {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} [159] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} [190] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,451 INFO L290 TraceCheckUtils]: 45: Hoare triple {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} [224] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} [254] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,453 INFO L290 TraceCheckUtils]: 47: Hoare triple {1228#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} [240] thread2ENTRY-->L51-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] {1229#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,454 INFO L290 TraceCheckUtils]: 48: Hoare triple {1229#(and (or (<= 0 ~N1~0) (< ~N2~0 (+ ~N1~0 1))) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (<= ~N1~0 ~N2~0))} [242] L51-4-->L51-5: Formula: (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N2~0_1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_1} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_1} AuxVars[] AssignedVars[] {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,455 INFO L290 TraceCheckUtils]: 49: Hoare triple {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} [244] L51-5-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,455 INFO L290 TraceCheckUtils]: 50: Hoare triple {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} [246] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,456 INFO L290 TraceCheckUtils]: 51: Hoare triple {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} [153] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,456 INFO L290 TraceCheckUtils]: 52: Hoare triple {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} [182] L73-->L73-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,457 INFO L290 TraceCheckUtils]: 53: Hoare triple {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} [255] thread2EXIT-->L73-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} AuxVars[] AssignedVars[] {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,458 INFO L290 TraceCheckUtils]: 54: Hoare triple {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} [183] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,458 INFO L290 TraceCheckUtils]: 55: Hoare triple {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} [213] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} is VALID [2022-02-20 20:52:53,459 INFO L290 TraceCheckUtils]: 56: Hoare triple {1230#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (< ~N2~0 (+ ~N1~0 1)) (<= ~N1~0 ~N2~0))} [178] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (not (= v_~counter~0_7 (+ (* (- 1) v_~N2~0_6) v_~N1~0_6))) 1 0)) InVars {~counter~0=v_~counter~0_7, ~N1~0=v_~N1~0_6, ~N2~0=v_~N2~0_6} OutVars{~counter~0=v_~counter~0_7, ~N1~0=v_~N1~0_6, ~N2~0=v_~N2~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {1231#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:52:53,459 INFO L290 TraceCheckUtils]: 57: Hoare triple {1231#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [198] L75-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1231#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:52:53,460 INFO L290 TraceCheckUtils]: 58: Hoare triple {1231#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [187] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1232#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:52:53,460 INFO L290 TraceCheckUtils]: 59: Hoare triple {1232#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [155] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-02-20 20:52:53,461 INFO L290 TraceCheckUtils]: 60: Hoare triple {1221#false} [164] L34-3-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-02-20 20:52:53,461 INFO L290 TraceCheckUtils]: 61: Hoare triple {1221#false} [226] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1221#false} is VALID [2022-02-20 20:52:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:52:53,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:52:53,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059866777] [2022-02-20 20:52:53,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059866777] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:52:53,462 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:52:53,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 20:52:53,463 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285887422] [2022-02-20 20:52:53,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:52:53,463 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 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) Word has length 62 [2022-02-20 20:52:53,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:52:53,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:53,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:52:53,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 20:52:53,524 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:52:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 20:52:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-20 20:52:53,527 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 89 [2022-02-20 20:52:53,528 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 79 transitions, 213 flow. Second operand has 13 states, 13 states have (on average 54.61538461538461) internal successors, (710), 13 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:53,528 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:52:53,528 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 89 [2022-02-20 20:52:53,528 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:52:54,210 INFO L129 PetriNetUnfolder]: 68/261 cut-off events. [2022-02-20 20:52:54,211 INFO L130 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-02-20 20:52:54,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 261 events. 68/261 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1104 event pairs, 32 based on Foata normal form. 1/259 useless extension candidates. Maximal degree in co-relation 528. Up to 102 conditions per place. [2022-02-20 20:52:54,213 INFO L132 encePairwiseOnDemand]: 77/89 looper letters, 40 selfloop transitions, 11 changer transitions 11/105 dead transitions. [2022-02-20 20:52:54,213 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 105 transitions, 429 flow [2022-02-20 20:52:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:52:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-02-20 20:52:54,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 695 transitions. [2022-02-20 20:52:54,222 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.650749063670412 [2022-02-20 20:52:54,223 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 695 transitions. [2022-02-20 20:52:54,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 695 transitions. [2022-02-20 20:52:54,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:52:54,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 695 transitions. [2022-02-20 20:52:54,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 57.916666666666664) internal successors, (695), 12 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:54,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:54,228 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:52:54,228 INFO L186 Difference]: Start difference. First operand has 92 places, 79 transitions, 213 flow. Second operand 12 states and 695 transitions. [2022-02-20 20:52:54,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 105 transitions, 429 flow [2022-02-20 20:53:01,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 105 transitions, 407 flow, removed 8 selfloop flow, removed 6 redundant places. [2022-02-20 20:53:01,942 INFO L242 Difference]: Finished difference. Result has 100 places, 80 transitions, 247 flow [2022-02-20 20:53:01,943 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=247, PETRI_PLACES=100, PETRI_TRANSITIONS=80} [2022-02-20 20:53:01,943 INFO L334 CegarLoopForPetriNet]: 79 programPoint places, 21 predicate places. [2022-02-20 20:53:01,944 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 100 places, 80 transitions, 247 flow [2022-02-20 20:53:01,965 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 636 states, 632 states have (on average 2.393987341772152) internal successors, (1513), 635 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:01,967 INFO L78 Accepts]: Start accepts. Automaton has has 636 states, 632 states have (on average 2.393987341772152) internal successors, (1513), 635 states have internal predecessors, (1513), 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) Word has length 62 [2022-02-20 20:53:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:53:01,967 INFO L470 AbstractCegarLoop]: Abstraction has has 100 places, 80 transitions, 247 flow [2022-02-20 20:53:01,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 54.61538461538461) internal successors, (710), 13 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:01,968 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:53:01,968 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] [2022-02-20 20:53:01,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:53:01,968 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:53:01,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:53:01,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1001813793, now seen corresponding path program 3 times [2022-02-20 20:53:01,969 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:53:01,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482524764] [2022-02-20 20:53:01,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:53:01,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:53:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:53:02,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {1895#true} [204] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1895#true} is VALID [2022-02-20 20:53:02,322 INFO L290 TraceCheckUtils]: 1: Hoare triple {1895#true} [186] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1895#true} is VALID [2022-02-20 20:53:02,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {1895#true} [209] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {1895#true} is VALID [2022-02-20 20:53:02,323 INFO L290 TraceCheckUtils]: 3: Hoare triple {1895#true} [212] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {1895#true} is VALID [2022-02-20 20:53:02,323 INFO L290 TraceCheckUtils]: 4: Hoare triple {1895#true} [180] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {1895#true} is VALID [2022-02-20 20:53:02,323 INFO L290 TraceCheckUtils]: 5: Hoare triple {1895#true} [199] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {1895#true} is VALID [2022-02-20 20:53:02,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {1895#true} [197] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {1895#true} is VALID [2022-02-20 20:53:02,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {1895#true} [166] L21-3-->L21-4: Formula: (and (= (select |v_#length_2| 2) 25) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {1895#true} is VALID [2022-02-20 20:53:02,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {1895#true} [221] L21-4-->L38: Formula: (= 0 v_~N1~0_3) InVars {} OutVars{~N1~0=v_~N1~0_3} AuxVars[] AssignedVars[~N1~0] {1895#true} is VALID [2022-02-20 20:53:02,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {1895#true} [222] L38-->L38-1: Formula: (= 0 v_~N2~0_3) InVars {} OutVars{~N2~0=v_~N2~0_3} AuxVars[] AssignedVars[~N2~0] {1895#true} is VALID [2022-02-20 20:53:02,325 INFO L290 TraceCheckUtils]: 10: Hoare triple {1895#true} [167] L38-1-->L-1-3: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] {1897#(= ~counter~0 0)} is VALID [2022-02-20 20:53:02,325 INFO L290 TraceCheckUtils]: 11: Hoare triple {1897#(= ~counter~0 0)} [215] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#(= ~counter~0 0)} is VALID [2022-02-20 20:53:02,325 INFO L290 TraceCheckUtils]: 12: Hoare triple {1897#(= ~counter~0 0)} [194] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1897#(= ~counter~0 0)} is VALID [2022-02-20 20:53:02,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {1897#(= ~counter~0 0)} [161] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {1897#(= ~counter~0 0)} is VALID [2022-02-20 20:53:02,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {1897#(= ~counter~0 0)} [192] L-1-6-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {1897#(= ~counter~0 0)} is VALID [2022-02-20 20:53:02,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {1897#(= ~counter~0 0)} [216] L62-->L62-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {1897#(= ~counter~0 0)} is VALID [2022-02-20 20:53:02,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {1897#(= ~counter~0 0)} [202] L62-1-->L62-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {1897#(= ~counter~0 0)} is VALID [2022-02-20 20:53:02,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {1897#(= ~counter~0 0)} [179] L62-2-->L64: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {1897#(= ~counter~0 0)} is VALID [2022-02-20 20:53:02,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {1897#(= ~counter~0 0)} [168] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~N1~0_4) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~N1~0=v_~N1~0_4} AuxVars[] AssignedVars[~N1~0] {1897#(= ~counter~0 0)} is VALID [2022-02-20 20:53:02,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {1897#(= ~counter~0 0)} [210] L64-1-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {1897#(= ~counter~0 0)} is VALID [2022-02-20 20:53:02,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {1897#(= ~counter~0 0)} [228] L65-->L65-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet6#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[] {1897#(= ~counter~0 0)} is VALID [2022-02-20 20:53:02,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {1897#(= ~counter~0 0)} [206] L65-1-->L65-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_3| v_~N2~0_4) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|, ~N2~0=v_~N2~0_4} AuxVars[] AssignedVars[~N2~0] {1898#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:02,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {1898#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [185] L65-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {1898#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:02,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {1898#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [203] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1898#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:02,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {1898#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [173] L67-1-->L67-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~N1~0_5) (<= 0 v_~N2~0_5)) 1 0)) InVars {~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5} OutVars{~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {1899#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {1899#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [160] L67-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1899#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {1899#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [176] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1900#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {1900#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [201] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [195] L34-1-->L70: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [225] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [177] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [175] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [253] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [162] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [205] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [149] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [170] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [211] L71-2-->L71-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [251] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_8|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [159] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,344 INFO L290 TraceCheckUtils]: 40: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [190] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,345 INFO L290 TraceCheckUtils]: 41: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [224] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} is VALID [2022-02-20 20:53:02,346 INFO L290 TraceCheckUtils]: 42: Hoare triple {1901#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (<= 0 ~N1~0) (not (= ~N2~0 ~N1~0))))} [240] thread2ENTRY-->L51-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] {1902#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~N1~0)) (not (<= ~N1~0 ~N2~0)))))} is VALID [2022-02-20 20:53:02,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {1902#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~N1~0)) (not (<= ~N1~0 ~N2~0)))))} [230] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] {1903#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~N1~0 ~N2~0)) (not (= ~N2~0 ~N1~0)) (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~N1~0)) (not (<= ~N1~0 ~N2~0)))))} is VALID [2022-02-20 20:53:02,347 INFO L290 TraceCheckUtils]: 44: Hoare triple {1903#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~N1~0 ~N2~0)) (not (= ~N2~0 ~N1~0)) (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~N1~0)) (not (<= ~N1~0 ~N2~0)))))} [242] L51-4-->L51-5: Formula: (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N2~0_1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_1} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_1} AuxVars[] AssignedVars[] {1904#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (= thread1Thread1of1ForFork1_~i~0 0) (< ~N2~0 (+ ~N1~0 1))))} is VALID [2022-02-20 20:53:02,348 INFO L290 TraceCheckUtils]: 45: Hoare triple {1904#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (and (<= 0 ~N2~0) (not (= ~N2~0 ~N1~0)) (= thread1Thread1of1ForFork1_~i~0 0) (< ~N2~0 (+ ~N1~0 1))))} [232] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N1~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_1} AuxVars[] AssignedVars[] {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:53:02,348 INFO L290 TraceCheckUtils]: 46: Hoare triple {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} [234] L41-5-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:53:02,349 INFO L290 TraceCheckUtils]: 47: Hoare triple {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} [236] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:53:02,349 INFO L290 TraceCheckUtils]: 48: Hoare triple {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} [254] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:53:02,349 INFO L290 TraceCheckUtils]: 49: Hoare triple {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} [153] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:53:02,350 INFO L290 TraceCheckUtils]: 50: Hoare triple {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} [182] L73-->L73-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:53:02,350 INFO L290 TraceCheckUtils]: 51: Hoare triple {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} [244] L51-5-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:53:02,351 INFO L290 TraceCheckUtils]: 52: Hoare triple {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} [246] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:53:02,356 INFO L290 TraceCheckUtils]: 53: Hoare triple {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} [255] thread2EXIT-->L73-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} AuxVars[] AssignedVars[] {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:53:02,357 INFO L290 TraceCheckUtils]: 54: Hoare triple {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} [183] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:53:02,357 INFO L290 TraceCheckUtils]: 55: Hoare triple {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} [213] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} is VALID [2022-02-20 20:53:02,358 INFO L290 TraceCheckUtils]: 56: Hoare triple {1905#(= ~N1~0 (+ ~counter~0 ~N2~0))} [178] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (not (= v_~counter~0_7 (+ (* (- 1) v_~N2~0_6) v_~N1~0_6))) 1 0)) InVars {~counter~0=v_~counter~0_7, ~N1~0=v_~N1~0_6, ~N2~0=v_~N2~0_6} OutVars{~counter~0=v_~counter~0_7, ~N1~0=v_~N1~0_6, ~N2~0=v_~N2~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {1906#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:53:02,362 INFO L290 TraceCheckUtils]: 57: Hoare triple {1906#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [198] L75-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1906#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:53:02,363 INFO L290 TraceCheckUtils]: 58: Hoare triple {1906#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [187] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {1907#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:53:02,364 INFO L290 TraceCheckUtils]: 59: Hoare triple {1907#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [155] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {1896#false} is VALID [2022-02-20 20:53:02,364 INFO L290 TraceCheckUtils]: 60: Hoare triple {1896#false} [164] L34-3-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1896#false} is VALID [2022-02-20 20:53:02,364 INFO L290 TraceCheckUtils]: 61: Hoare triple {1896#false} [226] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1896#false} is VALID [2022-02-20 20:53:02,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:53:02,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:53:02,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482524764] [2022-02-20 20:53:02,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482524764] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:53:02,367 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:53:02,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 20:53:02,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849462001] [2022-02-20 20:53:02,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:53:02,368 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 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) Word has length 62 [2022-02-20 20:53:02,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:53:02,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:02,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:53:02,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 20:53:02,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:53:02,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 20:53:02,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-20 20:53:02,416 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 89 [2022-02-20 20:53:02,418 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 80 transitions, 247 flow. Second operand has 13 states, 13 states have (on average 54.61538461538461) internal successors, (710), 13 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:02,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:53:02,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 89 [2022-02-20 20:53:02,418 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:53:03,063 INFO L129 PetriNetUnfolder]: 72/296 cut-off events. [2022-02-20 20:53:03,063 INFO L130 PetriNetUnfolder]: For 174/174 co-relation queries the response was YES. [2022-02-20 20:53:03,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 296 events. 72/296 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1332 event pairs, 37 based on Foata normal form. 1/292 useless extension candidates. Maximal degree in co-relation 652. Up to 105 conditions per place. [2022-02-20 20:53:03,066 INFO L132 encePairwiseOnDemand]: 77/89 looper letters, 48 selfloop transitions, 14 changer transitions 8/113 dead transitions. [2022-02-20 20:53:03,066 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 113 transitions, 519 flow [2022-02-20 20:53:03,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:53:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-02-20 20:53:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 704 transitions. [2022-02-20 20:53:03,076 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6591760299625468 [2022-02-20 20:53:03,076 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 704 transitions. [2022-02-20 20:53:03,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 704 transitions. [2022-02-20 20:53:03,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:53:03,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 704 transitions. [2022-02-20 20:53:03,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 58.666666666666664) internal successors, (704), 12 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:03,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:03,081 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:03,081 INFO L186 Difference]: Start difference. First operand has 100 places, 80 transitions, 247 flow. Second operand 12 states and 704 transitions. [2022-02-20 20:53:03,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 113 transitions, 519 flow [2022-02-20 20:53:25,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 113 transitions, 474 flow, removed 14 selfloop flow, removed 9 redundant places. [2022-02-20 20:53:25,949 INFO L242 Difference]: Finished difference. Result has 104 places, 84 transitions, 301 flow [2022-02-20 20:53:25,949 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=301, PETRI_PLACES=104, PETRI_TRANSITIONS=84} [2022-02-20 20:53:25,950 INFO L334 CegarLoopForPetriNet]: 79 programPoint places, 25 predicate places. [2022-02-20 20:53:25,950 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 84 transitions, 301 flow [2022-02-20 20:53:25,977 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 760 states, 754 states have (on average 2.376657824933687) internal successors, (1792), 759 states have internal predecessors, (1792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:25,979 INFO L78 Accepts]: Start accepts. Automaton has has 760 states, 754 states have (on average 2.376657824933687) internal successors, (1792), 759 states have internal predecessors, (1792), 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) Word has length 62 [2022-02-20 20:53:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:53:25,979 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 84 transitions, 301 flow [2022-02-20 20:53:25,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 54.61538461538461) internal successors, (710), 13 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:25,980 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:53:25,980 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] [2022-02-20 20:53:25,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:53:25,981 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:53:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:53:25,982 INFO L85 PathProgramCache]: Analyzing trace with hash -92412107, now seen corresponding path program 4 times [2022-02-20 20:53:25,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:53:25,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706089715] [2022-02-20 20:53:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:53:25,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:53:26,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:53:26,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {2694#true} [204] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2694#true} is VALID [2022-02-20 20:53:26,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {2694#true} [186] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2694#true} is VALID [2022-02-20 20:53:26,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {2694#true} [209] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {2694#true} is VALID [2022-02-20 20:53:26,373 INFO L290 TraceCheckUtils]: 3: Hoare triple {2694#true} [212] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {2694#true} is VALID [2022-02-20 20:53:26,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {2694#true} [180] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {2694#true} is VALID [2022-02-20 20:53:26,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {2694#true} [199] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {2694#true} is VALID [2022-02-20 20:53:26,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {2694#true} [197] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {2694#true} is VALID [2022-02-20 20:53:26,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {2694#true} [166] L21-3-->L21-4: Formula: (and (= (select |v_#length_2| 2) 25) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {2694#true} is VALID [2022-02-20 20:53:26,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {2694#true} [221] L21-4-->L38: Formula: (= 0 v_~N1~0_3) InVars {} OutVars{~N1~0=v_~N1~0_3} AuxVars[] AssignedVars[~N1~0] {2694#true} is VALID [2022-02-20 20:53:26,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {2694#true} [222] L38-->L38-1: Formula: (= 0 v_~N2~0_3) InVars {} OutVars{~N2~0=v_~N2~0_3} AuxVars[] AssignedVars[~N2~0] {2694#true} is VALID [2022-02-20 20:53:26,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {2694#true} [167] L38-1-->L-1-3: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] {2696#(= ~counter~0 0)} is VALID [2022-02-20 20:53:26,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {2696#(= ~counter~0 0)} [215] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2696#(= ~counter~0 0)} is VALID [2022-02-20 20:53:26,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {2696#(= ~counter~0 0)} [194] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2696#(= ~counter~0 0)} is VALID [2022-02-20 20:53:26,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {2696#(= ~counter~0 0)} [161] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {2696#(= ~counter~0 0)} is VALID [2022-02-20 20:53:26,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {2696#(= ~counter~0 0)} [192] L-1-6-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {2696#(= ~counter~0 0)} is VALID [2022-02-20 20:53:26,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {2696#(= ~counter~0 0)} [216] L62-->L62-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {2696#(= ~counter~0 0)} is VALID [2022-02-20 20:53:26,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {2696#(= ~counter~0 0)} [202] L62-1-->L62-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {2696#(= ~counter~0 0)} is VALID [2022-02-20 20:53:26,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {2696#(= ~counter~0 0)} [179] L62-2-->L64: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {2696#(= ~counter~0 0)} is VALID [2022-02-20 20:53:26,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {2696#(= ~counter~0 0)} [168] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~N1~0_4) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~N1~0=v_~N1~0_4} AuxVars[] AssignedVars[~N1~0] {2696#(= ~counter~0 0)} is VALID [2022-02-20 20:53:26,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {2696#(= ~counter~0 0)} [210] L64-1-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {2696#(= ~counter~0 0)} is VALID [2022-02-20 20:53:26,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {2696#(= ~counter~0 0)} [228] L65-->L65-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet6#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[] {2696#(= ~counter~0 0)} is VALID [2022-02-20 20:53:26,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {2696#(= ~counter~0 0)} [206] L65-1-->L65-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_3| v_~N2~0_4) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|, ~N2~0=v_~N2~0_4} AuxVars[] AssignedVars[~N2~0] {2697#(or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0)))} is VALID [2022-02-20 20:53:26,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {2697#(or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0)))} [185] L65-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {2697#(or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0)))} is VALID [2022-02-20 20:53:26,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {2697#(or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0)))} [203] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2697#(or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0)))} is VALID [2022-02-20 20:53:26,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {2697#(or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0)))} [173] L67-1-->L67-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~N1~0_5) (<= 0 v_~N2~0_5)) 1 0)) InVars {~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5} OutVars{~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {2698#(or (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))))} is VALID [2022-02-20 20:53:26,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {2698#(or (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))))} [160] L67-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {2698#(or (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))))} is VALID [2022-02-20 20:53:26,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {2698#(or (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))))} [176] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {2699#(or (and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 20:53:26,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {2699#(or (and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} [201] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [195] L34-1-->L70: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [225] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [177] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,390 INFO L290 TraceCheckUtils]: 31: Hoare triple {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [175] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [253] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [162] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [205] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,393 INFO L290 TraceCheckUtils]: 35: Hoare triple {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [149] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [170] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [211] L71-2-->L71-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [251] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_8|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {2700#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [230] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] {2701#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~N1~0 ~N2~0)) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {2701#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~N1~0 ~N2~0)) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [240] thread2ENTRY-->L51-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] {2702#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~N1~0 ~N2~0)) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,398 INFO L290 TraceCheckUtils]: 41: Hoare triple {2702#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~N1~0 ~N2~0)) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [242] L51-4-->L51-5: Formula: (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N2~0_1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_1} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_1} AuxVars[] AssignedVars[] {2703#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0) (< ~N2~0 (+ ~N1~0 1))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {2703#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0) (< ~N2~0 (+ ~N1~0 1))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [244] L51-5-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] {2703#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0) (< ~N2~0 (+ ~N1~0 1))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {2703#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0) (< ~N2~0 (+ ~N1~0 1))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [246] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2703#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0) (< ~N2~0 (+ ~N1~0 1))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:26,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {2703#(and (or (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (= ~N1~0 (+ ~counter~0 ~N2~0))) (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0) (< ~N2~0 (+ ~N1~0 1))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [232] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N1~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_1} AuxVars[] AssignedVars[] {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:26,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [234] L41-5-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:26,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [236] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:26,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [159] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:26,403 INFO L290 TraceCheckUtils]: 48: Hoare triple {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [190] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:26,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [224] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:26,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [254] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:26,404 INFO L290 TraceCheckUtils]: 51: Hoare triple {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [153] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:26,405 INFO L290 TraceCheckUtils]: 52: Hoare triple {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [182] L73-->L73-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:26,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [255] thread2EXIT-->L73-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} AuxVars[] AssignedVars[] {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:26,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [183] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:26,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [213] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:26,409 INFO L290 TraceCheckUtils]: 56: Hoare triple {2704#(and (= ~N1~0 (+ ~counter~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [178] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (not (= v_~counter~0_7 (+ (* (- 1) v_~N2~0_6) v_~N1~0_6))) 1 0)) InVars {~counter~0=v_~counter~0_7, ~N1~0=v_~N1~0_6, ~N2~0=v_~N2~0_6} OutVars{~counter~0=v_~counter~0_7, ~N1~0=v_~N1~0_6, ~N2~0=v_~N2~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {2705#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:53:26,409 INFO L290 TraceCheckUtils]: 57: Hoare triple {2705#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [198] L75-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {2705#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:53:26,410 INFO L290 TraceCheckUtils]: 58: Hoare triple {2705#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [187] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {2706#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:53:26,410 INFO L290 TraceCheckUtils]: 59: Hoare triple {2706#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [155] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {2695#false} is VALID [2022-02-20 20:53:26,410 INFO L290 TraceCheckUtils]: 60: Hoare triple {2695#false} [164] L34-3-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2695#false} is VALID [2022-02-20 20:53:26,411 INFO L290 TraceCheckUtils]: 61: Hoare triple {2695#false} [226] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2695#false} is VALID [2022-02-20 20:53:26,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:53:26,414 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:53:26,414 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706089715] [2022-02-20 20:53:26,414 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706089715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:53:26,414 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:53:26,414 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 20:53:26,415 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286536055] [2022-02-20 20:53:26,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:53:26,416 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 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) Word has length 62 [2022-02-20 20:53:26,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:53:26,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:26,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:53:26,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 20:53:26,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:53:26,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 20:53:26,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-02-20 20:53:26,474 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 89 [2022-02-20 20:53:26,475 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 84 transitions, 301 flow. Second operand has 13 states, 13 states have (on average 54.61538461538461) internal successors, (710), 13 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:26,475 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:53:26,475 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 89 [2022-02-20 20:53:26,475 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:53:27,295 INFO L129 PetriNetUnfolder]: 71/291 cut-off events. [2022-02-20 20:53:27,295 INFO L130 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2022-02-20 20:53:27,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 291 events. 71/291 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1315 event pairs, 34 based on Foata normal form. 1/286 useless extension candidates. Maximal degree in co-relation 664. Up to 105 conditions per place. [2022-02-20 20:53:27,299 INFO L132 encePairwiseOnDemand]: 77/89 looper letters, 50 selfloop transitions, 15 changer transitions 6/114 dead transitions. [2022-02-20 20:53:27,299 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 114 transitions, 559 flow [2022-02-20 20:53:27,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:53:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-02-20 20:53:27,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 703 transitions. [2022-02-20 20:53:27,309 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6582397003745318 [2022-02-20 20:53:27,309 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 703 transitions. [2022-02-20 20:53:27,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 703 transitions. [2022-02-20 20:53:27,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:53:27,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 703 transitions. [2022-02-20 20:53:27,312 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 58.583333333333336) internal successors, (703), 12 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:27,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:27,314 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:27,315 INFO L186 Difference]: Start difference. First operand has 104 places, 84 transitions, 301 flow. Second operand 12 states and 703 transitions. [2022-02-20 20:53:27,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 114 transitions, 559 flow [2022-02-20 20:53:57,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 114 transitions, 520 flow, removed 11 selfloop flow, removed 8 redundant places. [2022-02-20 20:53:58,000 INFO L242 Difference]: Finished difference. Result has 110 places, 86 transitions, 352 flow [2022-02-20 20:53:58,000 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=352, PETRI_PLACES=110, PETRI_TRANSITIONS=86} [2022-02-20 20:53:58,001 INFO L334 CegarLoopForPetriNet]: 79 programPoint places, 31 predicate places. [2022-02-20 20:53:58,001 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 110 places, 86 transitions, 352 flow [2022-02-20 20:53:58,029 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 760 states, 754 states have (on average 2.3607427055702916) internal successors, (1780), 759 states have internal predecessors, (1780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:58,030 INFO L78 Accepts]: Start accepts. Automaton has has 760 states, 754 states have (on average 2.3607427055702916) internal successors, (1780), 759 states have internal predecessors, (1780), 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) Word has length 62 [2022-02-20 20:53:58,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:53:58,031 INFO L470 AbstractCegarLoop]: Abstraction has has 110 places, 86 transitions, 352 flow [2022-02-20 20:53:58,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 54.61538461538461) internal successors, (710), 13 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:58,032 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:53:58,032 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] [2022-02-20 20:53:58,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:53:58,032 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:53:58,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:53:58,033 INFO L85 PathProgramCache]: Analyzing trace with hash 2028291361, now seen corresponding path program 5 times [2022-02-20 20:53:58,033 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:53:58,033 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016872522] [2022-02-20 20:53:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:53:58,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:53:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:53:58,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {3493#true} [204] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3493#true} is VALID [2022-02-20 20:53:58,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {3493#true} [186] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3493#true} is VALID [2022-02-20 20:53:58,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {3493#true} [209] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {3493#true} is VALID [2022-02-20 20:53:58,427 INFO L290 TraceCheckUtils]: 3: Hoare triple {3493#true} [212] L-1-2-->L21: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {3493#true} is VALID [2022-02-20 20:53:58,427 INFO L290 TraceCheckUtils]: 4: Hoare triple {3493#true} [180] L21-->L21-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {3493#true} is VALID [2022-02-20 20:53:58,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {3493#true} [199] L21-1-->L21-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {3493#true} is VALID [2022-02-20 20:53:58,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {3493#true} [197] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {3493#true} is VALID [2022-02-20 20:53:58,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {3493#true} [166] L21-3-->L21-4: Formula: (and (= (select |v_#length_2| 2) 25) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {3493#true} is VALID [2022-02-20 20:53:58,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {3493#true} [221] L21-4-->L38: Formula: (= 0 v_~N1~0_3) InVars {} OutVars{~N1~0=v_~N1~0_3} AuxVars[] AssignedVars[~N1~0] {3493#true} is VALID [2022-02-20 20:53:58,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {3493#true} [222] L38-->L38-1: Formula: (= 0 v_~N2~0_3) InVars {} OutVars{~N2~0=v_~N2~0_3} AuxVars[] AssignedVars[~N2~0] {3493#true} is VALID [2022-02-20 20:53:58,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {3493#true} [167] L38-1-->L-1-3: Formula: (= v_~counter~0_6 0) InVars {} OutVars{~counter~0=v_~counter~0_6} AuxVars[] AssignedVars[~counter~0] {3495#(= ~counter~0 0)} is VALID [2022-02-20 20:53:58,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {3495#(= ~counter~0 0)} [215] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3495#(= ~counter~0 0)} is VALID [2022-02-20 20:53:58,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {3495#(= ~counter~0 0)} [194] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3495#(= ~counter~0 0)} is VALID [2022-02-20 20:53:58,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {3495#(= ~counter~0 0)} [161] L-1-5-->L-1-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {3495#(= ~counter~0 0)} is VALID [2022-02-20 20:53:58,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {3495#(= ~counter~0 0)} [192] L-1-6-->L62: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_1|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1, ULTIMATE.start_main_#t~pre9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~mem11#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~mem12#1, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] {3495#(= ~counter~0 0)} is VALID [2022-02-20 20:53:58,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {3495#(= ~counter~0 0)} [216] L62-->L62-1: Formula: (and (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4)) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0)) (= (store |v_#valid_5| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_4|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] {3495#(= ~counter~0 0)} is VALID [2022-02-20 20:53:58,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {3495#(= ~counter~0 0)} [202] L62-1-->L62-2: Formula: (and (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0) (= (store |v_#valid_7| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_6|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t2~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] {3495#(= ~counter~0 0)} is VALID [2022-02-20 20:53:58,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {3495#(= ~counter~0 0)} [179] L62-2-->L64: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {3495#(= ~counter~0 0)} is VALID [2022-02-20 20:53:58,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {3495#(= ~counter~0 0)} [168] L64-->L64-1: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~N1~0_4) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~N1~0=v_~N1~0_4} AuxVars[] AssignedVars[~N1~0] {3495#(= ~counter~0 0)} is VALID [2022-02-20 20:53:58,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {3495#(= ~counter~0 0)} [210] L64-1-->L65: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {3495#(= ~counter~0 0)} is VALID [2022-02-20 20:53:58,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {3495#(= ~counter~0 0)} [228] L65-->L65-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet6#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet6#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[] {3495#(= ~counter~0 0)} is VALID [2022-02-20 20:53:58,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {3495#(= ~counter~0 0)} [206] L65-1-->L65-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet6#1_3| v_~N2~0_4) InVars {ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|, ~N2~0=v_~N2~0_4} AuxVars[] AssignedVars[~N2~0] {3496#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {3496#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [185] L65-2-->L67: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {3496#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {3496#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [203] L67-->L67-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3496#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {3496#(or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [173] L67-1-->L67-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1| (ite (and (<= 0 v_~N1~0_5) (<= 0 v_~N2~0_5)) 1 0)) InVars {~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5} OutVars{~N1~0=v_~N1~0_5, ~N2~0=v_~N2~0_5, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {3497#(or (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))))} is VALID [2022-02-20 20:53:58,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {3497#(or (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))))} [160] L67-2-->L34: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {3497#(or (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))))} is VALID [2022-02-20 20:53:58,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {3497#(or (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) (and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))))} [176] L34-->L35: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_2|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {3498#(or (and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 20:53:58,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {3498#(or (and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (and (or (not (<= 0 ~N1~0)) (not (<= 0 ~N2~0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} [201] L35-->L34-1: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_4| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_4|} AuxVars[] AssignedVars[] {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [195] L34-1-->L70: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [225] L70-->L70-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [177] L70-1-->L70-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [175] L70-2-->L70-3: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,440 INFO L290 TraceCheckUtils]: 32: Hoare triple {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [253] L70-3-->thread1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_thread1Thread1of1ForFork1_thidvar0_2) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_8|, thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_4|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_12, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#t~post1, thread1Thread1of1ForFork1_#t~post2, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0] {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [162] L70-4-->L70-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,441 INFO L290 TraceCheckUtils]: 34: Hoare triple {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [205] L70-5-->L71: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet8#1] {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,442 INFO L290 TraceCheckUtils]: 35: Hoare triple {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [149] L71-->L71-1: Formula: (= |v_ULTIMATE.start_main_#t~pre9#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,443 INFO L290 TraceCheckUtils]: 36: Hoare triple {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [170] L71-1-->L71-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,443 INFO L290 TraceCheckUtils]: 37: Hoare triple {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [211] L71-2-->L71-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2~0#1.base_3|) |v_ULTIMATE.start_main_~#t2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre9#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_3|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [251] L71-3-->thread2ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre9#1_6| v_thread2Thread1of1ForFork0_thidvar0_2) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|} OutVars{thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1_4|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_4|, ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_6|, thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_4|, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_12|, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#t~post3#1=|v_thread2Thread1of1ForFork0_#t~post3#1_8|, thread2Thread1of1ForFork0_#t~post4#1=|v_thread2Thread1of1ForFork0_#t~post4#1_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset, thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_~i~1#1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#t~post3#1, thread2Thread1of1ForFork0_#t~post4#1] {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,445 INFO L290 TraceCheckUtils]: 39: Hoare triple {3499#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (<= 0 ~N2~0) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [230] thread1ENTRY-->L41-4: Formula: (= v_thread1Thread1of1ForFork1_~i~0_1 0) InVars {} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0] {3500#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~N1~0 ~N2~0)) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,447 INFO L290 TraceCheckUtils]: 40: Hoare triple {3500#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~N1~0 ~N2~0)) (<= 0 ~N1~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [240] thread2ENTRY-->L51-4: Formula: (= |v_thread2Thread1of1ForFork0_~i~1#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~i~1#1] {3501#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~N1~0 ~N2~0)) (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~N1~0)) (not (<= ~N1~0 ~N2~0)))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} is VALID [2022-02-20 20:53:58,448 INFO L290 TraceCheckUtils]: 41: Hoare triple {3501#(and (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))) (or (and (or (and (<= 0 ~N2~0) (= thread1Thread1of1ForFork1_~i~0 0)) (<= ~N1~0 ~N2~0)) (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~N1~0)) (not (<= ~N1~0 ~N2~0)))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)))} [232] L41-4-->L41-5: Formula: (not (< v_thread1Thread1of1ForFork1_~i~0_3 v_~N1~0_1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_1} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_3, ~N1~0=v_~N1~0_1} AuxVars[] AssignedVars[] {3502#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~N1~0) (<= ~N1~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))))} is VALID [2022-02-20 20:53:58,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {3502#(and (or (and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= 0 ~N1~0) (<= ~N1~0 ~N2~0)) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0)) (or (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (not (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))))} [242] L51-4-->L51-5: Formula: (not (< |v_thread2Thread1of1ForFork0_~i~1#1_3| v_~N2~0_1)) InVars {thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_1} OutVars{thread2Thread1of1ForFork0_~i~1#1=|v_thread2Thread1of1ForFork0_~i~1#1_3|, ~N2~0=v_~N2~0_1} AuxVars[] AssignedVars[] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [244] L51-5-->thread2FINAL: Formula: (and (= |v_thread2Thread1of1ForFork0_#res#1.base_1| 0) (= |v_thread2Thread1of1ForFork0_#res#1.offset_1| 0)) InVars {} OutVars{thread2Thread1of1ForFork0_#res#1.offset=|v_thread2Thread1of1ForFork0_#res#1.offset_1|, thread2Thread1of1ForFork0_#res#1.base=|v_thread2Thread1of1ForFork0_#res#1.base_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#res#1.offset] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [246] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [159] L71-4-->L71-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre9#1=|v_ULTIMATE.start_main_#t~pre9#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre9#1] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,451 INFO L290 TraceCheckUtils]: 46: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [190] L71-5-->L72: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet10#1=|v_ULTIMATE.start_main_#t~nondet10#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10#1] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,451 INFO L290 TraceCheckUtils]: 47: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [224] L72-->L72-1: Formula: (= |v_ULTIMATE.start_main_#t~mem11#1_2| (select (select |v_#memory_int_7| |v_ULTIMATE.start_main_~#t1~0#1.base_4|) |v_ULTIMATE.start_main_~#t1~0#1.offset_4|)) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_2|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_4|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,452 INFO L290 TraceCheckUtils]: 48: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [234] L41-5-->thread1FINAL: Formula: (and (= |v_thread1Thread1of1ForFork1_#res.base_1| 0) (= |v_thread1Thread1of1ForFork1_#res.offset_1| 0)) InVars {} OutVars{thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_1|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_#res.offset] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,452 INFO L290 TraceCheckUtils]: 49: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [236] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,453 INFO L290 TraceCheckUtils]: 50: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [254] thread1EXIT-->L72-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem11#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [153] L72-2-->L73: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem11#1=|v_ULTIMATE.start_main_#t~mem11#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11#1] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,454 INFO L290 TraceCheckUtils]: 52: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [182] L73-->L73-1: Formula: (= (select (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t2~0#1.base_4|) |v_ULTIMATE.start_main_~#t2~0#1.offset_4|) |v_ULTIMATE.start_main_#t~mem12#1_2|) InVars {#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_4|, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,455 INFO L290 TraceCheckUtils]: 53: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [255] thread2EXIT-->L73-2: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem12#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_5|} AuxVars[] AssignedVars[] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,455 INFO L290 TraceCheckUtils]: 54: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [183] L73-2-->L75: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~mem12#1=|v_ULTIMATE.start_main_#t~mem12#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem12#1] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,456 INFO L290 TraceCheckUtils]: 55: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [213] L75-->L75-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} is VALID [2022-02-20 20:53:58,456 INFO L290 TraceCheckUtils]: 56: Hoare triple {3503#(and (= ~counter~0 (+ ~N1~0 (* (- 1) ~N2~0))) (= (+ ~N1~0 (* (- 1) ~N2~0)) 0))} [178] L75-1-->L75-2: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3| (ite (not (= v_~counter~0_7 (+ (* (- 1) v_~N2~0_6) v_~N1~0_6))) 1 0)) InVars {~counter~0=v_~counter~0_7, ~N1~0=v_~N1~0_6, ~N2~0=v_~N2~0_6} OutVars{~counter~0=v_~counter~0_7, ~N1~0=v_~N1~0_6, ~N2~0=v_~N2~0_6, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_#in~cond#1] {3504#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:53:58,457 INFO L290 TraceCheckUtils]: 57: Hoare triple {3504#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [198] L75-2-->L34-2: Formula: true InVars {} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_5|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {3504#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} is VALID [2022-02-20 20:53:58,458 INFO L290 TraceCheckUtils]: 58: Hoare triple {3504#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)} [187] L34-2-->L35-3: Formula: (= |v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4| |v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_6|, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond#1] {3505#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 20:53:58,459 INFO L290 TraceCheckUtils]: 59: Hoare triple {3505#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} [155] L35-3-->L34-3: Formula: (not (= |v_ULTIMATE.start_assume_abort_if_not_~cond#1_8| 0)) InVars {ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} OutVars{ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_8|} AuxVars[] AssignedVars[] {3494#false} is VALID [2022-02-20 20:53:58,459 INFO L290 TraceCheckUtils]: 60: Hoare triple {3494#false} [164] L34-3-->L76: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3494#false} is VALID [2022-02-20 20:53:58,459 INFO L290 TraceCheckUtils]: 61: Hoare triple {3494#false} [226] L76-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3494#false} is VALID [2022-02-20 20:53:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:53:58,460 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:53:58,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016872522] [2022-02-20 20:53:58,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016872522] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:53:58,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:53:58,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 20:53:58,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929483104] [2022-02-20 20:53:58,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:53:58,461 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 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) Word has length 62 [2022-02-20 20:53:58,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:53:58,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 13 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:58,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:53:58,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 20:53:58,511 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:53:58,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 20:53:58,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-02-20 20:53:58,513 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 89 [2022-02-20 20:53:58,514 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 86 transitions, 352 flow. Second operand has 13 states, 13 states have (on average 54.61538461538461) internal successors, (710), 13 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:58,514 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:53:58,514 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 89 [2022-02-20 20:53:58,514 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:53:59,328 INFO L129 PetriNetUnfolder]: 71/280 cut-off events. [2022-02-20 20:53:59,328 INFO L130 PetriNetUnfolder]: For 306/306 co-relation queries the response was YES. [2022-02-20 20:53:59,330 INFO L84 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 280 events. 71/280 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1237 event pairs, 32 based on Foata normal form. 1/276 useless extension candidates. Maximal degree in co-relation 673. Up to 105 conditions per place. [2022-02-20 20:53:59,331 INFO L132 encePairwiseOnDemand]: 77/89 looper letters, 42 selfloop transitions, 14 changer transitions 9/108 dead transitions. [2022-02-20 20:53:59,331 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 108 transitions, 563 flow [2022-02-20 20:53:59,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:53:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-02-20 20:53:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 696 transitions. [2022-02-20 20:53:59,339 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.651685393258427 [2022-02-20 20:53:59,339 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 696 transitions. [2022-02-20 20:53:59,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 696 transitions. [2022-02-20 20:53:59,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:53:59,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 696 transitions. [2022-02-20 20:53:59,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 58.0) internal successors, (696), 12 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:59,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:59,344 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 20:53:59,344 INFO L186 Difference]: Start difference. First operand has 110 places, 86 transitions, 352 flow. Second operand 12 states and 696 transitions. [2022-02-20 20:53:59,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 108 transitions, 563 flow