./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-longest-1.i --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/pthread/triangular-longest-1.i -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 81809963fcaff21fd6241cde97e522447f695a8b323a0a16c5a31b7f82b0f683 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:09:03,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:09:03,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:09:03,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:09:03,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:09:03,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:09:03,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:09:03,608 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:09:03,612 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:09:03,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:09:03,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:09:03,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:09:03,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:09:03,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:09:03,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:09:03,624 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:09:03,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:09:03,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:09:03,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:09:03,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:09:03,634 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:09:03,634 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:09:03,635 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:09:03,636 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:09:03,640 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:09:03,641 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:09:03,641 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:09:03,642 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:09:03,643 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:09:03,644 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:09:03,644 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:09:03,645 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:09:03,645 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:09:03,646 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:09:03,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:09:03,648 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:09:03,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:09:03,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:09:03,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:09:03,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:09:03,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:09:03,650 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:09:03,668 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:09:03,668 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:09:03,669 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:09:03,669 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:09:03,669 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:09:03,669 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:09:03,670 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:09:03,670 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:09:03,670 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:09:03,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:09:03,670 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:09:03,671 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:09:03,671 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:09:03,671 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:09:03,671 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:09:03,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:09:03,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:09:03,671 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:09:03,672 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:09:03,672 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:09:03,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:09:03,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:09:03,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:09:03,672 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:09:03,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:09:03,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:09:03,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:09:03,673 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:09:03,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:09:03,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:09:03,673 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:09:03,674 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:09:03,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:09:03,674 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 -> 81809963fcaff21fd6241cde97e522447f695a8b323a0a16c5a31b7f82b0f683 [2022-02-20 20:09:03,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:09:03,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:09:03,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:09:03,909 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:09:03,909 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:09:03,910 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longest-1.i [2022-02-20 20:09:03,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b659aee5d/1e37b5e2b45840b5bb08dc0cb91ffc92/FLAG16f888dbc [2022-02-20 20:09:04,370 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:09:04,371 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longest-1.i [2022-02-20 20:09:04,381 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b659aee5d/1e37b5e2b45840b5bb08dc0cb91ffc92/FLAG16f888dbc [2022-02-20 20:09:04,392 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b659aee5d/1e37b5e2b45840b5bb08dc0cb91ffc92 [2022-02-20 20:09:04,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:09:04,396 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:09:04,397 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:09:04,397 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:09:04,399 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:09:04,399 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:09:04" (1/1) ... [2022-02-20 20:09:04,400 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f018e2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:04, skipping insertion in model container [2022-02-20 20:09:04,400 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:09:04" (1/1) ... [2022-02-20 20:09:04,404 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:09:04,440 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:09:04,737 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/pthread/triangular-longest-1.i[30962,30975] [2022-02-20 20:09:04,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:09:04,745 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:09:04,784 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/pthread/triangular-longest-1.i[30962,30975] [2022-02-20 20:09:04,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:09:04,813 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:09:04,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:04 WrapperNode [2022-02-20 20:09:04,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:09:04,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:09:04,817 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:09:04,817 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:09:04,822 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:09:04" (1/1) ... [2022-02-20 20:09:04,844 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:09:04" (1/1) ... [2022-02-20 20:09:04,863 INFO L137 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-02-20 20:09:04,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:09:04,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:09:04,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:09:04,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:09:04,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:04" (1/1) ... [2022-02-20 20:09:04,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:04" (1/1) ... [2022-02-20 20:09:04,874 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:04" (1/1) ... [2022-02-20 20:09:04,874 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:04" (1/1) ... [2022-02-20 20:09:04,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:04" (1/1) ... [2022-02-20 20:09:04,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:04" (1/1) ... [2022-02-20 20:09:04,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:04" (1/1) ... [2022-02-20 20:09:04,898 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:09:04,901 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:09:04,902 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:09:04,903 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:09:04,903 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:04" (1/1) ... [2022-02-20 20:09:04,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:09:04,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:09:04,925 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:09:04,930 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:09:04,950 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-02-20 20:09:04,950 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-02-20 20:09:04,950 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-02-20 20:09:04,951 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-02-20 20:09:04,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:09:04,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 20:09:04,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:09:04,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:09:04,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:09:04,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:09:04,951 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 20:09:04,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:09:04,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:09:04,953 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:09:05,034 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:09:05,038 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:09:05,216 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:09:05,221 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:09:05,221 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 20:09:05,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:09:05 BoogieIcfgContainer [2022-02-20 20:09:05,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:09:05,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:09:05,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:09:05,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:09:05,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:09:04" (1/3) ... [2022-02-20 20:09:05,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b5fe25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:09:05, skipping insertion in model container [2022-02-20 20:09:05,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:09:04" (2/3) ... [2022-02-20 20:09:05,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b5fe25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:09:05, skipping insertion in model container [2022-02-20 20:09:05,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:09:05" (3/3) ... [2022-02-20 20:09:05,229 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-longest-1.i [2022-02-20 20:09:05,233 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:09:05,233 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:09:05,233 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:09:05,233 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:09:05,272 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,273 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,273 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,273 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,273 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,274 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,274 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,274 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,274 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,274 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,275 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,276 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,277 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,278 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,279 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,279 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,279 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,279 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,279 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,280 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,280 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,280 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,280 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,280 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,280 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,281 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,281 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,281 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,281 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,282 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,282 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,282 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,282 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,282 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,283 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,283 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,283 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,284 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,285 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,288 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,288 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,289 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,289 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,290 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,290 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,290 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,290 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,292 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,292 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,292 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,292 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,294 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,296 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,296 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,296 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,296 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,296 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,298 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,299 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,299 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,300 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,300 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,300 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:09:05,300 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:09:05,336 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:09:05,340 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:09:05,341 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:09:05,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 70 transitions, 150 flow [2022-02-20 20:09:05,369 INFO L129 PetriNetUnfolder]: 5/68 cut-off events. [2022-02-20 20:09:05,370 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:09:05,372 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 68 events. 5/68 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2022-02-20 20:09:05,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 70 transitions, 150 flow [2022-02-20 20:09:05,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 68 transitions, 142 flow [2022-02-20 20:09:05,385 INFO L129 PetriNetUnfolder]: 4/58 cut-off events. [2022-02-20 20:09:05,385 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:09:05,385 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:09:05,386 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] [2022-02-20 20:09:05,386 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:09:05,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:09:05,390 INFO L85 PathProgramCache]: Analyzing trace with hash 398220865, now seen corresponding path program 1 times [2022-02-20 20:09:05,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:09:05,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579775840] [2022-02-20 20:09:05,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:09:05,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:09:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:09:05,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {75#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75#true} is VALID [2022-02-20 20:09:05,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {75#true} [136] 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] {75#true} is VALID [2022-02-20 20:09:05,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {75#true} [152] 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[] {75#true} is VALID [2022-02-20 20:09:05,816 INFO L290 TraceCheckUtils]: 3: Hoare triple {75#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {75#true} is VALID [2022-02-20 20:09:05,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {75#true} [147] L693-->L693-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[] {75#true} is VALID [2022-02-20 20:09:05,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {75#true} [94] L693-1-->L693-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[] {75#true} is VALID [2022-02-20 20:09:05,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {75#true} [150] L693-2-->L693-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[] {75#true} is VALID [2022-02-20 20:09:05,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {75#true} [137] L693-3-->L693-4: Formula: (and (= 23 (select |v_#length_2| 2)) (= (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[] {75#true} is VALID [2022-02-20 20:09:05,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {75#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {77#(<= ~i~0 46)} is VALID [2022-02-20 20:09:05,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {77#(<= ~i~0 46)} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [108] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [140] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [100] L-1-7-->L711: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_1|, ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#id2~0#1.offset, ULTIMATE.start_main_~condJ~0#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~condI~0#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#id2~0#1.base] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [138] L711-->L711-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,823 INFO L290 TraceCheckUtils]: 16: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [139] L711-1-->L712: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [157] L712-->L712-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id1~0#1.base_2|)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 1)) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#id1~0#1.offset_2| 0)) 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_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [96] L712-1-->L712-2: Formula: (and (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id2~0#1.base_2|)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id2~0#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#id2~0#1.base] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,825 INFO L290 TraceCheckUtils]: 19: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [151] L712-2-->L713: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [131] L713-->L713-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,826 INFO L290 TraceCheckUtils]: 21: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [104] L713-1-->L713-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3|) |v_ULTIMATE.start_main_~#id1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [184] L713-2-->t1ENTRY: Formula: (and (= v_t1Thread1of1ForFork0_thidvar1_2 0) (= |v_t1Thread1of1ForFork0_#in~arg.base_4| 0) (= |v_t1Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_t1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, t1Thread1of1ForFork0_thidvar1=v_t1Thread1of1ForFork0_thidvar1_2, t1Thread1of1ForFork0_thidvar0=v_t1Thread1of1ForFork0_thidvar0_2, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_8|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_4, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_4|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_4, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_12, t1Thread1of1ForFork0_#res.base=|v_t1Thread1of1ForFork0_#res.base_4|, t1Thread1of1ForFork0_#res.offset=|v_t1Thread1of1ForFork0_#res.offset_4|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_thidvar1, t1Thread1of1ForFork0_thidvar0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_#in~arg.base, t1Thread1of1ForFork0_~arg.offset, t1Thread1of1ForFork0_~k~0, t1Thread1of1ForFork0_#res.base, t1Thread1of1ForFork0_#res.offset, t1Thread1of1ForFork0_#in~arg.offset] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,827 INFO L290 TraceCheckUtils]: 23: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [130] L713-3-->L713-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [123] L713-4-->L714: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,829 INFO L290 TraceCheckUtils]: 25: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [98] L714-->L714-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [122] L714-1-->L714-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [109] L714-2-->L714-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3|) |v_ULTIMATE.start_main_~#id2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [186] L714-3-->t2ENTRY: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_4| 0) (= |v_t2Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_t2Thread1of1ForFork1_thidvar0_2) (= v_t2Thread1of1ForFork1_thidvar1_2 0) (= v_t2Thread1of1ForFork1_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_4|, t2Thread1of1ForFork1_thidvar1=v_t2Thread1of1ForFork1_thidvar1_2, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_4, t2Thread1of1ForFork1_thidvar0=v_t2Thread1of1ForFork1_thidvar0_2, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_8|, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_4, t2Thread1of1ForFork1_#res.base=|v_t2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_4|, t2Thread1of1ForFork1_#res.offset=|v_t2Thread1of1ForFork1_#res.offset_4|, t2Thread1of1ForFork1_thidvar2=v_t2Thread1of1ForFork1_thidvar2_2, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#in~arg.base, t2Thread1of1ForFork1_thidvar1, t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_thidvar0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_#res.base, t2Thread1of1ForFork1_#in~arg.offset, t2Thread1of1ForFork1_#res.offset, t2Thread1of1ForFork1_thidvar2, t2Thread1of1ForFork1_~k~1] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,832 INFO L290 TraceCheckUtils]: 29: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [132] L714-4-->L714-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] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [126] L714-5-->L715: 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] {78#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {78#(and (<= ~i~0 46) (<= ~j~0 46))} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (< 46 v_~i~0_2) 1 0)) InVars {~i~0=v_~i~0_2} OutVars{~i~0=v_~i~0_2, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condI~0#1] {79#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~j~0 46))} is VALID [2022-02-20 20:09:05,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {79#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~j~0 46))} [114] L717-->L720: Formula: (= (ite (< 46 v_~j~0_2) 1 0) |v_ULTIMATE.start_main_~condJ~0#1_2|) InVars {~j~0=v_~j~0_2} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_2|, ~j~0=v_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0#1] {80#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:05,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {80#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} [127] L720-->L722: Formula: (or (not (= |v_ULTIMATE.start_main_~condJ~0#1_3| 0)) (not (= |v_ULTIMATE.start_main_~condI~0#1_3| 0))) InVars {ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} AuxVars[] AssignedVars[] {76#false} is VALID [2022-02-20 20:09:05,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {76#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {76#false} is VALID [2022-02-20 20:09:05,836 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:09:05,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:09:05,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579775840] [2022-02-20 20:09:05,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579775840] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:09:05,837 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:09:05,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:09:05,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042428242] [2022-02-20 20:09:05,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:09:05,850 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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 35 [2022-02-20 20:09:05,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:09:05,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 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:09:05,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:09:05,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:09:05,891 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:09:05,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:09:05,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:09:05,914 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:09:05,920 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 68 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 56.333333333333336) internal successors, (338), 6 states have internal predecessors, (338), 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:09:05,920 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:09:05,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:09:05,922 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:09:06,135 INFO L129 PetriNetUnfolder]: 42/210 cut-off events. [2022-02-20 20:09:06,135 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-02-20 20:09:06,137 INFO L84 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 210 events. 42/210 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 816 event pairs, 3 based on Foata normal form. 46/240 useless extension candidates. Maximal degree in co-relation 257. Up to 28 conditions per place. [2022-02-20 20:09:06,140 INFO L132 encePairwiseOnDemand]: 59/70 looper letters, 22 selfloop transitions, 17 changer transitions 0/92 dead transitions. [2022-02-20 20:09:06,140 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 271 flow [2022-02-20 20:09:06,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 20:09:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-02-20 20:09:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 613 transitions. [2022-02-20 20:09:06,168 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8757142857142857 [2022-02-20 20:09:06,168 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 613 transitions. [2022-02-20 20:09:06,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 613 transitions. [2022-02-20 20:09:06,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:09:06,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 613 transitions. [2022-02-20 20:09:06,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 61.3) internal successors, (613), 10 states have internal predecessors, (613), 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:09:06,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 70.0) internal successors, (770), 11 states have internal predecessors, (770), 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:09:06,179 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 70.0) internal successors, (770), 11 states have internal predecessors, (770), 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:09:06,180 INFO L186 Difference]: Start difference. First operand has 70 places, 68 transitions, 142 flow. Second operand 10 states and 613 transitions. [2022-02-20 20:09:06,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 271 flow [2022-02-20 20:09:06,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 92 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:09:06,188 INFO L242 Difference]: Finished difference. Result has 85 places, 85 transitions, 276 flow [2022-02-20 20:09:06,190 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=276, PETRI_PLACES=85, PETRI_TRANSITIONS=85} [2022-02-20 20:09:06,193 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 15 predicate places. [2022-02-20 20:09:06,193 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 85 transitions, 276 flow [2022-02-20 20:09:06,343 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3711 states, 3705 states have (on average 2.9031039136302295) internal successors, (10756), 3710 states have internal predecessors, (10756), 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:09:06,354 INFO L78 Accepts]: Start accepts. Automaton has has 3711 states, 3705 states have (on average 2.9031039136302295) internal successors, (10756), 3710 states have internal predecessors, (10756), 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 35 [2022-02-20 20:09:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:09:06,355 INFO L470 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 276 flow [2022-02-20 20:09:06,355 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.333333333333336) internal successors, (338), 6 states have internal predecessors, (338), 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:09:06,355 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:09:06,356 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] [2022-02-20 20:09:06,356 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:09:06,356 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:09:06,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:09:06,357 INFO L85 PathProgramCache]: Analyzing trace with hash 245149124, now seen corresponding path program 1 times [2022-02-20 20:09:06,357 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:09:06,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523347728] [2022-02-20 20:09:06,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:09:06,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:09:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:09:06,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {3811#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3811#true} is VALID [2022-02-20 20:09:06,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {3811#true} [136] 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] {3811#true} is VALID [2022-02-20 20:09:06,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {3811#true} [152] 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[] {3811#true} is VALID [2022-02-20 20:09:06,499 INFO L290 TraceCheckUtils]: 3: Hoare triple {3811#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {3811#true} is VALID [2022-02-20 20:09:06,500 INFO L290 TraceCheckUtils]: 4: Hoare triple {3811#true} [147] L693-->L693-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[] {3811#true} is VALID [2022-02-20 20:09:06,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {3811#true} [94] L693-1-->L693-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[] {3811#true} is VALID [2022-02-20 20:09:06,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {3811#true} [150] L693-2-->L693-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[] {3811#true} is VALID [2022-02-20 20:09:06,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {3811#true} [137] L693-3-->L693-4: Formula: (and (= 23 (select |v_#length_2| 2)) (= (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[] {3811#true} is VALID [2022-02-20 20:09:06,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {3811#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {3811#true} is VALID [2022-02-20 20:09:06,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {3811#true} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {3813#(<= ~j~0 6)} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,502 INFO L290 TraceCheckUtils]: 11: Hoare triple {3813#(<= ~j~0 6)} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {3813#(<= ~j~0 6)} [108] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {3813#(<= ~j~0 6)} [140] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {3813#(<= ~j~0 6)} [100] L-1-7-->L711: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_1|, ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#id2~0#1.offset, ULTIMATE.start_main_~condJ~0#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~condI~0#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#id2~0#1.base] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {3813#(<= ~j~0 6)} [138] L711-->L711-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {3813#(<= ~j~0 6)} [139] L711-1-->L712: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {3813#(<= ~j~0 6)} [157] L712-->L712-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id1~0#1.base_2|)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 1)) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#id1~0#1.offset_2| 0)) 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_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {3813#(<= ~j~0 6)} [96] L712-1-->L712-2: Formula: (and (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id2~0#1.base_2|)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id2~0#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#id2~0#1.base] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {3813#(<= ~j~0 6)} [151] L712-2-->L713: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,509 INFO L290 TraceCheckUtils]: 20: Hoare triple {3813#(<= ~j~0 6)} [131] L713-->L713-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {3813#(<= ~j~0 6)} [104] L713-1-->L713-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3|) |v_ULTIMATE.start_main_~#id1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,510 INFO L290 TraceCheckUtils]: 22: Hoare triple {3813#(<= ~j~0 6)} [184] L713-2-->t1ENTRY: Formula: (and (= v_t1Thread1of1ForFork0_thidvar1_2 0) (= |v_t1Thread1of1ForFork0_#in~arg.base_4| 0) (= |v_t1Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_t1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, t1Thread1of1ForFork0_thidvar1=v_t1Thread1of1ForFork0_thidvar1_2, t1Thread1of1ForFork0_thidvar0=v_t1Thread1of1ForFork0_thidvar0_2, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_8|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_4, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_4|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_4, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_12, t1Thread1of1ForFork0_#res.base=|v_t1Thread1of1ForFork0_#res.base_4|, t1Thread1of1ForFork0_#res.offset=|v_t1Thread1of1ForFork0_#res.offset_4|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_thidvar1, t1Thread1of1ForFork0_thidvar0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_#in~arg.base, t1Thread1of1ForFork0_~arg.offset, t1Thread1of1ForFork0_~k~0, t1Thread1of1ForFork0_#res.base, t1Thread1of1ForFork0_#res.offset, t1Thread1of1ForFork0_#in~arg.offset] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {3813#(<= ~j~0 6)} [161] t1ENTRY-->L696: Formula: (and (= |v_t1Thread1of1ForFork0_#in~arg.offset_1| v_t1Thread1of1ForFork0_~arg.offset_1) (= |v_t1Thread1of1ForFork0_#in~arg.base_1| v_t1Thread1of1ForFork0_~arg.base_1)) InVars {t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_1|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_1|} OutVars{t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_1|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_1, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_1|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_1} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_~arg.offset] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {3813#(<= ~j~0 6)} [162] L696-->L696-5: Formula: (= v_t1Thread1of1ForFork0_~k~0_1 0) InVars {} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_1} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~k~0] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {3813#(<= ~j~0 6)} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 20) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {3813#(<= ~j~0 6)} is VALID [2022-02-20 20:09:06,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {3813#(<= ~j~0 6)} [167] L697-->L699: Formula: (= (+ v_~j~0_3 1) v_~i~0_3) InVars {~j~0=v_~j~0_3} OutVars{~i~0=v_~i~0_3, ~j~0=v_~j~0_3} AuxVars[] AssignedVars[~i~0] {3814#(and (<= ~j~0 6) (<= ~i~0 46))} is VALID [2022-02-20 20:09:06,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {3814#(and (<= ~j~0 6) (<= ~i~0 46))} [130] L713-3-->L713-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {3814#(and (<= ~j~0 6) (<= ~i~0 46))} is VALID [2022-02-20 20:09:06,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {3814#(and (<= ~j~0 6) (<= ~i~0 46))} [123] L713-4-->L714: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {3814#(and (<= ~j~0 6) (<= ~i~0 46))} is VALID [2022-02-20 20:09:06,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {3814#(and (<= ~j~0 6) (<= ~i~0 46))} [98] L714-->L714-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {3814#(and (<= ~j~0 6) (<= ~i~0 46))} is VALID [2022-02-20 20:09:06,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {3814#(and (<= ~j~0 6) (<= ~i~0 46))} [122] L714-1-->L714-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {3814#(and (<= ~j~0 6) (<= ~i~0 46))} is VALID [2022-02-20 20:09:06,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {3814#(and (<= ~j~0 6) (<= ~i~0 46))} [109] L714-2-->L714-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3|) |v_ULTIMATE.start_main_~#id2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {3814#(and (<= ~j~0 6) (<= ~i~0 46))} is VALID [2022-02-20 20:09:06,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {3814#(and (<= ~j~0 6) (<= ~i~0 46))} [186] L714-3-->t2ENTRY: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_4| 0) (= |v_t2Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_t2Thread1of1ForFork1_thidvar0_2) (= v_t2Thread1of1ForFork1_thidvar1_2 0) (= v_t2Thread1of1ForFork1_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_4|, t2Thread1of1ForFork1_thidvar1=v_t2Thread1of1ForFork1_thidvar1_2, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_4, t2Thread1of1ForFork1_thidvar0=v_t2Thread1of1ForFork1_thidvar0_2, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_8|, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_4, t2Thread1of1ForFork1_#res.base=|v_t2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_4|, t2Thread1of1ForFork1_#res.offset=|v_t2Thread1of1ForFork1_#res.offset_4|, t2Thread1of1ForFork1_thidvar2=v_t2Thread1of1ForFork1_thidvar2_2, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#in~arg.base, t2Thread1of1ForFork1_thidvar1, t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_thidvar0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_#res.base, t2Thread1of1ForFork1_#in~arg.offset, t2Thread1of1ForFork1_#res.offset, t2Thread1of1ForFork1_thidvar2, t2Thread1of1ForFork1_~k~1] {3814#(and (<= ~j~0 6) (<= ~i~0 46))} is VALID [2022-02-20 20:09:06,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {3814#(and (<= ~j~0 6) (<= ~i~0 46))} [132] L714-4-->L714-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] {3814#(and (<= ~j~0 6) (<= ~i~0 46))} is VALID [2022-02-20 20:09:06,517 INFO L290 TraceCheckUtils]: 34: Hoare triple {3814#(and (<= ~j~0 6) (<= ~i~0 46))} [126] L714-5-->L715: 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] {3814#(and (<= ~j~0 6) (<= ~i~0 46))} is VALID [2022-02-20 20:09:06,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {3814#(and (<= ~j~0 6) (<= ~i~0 46))} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (< 46 v_~i~0_2) 1 0)) InVars {~i~0=v_~i~0_2} OutVars{~i~0=v_~i~0_2, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condI~0#1] {3815#(and (<= ~j~0 6) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:06,518 INFO L290 TraceCheckUtils]: 36: Hoare triple {3815#(and (<= ~j~0 6) (= |ULTIMATE.start_main_~condI~0#1| 0))} [114] L717-->L720: Formula: (= (ite (< 46 v_~j~0_2) 1 0) |v_ULTIMATE.start_main_~condJ~0#1_2|) InVars {~j~0=v_~j~0_2} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_2|, ~j~0=v_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0#1] {3816#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:06,518 INFO L290 TraceCheckUtils]: 37: Hoare triple {3816#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} [127] L720-->L722: Formula: (or (not (= |v_ULTIMATE.start_main_~condJ~0#1_3| 0)) (not (= |v_ULTIMATE.start_main_~condI~0#1_3| 0))) InVars {ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} AuxVars[] AssignedVars[] {3812#false} is VALID [2022-02-20 20:09:06,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {3812#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3812#false} is VALID [2022-02-20 20:09:06,519 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:09:06,519 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:09:06,519 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523347728] [2022-02-20 20:09:06,520 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523347728] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:09:06,520 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:09:06,520 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:09:06,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135149156] [2022-02-20 20:09:06,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:09:06,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 39 [2022-02-20 20:09:06,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:09:06,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:09:06,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:09:06,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:09:06,549 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:09:06,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:09:06,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:09:06,550 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:09:06,551 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 85 transitions, 276 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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:09:06,551 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:09:06,551 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:09:06,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:09:06,709 INFO L129 PetriNetUnfolder]: 46/217 cut-off events. [2022-02-20 20:09:06,710 INFO L130 PetriNetUnfolder]: For 109/112 co-relation queries the response was YES. [2022-02-20 20:09:06,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 217 events. 46/217 cut-off events. For 109/112 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 853 event pairs, 0 based on Foata normal form. 3/204 useless extension candidates. Maximal degree in co-relation 376. Up to 35 conditions per place. [2022-02-20 20:09:06,713 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 16 selfloop transitions, 9 changer transitions 40/110 dead transitions. [2022-02-20 20:09:06,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 110 transitions, 508 flow [2022-02-20 20:09:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:09:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-02-20 20:09:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 475 transitions. [2022-02-20 20:09:06,717 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8482142857142857 [2022-02-20 20:09:06,717 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 475 transitions. [2022-02-20 20:09:06,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 475 transitions. [2022-02-20 20:09:06,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:09:06,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 475 transitions. [2022-02-20 20:09:06,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 59.375) internal successors, (475), 8 states have internal predecessors, (475), 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:09:06,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 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:09:06,720 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 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:09:06,720 INFO L186 Difference]: Start difference. First operand has 85 places, 85 transitions, 276 flow. Second operand 8 states and 475 transitions. [2022-02-20 20:09:06,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 110 transitions, 508 flow [2022-02-20 20:09:06,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 110 transitions, 508 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-02-20 20:09:06,755 INFO L242 Difference]: Finished difference. Result has 96 places, 67 transitions, 237 flow [2022-02-20 20:09:06,755 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=237, PETRI_PLACES=96, PETRI_TRANSITIONS=67} [2022-02-20 20:09:06,756 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 26 predicate places. [2022-02-20 20:09:06,756 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 67 transitions, 237 flow [2022-02-20 20:09:06,789 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1429 states, 1424 states have (on average 2.717696629213483) internal successors, (3870), 1428 states have internal predecessors, (3870), 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:09:06,793 INFO L78 Accepts]: Start accepts. Automaton has has 1429 states, 1424 states have (on average 2.717696629213483) internal successors, (3870), 1428 states have internal predecessors, (3870), 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 39 [2022-02-20 20:09:06,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:09:06,794 INFO L470 AbstractCegarLoop]: Abstraction has has 96 places, 67 transitions, 237 flow [2022-02-20 20:09:06,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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:09:06,794 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:09:06,794 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] [2022-02-20 20:09:06,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:09:06,795 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:09:06,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:09:06,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1444168350, now seen corresponding path program 1 times [2022-02-20 20:09:06,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:09:06,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74640159] [2022-02-20 20:09:06,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:09:06,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:09:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:09:06,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {5258#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5258#true} is VALID [2022-02-20 20:09:06,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {5258#true} [136] 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] {5258#true} is VALID [2022-02-20 20:09:06,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {5258#true} [152] 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[] {5258#true} is VALID [2022-02-20 20:09:06,875 INFO L290 TraceCheckUtils]: 3: Hoare triple {5258#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {5258#true} is VALID [2022-02-20 20:09:06,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {5258#true} [147] L693-->L693-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[] {5258#true} is VALID [2022-02-20 20:09:06,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {5258#true} [94] L693-1-->L693-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[] {5258#true} is VALID [2022-02-20 20:09:06,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {5258#true} [150] L693-2-->L693-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[] {5258#true} is VALID [2022-02-20 20:09:06,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {5258#true} [137] L693-3-->L693-4: Formula: (and (= 23 (select |v_#length_2| 2)) (= (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[] {5258#true} is VALID [2022-02-20 20:09:06,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {5258#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {5260#(<= ~i~0 3)} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {5260#(<= ~i~0 3)} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,878 INFO L290 TraceCheckUtils]: 11: Hoare triple {5260#(<= ~i~0 3)} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {5260#(<= ~i~0 3)} [108] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {5260#(<= ~i~0 3)} [140] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {5260#(<= ~i~0 3)} [100] L-1-7-->L711: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_1|, ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#id2~0#1.offset, ULTIMATE.start_main_~condJ~0#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~condI~0#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#id2~0#1.base] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,880 INFO L290 TraceCheckUtils]: 15: Hoare triple {5260#(<= ~i~0 3)} [138] L711-->L711-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,880 INFO L290 TraceCheckUtils]: 16: Hoare triple {5260#(<= ~i~0 3)} [139] L711-1-->L712: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,880 INFO L290 TraceCheckUtils]: 17: Hoare triple {5260#(<= ~i~0 3)} [157] L712-->L712-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id1~0#1.base_2|)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 1)) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#id1~0#1.offset_2| 0)) 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_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,881 INFO L290 TraceCheckUtils]: 18: Hoare triple {5260#(<= ~i~0 3)} [96] L712-1-->L712-2: Formula: (and (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id2~0#1.base_2|)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id2~0#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#id2~0#1.base] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {5260#(<= ~i~0 3)} [151] L712-2-->L713: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {5260#(<= ~i~0 3)} [131] L713-->L713-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {5260#(<= ~i~0 3)} [104] L713-1-->L713-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3|) |v_ULTIMATE.start_main_~#id1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {5260#(<= ~i~0 3)} [184] L713-2-->t1ENTRY: Formula: (and (= v_t1Thread1of1ForFork0_thidvar1_2 0) (= |v_t1Thread1of1ForFork0_#in~arg.base_4| 0) (= |v_t1Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_t1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, t1Thread1of1ForFork0_thidvar1=v_t1Thread1of1ForFork0_thidvar1_2, t1Thread1of1ForFork0_thidvar0=v_t1Thread1of1ForFork0_thidvar0_2, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_8|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_4, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_4|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_4, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_12, t1Thread1of1ForFork0_#res.base=|v_t1Thread1of1ForFork0_#res.base_4|, t1Thread1of1ForFork0_#res.offset=|v_t1Thread1of1ForFork0_#res.offset_4|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_thidvar1, t1Thread1of1ForFork0_thidvar0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_#in~arg.base, t1Thread1of1ForFork0_~arg.offset, t1Thread1of1ForFork0_~k~0, t1Thread1of1ForFork0_#res.base, t1Thread1of1ForFork0_#res.offset, t1Thread1of1ForFork0_#in~arg.offset] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {5260#(<= ~i~0 3)} [130] L713-3-->L713-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {5260#(<= ~i~0 3)} [123] L713-4-->L714: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {5260#(<= ~i~0 3)} [98] L714-->L714-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {5260#(<= ~i~0 3)} [122] L714-1-->L714-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {5260#(<= ~i~0 3)} [109] L714-2-->L714-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3|) |v_ULTIMATE.start_main_~#id2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {5260#(<= ~i~0 3)} [186] L714-3-->t2ENTRY: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_4| 0) (= |v_t2Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_t2Thread1of1ForFork1_thidvar0_2) (= v_t2Thread1of1ForFork1_thidvar1_2 0) (= v_t2Thread1of1ForFork1_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_4|, t2Thread1of1ForFork1_thidvar1=v_t2Thread1of1ForFork1_thidvar1_2, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_4, t2Thread1of1ForFork1_thidvar0=v_t2Thread1of1ForFork1_thidvar0_2, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_8|, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_4, t2Thread1of1ForFork1_#res.base=|v_t2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_4|, t2Thread1of1ForFork1_#res.offset=|v_t2Thread1of1ForFork1_#res.offset_4|, t2Thread1of1ForFork1_thidvar2=v_t2Thread1of1ForFork1_thidvar2_2, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#in~arg.base, t2Thread1of1ForFork1_thidvar1, t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_thidvar0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_#res.base, t2Thread1of1ForFork1_#in~arg.offset, t2Thread1of1ForFork1_#res.offset, t2Thread1of1ForFork1_thidvar2, t2Thread1of1ForFork1_~k~1] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {5260#(<= ~i~0 3)} [132] L714-4-->L714-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] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {5260#(<= ~i~0 3)} [126] L714-5-->L715: 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] {5260#(<= ~i~0 3)} is VALID [2022-02-20 20:09:06,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {5260#(<= ~i~0 3)} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (< 46 v_~i~0_2) 1 0)) InVars {~i~0=v_~i~0_2} OutVars{~i~0=v_~i~0_2, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condI~0#1] {5261#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 3))} is VALID [2022-02-20 20:09:06,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {5261#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 3))} [172] t2ENTRY-->L704: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_1| v_t2Thread1of1ForFork1_~arg.base_1) (= |v_t2Thread1of1ForFork1_#in~arg.offset_1| v_t2Thread1of1ForFork1_~arg.offset_1)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_1, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_~arg.offset] {5261#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 3))} is VALID [2022-02-20 20:09:06,888 INFO L290 TraceCheckUtils]: 33: Hoare triple {5261#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 3))} [173] L704-->L704-5: Formula: (= v_t2Thread1of1ForFork1_~k~1_1 0) InVars {} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~k~1] {5261#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 3))} is VALID [2022-02-20 20:09:06,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {5261#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 3))} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 20) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {5261#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 3))} is VALID [2022-02-20 20:09:06,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {5261#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 3))} [178] L705-->L707: Formula: (= (+ v_~i~0_4 1) v_~j~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~j~0=v_~j~0_4} AuxVars[] AssignedVars[~j~0] {5262#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~j~0 46))} is VALID [2022-02-20 20:09:06,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {5262#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~j~0 46))} [114] L717-->L720: Formula: (= (ite (< 46 v_~j~0_2) 1 0) |v_ULTIMATE.start_main_~condJ~0#1_2|) InVars {~j~0=v_~j~0_2} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_2|, ~j~0=v_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0#1] {5263#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:06,890 INFO L290 TraceCheckUtils]: 37: Hoare triple {5263#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} [127] L720-->L722: Formula: (or (not (= |v_ULTIMATE.start_main_~condJ~0#1_3| 0)) (not (= |v_ULTIMATE.start_main_~condI~0#1_3| 0))) InVars {ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} AuxVars[] AssignedVars[] {5259#false} is VALID [2022-02-20 20:09:06,890 INFO L290 TraceCheckUtils]: 38: Hoare triple {5259#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5259#false} is VALID [2022-02-20 20:09:06,890 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:09:06,890 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:09:06,891 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74640159] [2022-02-20 20:09:06,891 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74640159] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:09:06,891 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:09:06,891 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:09:06,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651307883] [2022-02-20 20:09:06,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:09:06,892 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 39 [2022-02-20 20:09:06,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:09:06,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:09:06,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:09:06,922 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:09:06,922 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:09:06,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:09:06,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:09:06,925 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:09:06,925 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 67 transitions, 237 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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:09:06,925 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:09:06,925 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:09:06,926 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:09:07,068 INFO L129 PetriNetUnfolder]: 37/196 cut-off events. [2022-02-20 20:09:07,068 INFO L130 PetriNetUnfolder]: For 258/265 co-relation queries the response was YES. [2022-02-20 20:09:07,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 196 events. 37/196 cut-off events. For 258/265 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 652 event pairs, 0 based on Foata normal form. 10/188 useless extension candidates. Maximal degree in co-relation 362. Up to 35 conditions per place. [2022-02-20 20:09:07,070 INFO L132 encePairwiseOnDemand]: 64/70 looper letters, 23 selfloop transitions, 11 changer transitions 8/87 dead transitions. [2022-02-20 20:09:07,070 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 87 transitions, 457 flow [2022-02-20 20:09:07,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:09:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:09:07,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 530 transitions. [2022-02-20 20:09:07,074 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8412698412698413 [2022-02-20 20:09:07,075 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 530 transitions. [2022-02-20 20:09:07,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 530 transitions. [2022-02-20 20:09:07,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:09:07,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 530 transitions. [2022-02-20 20:09:07,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 58.888888888888886) internal successors, (530), 9 states have internal predecessors, (530), 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:09:07,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 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:09:07,077 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 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:09:07,078 INFO L186 Difference]: Start difference. First operand has 96 places, 67 transitions, 237 flow. Second operand 9 states and 530 transitions. [2022-02-20 20:09:07,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 87 transitions, 457 flow [2022-02-20 20:09:07,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 87 transitions, 387 flow, removed 25 selfloop flow, removed 9 redundant places. [2022-02-20 20:09:07,109 INFO L242 Difference]: Finished difference. Result has 86 places, 72 transitions, 289 flow [2022-02-20 20:09:07,110 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=289, PETRI_PLACES=86, PETRI_TRANSITIONS=72} [2022-02-20 20:09:07,111 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 16 predicate places. [2022-02-20 20:09:07,111 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 72 transitions, 289 flow [2022-02-20 20:09:07,155 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1909 states, 1900 states have (on average 2.668421052631579) internal successors, (5070), 1908 states have internal predecessors, (5070), 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:09:07,159 INFO L78 Accepts]: Start accepts. Automaton has has 1909 states, 1900 states have (on average 2.668421052631579) internal successors, (5070), 1908 states have internal predecessors, (5070), 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 39 [2022-02-20 20:09:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:09:07,159 INFO L470 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 289 flow [2022-02-20 20:09:07,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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:09:07,160 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:09:07,160 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] [2022-02-20 20:09:07,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:09:07,160 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:09:07,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:09:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1245653052, now seen corresponding path program 2 times [2022-02-20 20:09:07,161 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:09:07,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822982566] [2022-02-20 20:09:07,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:09:07,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:09:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:09:07,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {7188#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7188#true} is VALID [2022-02-20 20:09:07,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {7188#true} [136] 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] {7188#true} is VALID [2022-02-20 20:09:07,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {7188#true} [152] 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[] {7188#true} is VALID [2022-02-20 20:09:07,272 INFO L290 TraceCheckUtils]: 3: Hoare triple {7188#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {7188#true} is VALID [2022-02-20 20:09:07,272 INFO L290 TraceCheckUtils]: 4: Hoare triple {7188#true} [147] L693-->L693-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[] {7188#true} is VALID [2022-02-20 20:09:07,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {7188#true} [94] L693-1-->L693-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[] {7188#true} is VALID [2022-02-20 20:09:07,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {7188#true} [150] L693-2-->L693-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[] {7188#true} is VALID [2022-02-20 20:09:07,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {7188#true} [137] L693-3-->L693-4: Formula: (and (= 23 (select |v_#length_2| 2)) (= (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[] {7188#true} is VALID [2022-02-20 20:09:07,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {7188#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {7190#(<= ~i~0 3)} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {7190#(<= ~i~0 3)} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {7190#(<= ~i~0 3)} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {7190#(<= ~i~0 3)} [108] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {7190#(<= ~i~0 3)} [140] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {7190#(<= ~i~0 3)} [100] L-1-7-->L711: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_1|, ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#id2~0#1.offset, ULTIMATE.start_main_~condJ~0#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~condI~0#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#id2~0#1.base] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {7190#(<= ~i~0 3)} [138] L711-->L711-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {7190#(<= ~i~0 3)} [139] L711-1-->L712: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {7190#(<= ~i~0 3)} [157] L712-->L712-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id1~0#1.base_2|)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 1)) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#id1~0#1.offset_2| 0)) 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_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {7190#(<= ~i~0 3)} [96] L712-1-->L712-2: Formula: (and (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id2~0#1.base_2|)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id2~0#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#id2~0#1.base] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {7190#(<= ~i~0 3)} [151] L712-2-->L713: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {7190#(<= ~i~0 3)} [131] L713-->L713-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {7190#(<= ~i~0 3)} [104] L713-1-->L713-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3|) |v_ULTIMATE.start_main_~#id1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {7190#(<= ~i~0 3)} [184] L713-2-->t1ENTRY: Formula: (and (= v_t1Thread1of1ForFork0_thidvar1_2 0) (= |v_t1Thread1of1ForFork0_#in~arg.base_4| 0) (= |v_t1Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_t1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, t1Thread1of1ForFork0_thidvar1=v_t1Thread1of1ForFork0_thidvar1_2, t1Thread1of1ForFork0_thidvar0=v_t1Thread1of1ForFork0_thidvar0_2, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_8|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_4, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_4|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_4, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_12, t1Thread1of1ForFork0_#res.base=|v_t1Thread1of1ForFork0_#res.base_4|, t1Thread1of1ForFork0_#res.offset=|v_t1Thread1of1ForFork0_#res.offset_4|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_thidvar1, t1Thread1of1ForFork0_thidvar0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_#in~arg.base, t1Thread1of1ForFork0_~arg.offset, t1Thread1of1ForFork0_~k~0, t1Thread1of1ForFork0_#res.base, t1Thread1of1ForFork0_#res.offset, t1Thread1of1ForFork0_#in~arg.offset] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {7190#(<= ~i~0 3)} [130] L713-3-->L713-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {7190#(<= ~i~0 3)} [123] L713-4-->L714: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,285 INFO L290 TraceCheckUtils]: 25: Hoare triple {7190#(<= ~i~0 3)} [98] L714-->L714-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {7190#(<= ~i~0 3)} [122] L714-1-->L714-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {7190#(<= ~i~0 3)} [109] L714-2-->L714-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3|) |v_ULTIMATE.start_main_~#id2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,286 INFO L290 TraceCheckUtils]: 28: Hoare triple {7190#(<= ~i~0 3)} [186] L714-3-->t2ENTRY: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_4| 0) (= |v_t2Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_t2Thread1of1ForFork1_thidvar0_2) (= v_t2Thread1of1ForFork1_thidvar1_2 0) (= v_t2Thread1of1ForFork1_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_4|, t2Thread1of1ForFork1_thidvar1=v_t2Thread1of1ForFork1_thidvar1_2, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_4, t2Thread1of1ForFork1_thidvar0=v_t2Thread1of1ForFork1_thidvar0_2, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_8|, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_4, t2Thread1of1ForFork1_#res.base=|v_t2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_4|, t2Thread1of1ForFork1_#res.offset=|v_t2Thread1of1ForFork1_#res.offset_4|, t2Thread1of1ForFork1_thidvar2=v_t2Thread1of1ForFork1_thidvar2_2, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#in~arg.base, t2Thread1of1ForFork1_thidvar1, t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_thidvar0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_#res.base, t2Thread1of1ForFork1_#in~arg.offset, t2Thread1of1ForFork1_#res.offset, t2Thread1of1ForFork1_thidvar2, t2Thread1of1ForFork1_~k~1] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,287 INFO L290 TraceCheckUtils]: 29: Hoare triple {7190#(<= ~i~0 3)} [172] t2ENTRY-->L704: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_1| v_t2Thread1of1ForFork1_~arg.base_1) (= |v_t2Thread1of1ForFork1_#in~arg.offset_1| v_t2Thread1of1ForFork1_~arg.offset_1)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_1, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_~arg.offset] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,287 INFO L290 TraceCheckUtils]: 30: Hoare triple {7190#(<= ~i~0 3)} [173] L704-->L704-5: Formula: (= v_t2Thread1of1ForFork1_~k~1_1 0) InVars {} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~k~1] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {7190#(<= ~i~0 3)} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 20) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {7190#(<= ~i~0 3)} is VALID [2022-02-20 20:09:07,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {7190#(<= ~i~0 3)} [178] L705-->L707: Formula: (= (+ v_~i~0_4 1) v_~j~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~j~0=v_~j~0_4} AuxVars[] AssignedVars[~j~0] {7191#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:07,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {7191#(and (<= ~i~0 46) (<= ~j~0 46))} [132] L714-4-->L714-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] {7191#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:07,289 INFO L290 TraceCheckUtils]: 34: Hoare triple {7191#(and (<= ~i~0 46) (<= ~j~0 46))} [126] L714-5-->L715: 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] {7191#(and (<= ~i~0 46) (<= ~j~0 46))} is VALID [2022-02-20 20:09:07,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {7191#(and (<= ~i~0 46) (<= ~j~0 46))} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (< 46 v_~i~0_2) 1 0)) InVars {~i~0=v_~i~0_2} OutVars{~i~0=v_~i~0_2, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condI~0#1] {7192#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~j~0 46))} is VALID [2022-02-20 20:09:07,290 INFO L290 TraceCheckUtils]: 36: Hoare triple {7192#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~j~0 46))} [114] L717-->L720: Formula: (= (ite (< 46 v_~j~0_2) 1 0) |v_ULTIMATE.start_main_~condJ~0#1_2|) InVars {~j~0=v_~j~0_2} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_2|, ~j~0=v_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0#1] {7193#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:07,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {7193#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} [127] L720-->L722: Formula: (or (not (= |v_ULTIMATE.start_main_~condJ~0#1_3| 0)) (not (= |v_ULTIMATE.start_main_~condI~0#1_3| 0))) InVars {ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} AuxVars[] AssignedVars[] {7189#false} is VALID [2022-02-20 20:09:07,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {7189#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7189#false} is VALID [2022-02-20 20:09:07,290 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:09:07,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:09:07,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822982566] [2022-02-20 20:09:07,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822982566] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:09:07,291 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:09:07,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:09:07,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578806547] [2022-02-20 20:09:07,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:09:07,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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 39 [2022-02-20 20:09:07,293 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:09:07,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 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:09:07,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:09:07,315 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:09:07,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:09:07,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:09:07,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:09:07,320 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:09:07,320 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 72 transitions, 289 flow. Second operand has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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:09:07,320 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:09:07,320 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:09:07,320 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:09:07,463 INFO L129 PetriNetUnfolder]: 30/178 cut-off events. [2022-02-20 20:09:07,463 INFO L130 PetriNetUnfolder]: For 240/260 co-relation queries the response was YES. [2022-02-20 20:09:07,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 178 events. 30/178 cut-off events. For 240/260 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 568 event pairs, 0 based on Foata normal form. 16/178 useless extension candidates. Maximal degree in co-relation 366. Up to 32 conditions per place. [2022-02-20 20:09:07,464 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 19 selfloop transitions, 12 changer transitions 11/87 dead transitions. [2022-02-20 20:09:07,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 87 transitions, 487 flow [2022-02-20 20:09:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:09:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:09:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 524 transitions. [2022-02-20 20:09:07,469 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8317460317460318 [2022-02-20 20:09:07,469 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 524 transitions. [2022-02-20 20:09:07,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 524 transitions. [2022-02-20 20:09:07,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:09:07,469 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 524 transitions. [2022-02-20 20:09:07,470 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 58.22222222222222) internal successors, (524), 9 states have internal predecessors, (524), 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:09:07,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 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:09:07,472 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 70.0) internal successors, (700), 10 states have internal predecessors, (700), 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:09:07,472 INFO L186 Difference]: Start difference. First operand has 86 places, 72 transitions, 289 flow. Second operand 9 states and 524 transitions. [2022-02-20 20:09:07,472 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 87 transitions, 487 flow [2022-02-20 20:09:07,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 87 transitions, 467 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-02-20 20:09:07,495 INFO L242 Difference]: Finished difference. Result has 93 places, 73 transitions, 332 flow [2022-02-20 20:09:07,496 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=332, PETRI_PLACES=93, PETRI_TRANSITIONS=73} [2022-02-20 20:09:07,496 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 23 predicate places. [2022-02-20 20:09:07,496 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 73 transitions, 332 flow [2022-02-20 20:09:07,530 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1445 states, 1437 states have (on average 2.5984690327070283) internal successors, (3734), 1444 states have internal predecessors, (3734), 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:09:07,533 INFO L78 Accepts]: Start accepts. Automaton has has 1445 states, 1437 states have (on average 2.5984690327070283) internal successors, (3734), 1444 states have internal predecessors, (3734), 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 39 [2022-02-20 20:09:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:09:07,533 INFO L470 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 332 flow [2022-02-20 20:09:07,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 56.5) internal successors, (339), 6 states have internal predecessors, (339), 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:09:07,533 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:09:07,534 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] [2022-02-20 20:09:07,534 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:09:07,534 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:09:07,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:09:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash 704825237, now seen corresponding path program 1 times [2022-02-20 20:09:07,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:09:07,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523026773] [2022-02-20 20:09:07,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:09:07,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:09:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:09:07,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {8654#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8654#true} is VALID [2022-02-20 20:09:07,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {8654#true} [136] 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] {8654#true} is VALID [2022-02-20 20:09:07,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {8654#true} [152] 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[] {8654#true} is VALID [2022-02-20 20:09:07,617 INFO L290 TraceCheckUtils]: 3: Hoare triple {8654#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {8654#true} is VALID [2022-02-20 20:09:07,617 INFO L290 TraceCheckUtils]: 4: Hoare triple {8654#true} [147] L693-->L693-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[] {8654#true} is VALID [2022-02-20 20:09:07,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {8654#true} [94] L693-1-->L693-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[] {8654#true} is VALID [2022-02-20 20:09:07,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {8654#true} [150] L693-2-->L693-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[] {8654#true} is VALID [2022-02-20 20:09:07,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {8654#true} [137] L693-3-->L693-4: Formula: (and (= 23 (select |v_#length_2| 2)) (= (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[] {8654#true} is VALID [2022-02-20 20:09:07,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {8654#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {8654#true} is VALID [2022-02-20 20:09:07,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {8654#true} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,619 INFO L290 TraceCheckUtils]: 10: Hoare triple {8656#(<= ~j~0 6)} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {8656#(<= ~j~0 6)} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {8656#(<= ~j~0 6)} [108] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {8656#(<= ~j~0 6)} [140] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {8656#(<= ~j~0 6)} [100] L-1-7-->L711: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_1|, ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#id2~0#1.offset, ULTIMATE.start_main_~condJ~0#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~condI~0#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#id2~0#1.base] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {8656#(<= ~j~0 6)} [138] L711-->L711-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {8656#(<= ~j~0 6)} [139] L711-1-->L712: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {8656#(<= ~j~0 6)} [157] L712-->L712-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id1~0#1.base_2|)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 1)) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#id1~0#1.offset_2| 0)) 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_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {8656#(<= ~j~0 6)} [96] L712-1-->L712-2: Formula: (and (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id2~0#1.base_2|)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id2~0#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#id2~0#1.base] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {8656#(<= ~j~0 6)} [151] L712-2-->L713: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {8656#(<= ~j~0 6)} [131] L713-->L713-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {8656#(<= ~j~0 6)} [104] L713-1-->L713-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3|) |v_ULTIMATE.start_main_~#id1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {8656#(<= ~j~0 6)} [184] L713-2-->t1ENTRY: Formula: (and (= v_t1Thread1of1ForFork0_thidvar1_2 0) (= |v_t1Thread1of1ForFork0_#in~arg.base_4| 0) (= |v_t1Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_t1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, t1Thread1of1ForFork0_thidvar1=v_t1Thread1of1ForFork0_thidvar1_2, t1Thread1of1ForFork0_thidvar0=v_t1Thread1of1ForFork0_thidvar0_2, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_8|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_4, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_4|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_4, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_12, t1Thread1of1ForFork0_#res.base=|v_t1Thread1of1ForFork0_#res.base_4|, t1Thread1of1ForFork0_#res.offset=|v_t1Thread1of1ForFork0_#res.offset_4|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_thidvar1, t1Thread1of1ForFork0_thidvar0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_#in~arg.base, t1Thread1of1ForFork0_~arg.offset, t1Thread1of1ForFork0_~k~0, t1Thread1of1ForFork0_#res.base, t1Thread1of1ForFork0_#res.offset, t1Thread1of1ForFork0_#in~arg.offset] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {8656#(<= ~j~0 6)} [130] L713-3-->L713-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,623 INFO L290 TraceCheckUtils]: 24: Hoare triple {8656#(<= ~j~0 6)} [123] L713-4-->L714: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {8656#(<= ~j~0 6)} [98] L714-->L714-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {8656#(<= ~j~0 6)} [122] L714-1-->L714-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {8656#(<= ~j~0 6)} [109] L714-2-->L714-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3|) |v_ULTIMATE.start_main_~#id2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {8656#(<= ~j~0 6)} [161] t1ENTRY-->L696: Formula: (and (= |v_t1Thread1of1ForFork0_#in~arg.offset_1| v_t1Thread1of1ForFork0_~arg.offset_1) (= |v_t1Thread1of1ForFork0_#in~arg.base_1| v_t1Thread1of1ForFork0_~arg.base_1)) InVars {t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_1|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_1|} OutVars{t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_1|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_1, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_1|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_1} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_~arg.offset] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {8656#(<= ~j~0 6)} [162] L696-->L696-5: Formula: (= v_t1Thread1of1ForFork0_~k~0_1 0) InVars {} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_1} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~k~0] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {8656#(<= ~j~0 6)} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 20) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {8656#(<= ~j~0 6)} is VALID [2022-02-20 20:09:07,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {8656#(<= ~j~0 6)} [167] L697-->L699: Formula: (= (+ v_~j~0_3 1) v_~i~0_3) InVars {~j~0=v_~j~0_3} OutVars{~i~0=v_~i~0_3, ~j~0=v_~j~0_3} AuxVars[] AssignedVars[~i~0] {8657#(<= ~i~0 7)} is VALID [2022-02-20 20:09:07,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {8657#(<= ~i~0 7)} [186] L714-3-->t2ENTRY: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_4| 0) (= |v_t2Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_t2Thread1of1ForFork1_thidvar0_2) (= v_t2Thread1of1ForFork1_thidvar1_2 0) (= v_t2Thread1of1ForFork1_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_4|, t2Thread1of1ForFork1_thidvar1=v_t2Thread1of1ForFork1_thidvar1_2, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_4, t2Thread1of1ForFork1_thidvar0=v_t2Thread1of1ForFork1_thidvar0_2, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_8|, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_4, t2Thread1of1ForFork1_#res.base=|v_t2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_4|, t2Thread1of1ForFork1_#res.offset=|v_t2Thread1of1ForFork1_#res.offset_4|, t2Thread1of1ForFork1_thidvar2=v_t2Thread1of1ForFork1_thidvar2_2, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#in~arg.base, t2Thread1of1ForFork1_thidvar1, t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_thidvar0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_#res.base, t2Thread1of1ForFork1_#in~arg.offset, t2Thread1of1ForFork1_#res.offset, t2Thread1of1ForFork1_thidvar2, t2Thread1of1ForFork1_~k~1] {8657#(<= ~i~0 7)} is VALID [2022-02-20 20:09:07,629 INFO L290 TraceCheckUtils]: 33: Hoare triple {8657#(<= ~i~0 7)} [172] t2ENTRY-->L704: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_1| v_t2Thread1of1ForFork1_~arg.base_1) (= |v_t2Thread1of1ForFork1_#in~arg.offset_1| v_t2Thread1of1ForFork1_~arg.offset_1)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_1, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_~arg.offset] {8657#(<= ~i~0 7)} is VALID [2022-02-20 20:09:07,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {8657#(<= ~i~0 7)} [173] L704-->L704-5: Formula: (= v_t2Thread1of1ForFork1_~k~1_1 0) InVars {} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~k~1] {8657#(<= ~i~0 7)} is VALID [2022-02-20 20:09:07,629 INFO L290 TraceCheckUtils]: 35: Hoare triple {8657#(<= ~i~0 7)} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 20) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {8657#(<= ~i~0 7)} is VALID [2022-02-20 20:09:07,630 INFO L290 TraceCheckUtils]: 36: Hoare triple {8657#(<= ~i~0 7)} [132] L714-4-->L714-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] {8657#(<= ~i~0 7)} is VALID [2022-02-20 20:09:07,630 INFO L290 TraceCheckUtils]: 37: Hoare triple {8657#(<= ~i~0 7)} [126] L714-5-->L715: 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] {8657#(<= ~i~0 7)} is VALID [2022-02-20 20:09:07,630 INFO L290 TraceCheckUtils]: 38: Hoare triple {8657#(<= ~i~0 7)} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (< 46 v_~i~0_2) 1 0)) InVars {~i~0=v_~i~0_2} OutVars{~i~0=v_~i~0_2, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condI~0#1] {8658#(and (<= ~i~0 7) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:07,631 INFO L290 TraceCheckUtils]: 39: Hoare triple {8658#(and (<= ~i~0 7) (= |ULTIMATE.start_main_~condI~0#1| 0))} [178] L705-->L707: Formula: (= (+ v_~i~0_4 1) v_~j~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~j~0=v_~j~0_4} AuxVars[] AssignedVars[~j~0] {8659#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~j~0 46))} is VALID [2022-02-20 20:09:07,631 INFO L290 TraceCheckUtils]: 40: Hoare triple {8659#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~j~0 46))} [114] L717-->L720: Formula: (= (ite (< 46 v_~j~0_2) 1 0) |v_ULTIMATE.start_main_~condJ~0#1_2|) InVars {~j~0=v_~j~0_2} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_2|, ~j~0=v_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0#1] {8660#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:07,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {8660#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} [127] L720-->L722: Formula: (or (not (= |v_ULTIMATE.start_main_~condJ~0#1_3| 0)) (not (= |v_ULTIMATE.start_main_~condI~0#1_3| 0))) InVars {ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} AuxVars[] AssignedVars[] {8655#false} is VALID [2022-02-20 20:09:07,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {8655#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8655#false} is VALID [2022-02-20 20:09:07,632 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:09:07,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:09:07,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523026773] [2022-02-20 20:09:07,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523026773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:09:07,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:09:07,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:09:07,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614969659] [2022-02-20 20:09:07,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:09:07,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 43 [2022-02-20 20:09:07,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:09:07,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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:09:07,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:09:07,659 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:09:07,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:09:07,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:09:07,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:09:07,660 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:09:07,660 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 73 transitions, 332 flow. Second operand has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 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:09:07,660 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:09:07,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:09:07,661 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:09:07,821 INFO L129 PetriNetUnfolder]: 43/227 cut-off events. [2022-02-20 20:09:07,821 INFO L130 PetriNetUnfolder]: For 606/628 co-relation queries the response was YES. [2022-02-20 20:09:07,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 227 events. 43/227 cut-off events. For 606/628 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 801 event pairs, 1 based on Foata normal form. 15/221 useless extension candidates. Maximal degree in co-relation 528. Up to 50 conditions per place. [2022-02-20 20:09:07,823 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 23 selfloop transitions, 21 changer transitions 8/97 dead transitions. [2022-02-20 20:09:07,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 660 flow [2022-02-20 20:09:07,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:09:07,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-02-20 20:09:07,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 644 transitions. [2022-02-20 20:09:07,829 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8363636363636363 [2022-02-20 20:09:07,829 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 644 transitions. [2022-02-20 20:09:07,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 644 transitions. [2022-02-20 20:09:07,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:09:07,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 644 transitions. [2022-02-20 20:09:07,830 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 58.54545454545455) internal successors, (644), 11 states have internal predecessors, (644), 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:09:07,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 70.0) internal successors, (840), 12 states have internal predecessors, (840), 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:09:07,832 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 70.0) internal successors, (840), 12 states have internal predecessors, (840), 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:09:07,832 INFO L186 Difference]: Start difference. First operand has 93 places, 73 transitions, 332 flow. Second operand 11 states and 644 transitions. [2022-02-20 20:09:07,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 660 flow [2022-02-20 20:09:07,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 97 transitions, 544 flow, removed 45 selfloop flow, removed 10 redundant places. [2022-02-20 20:09:07,886 INFO L242 Difference]: Finished difference. Result has 97 places, 79 transitions, 417 flow [2022-02-20 20:09:07,886 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=417, PETRI_PLACES=97, PETRI_TRANSITIONS=79} [2022-02-20 20:09:07,887 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 27 predicate places. [2022-02-20 20:09:07,887 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 97 places, 79 transitions, 417 flow [2022-02-20 20:09:07,967 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2405 states, 2392 states have (on average 2.6312709030100336) internal successors, (6294), 2404 states have internal predecessors, (6294), 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:09:07,971 INFO L78 Accepts]: Start accepts. Automaton has has 2405 states, 2392 states have (on average 2.6312709030100336) internal successors, (6294), 2404 states have internal predecessors, (6294), 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 43 [2022-02-20 20:09:07,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:09:07,971 INFO L470 AbstractCegarLoop]: Abstraction has has 97 places, 79 transitions, 417 flow [2022-02-20 20:09:07,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 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:09:07,972 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:09:07,972 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] [2022-02-20 20:09:07,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:09:07,972 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:09:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:09:07,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1283973881, now seen corresponding path program 2 times [2022-02-20 20:09:07,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:09:07,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712605571] [2022-02-20 20:09:07,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:09:07,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:09:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:09:08,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {11085#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11085#true} is VALID [2022-02-20 20:09:08,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {11085#true} [136] 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] {11085#true} is VALID [2022-02-20 20:09:08,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {11085#true} [152] 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[] {11085#true} is VALID [2022-02-20 20:09:08,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {11085#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {11085#true} is VALID [2022-02-20 20:09:08,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {11085#true} [147] L693-->L693-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[] {11085#true} is VALID [2022-02-20 20:09:08,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {11085#true} [94] L693-1-->L693-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[] {11085#true} is VALID [2022-02-20 20:09:08,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {11085#true} [150] L693-2-->L693-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[] {11085#true} is VALID [2022-02-20 20:09:08,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {11085#true} [137] L693-3-->L693-4: Formula: (and (= 23 (select |v_#length_2| 2)) (= (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[] {11085#true} is VALID [2022-02-20 20:09:08,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {11085#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {11085#true} is VALID [2022-02-20 20:09:08,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {11085#true} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {11087#(<= ~j~0 6)} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {11087#(<= ~j~0 6)} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {11087#(<= ~j~0 6)} [108] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {11087#(<= ~j~0 6)} [140] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {11087#(<= ~j~0 6)} [100] L-1-7-->L711: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_1|, ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#id2~0#1.offset, ULTIMATE.start_main_~condJ~0#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~condI~0#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#id2~0#1.base] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {11087#(<= ~j~0 6)} [138] L711-->L711-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {11087#(<= ~j~0 6)} [139] L711-1-->L712: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {11087#(<= ~j~0 6)} [157] L712-->L712-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id1~0#1.base_2|)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 1)) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#id1~0#1.offset_2| 0)) 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_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {11087#(<= ~j~0 6)} [96] L712-1-->L712-2: Formula: (and (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id2~0#1.base_2|)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id2~0#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#id2~0#1.base] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {11087#(<= ~j~0 6)} [151] L712-2-->L713: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {11087#(<= ~j~0 6)} [131] L713-->L713-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {11087#(<= ~j~0 6)} [104] L713-1-->L713-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3|) |v_ULTIMATE.start_main_~#id1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {11087#(<= ~j~0 6)} [184] L713-2-->t1ENTRY: Formula: (and (= v_t1Thread1of1ForFork0_thidvar1_2 0) (= |v_t1Thread1of1ForFork0_#in~arg.base_4| 0) (= |v_t1Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_t1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, t1Thread1of1ForFork0_thidvar1=v_t1Thread1of1ForFork0_thidvar1_2, t1Thread1of1ForFork0_thidvar0=v_t1Thread1of1ForFork0_thidvar0_2, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_8|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_4, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_4|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_4, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_12, t1Thread1of1ForFork0_#res.base=|v_t1Thread1of1ForFork0_#res.base_4|, t1Thread1of1ForFork0_#res.offset=|v_t1Thread1of1ForFork0_#res.offset_4|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_thidvar1, t1Thread1of1ForFork0_thidvar0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_#in~arg.base, t1Thread1of1ForFork0_~arg.offset, t1Thread1of1ForFork0_~k~0, t1Thread1of1ForFork0_#res.base, t1Thread1of1ForFork0_#res.offset, t1Thread1of1ForFork0_#in~arg.offset] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {11087#(<= ~j~0 6)} [130] L713-3-->L713-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {11087#(<= ~j~0 6)} [123] L713-4-->L714: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {11087#(<= ~j~0 6)} [98] L714-->L714-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {11087#(<= ~j~0 6)} [122] L714-1-->L714-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {11087#(<= ~j~0 6)} [109] L714-2-->L714-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3|) |v_ULTIMATE.start_main_~#id2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {11087#(<= ~j~0 6)} [186] L714-3-->t2ENTRY: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_4| 0) (= |v_t2Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_t2Thread1of1ForFork1_thidvar0_2) (= v_t2Thread1of1ForFork1_thidvar1_2 0) (= v_t2Thread1of1ForFork1_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_4|, t2Thread1of1ForFork1_thidvar1=v_t2Thread1of1ForFork1_thidvar1_2, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_4, t2Thread1of1ForFork1_thidvar0=v_t2Thread1of1ForFork1_thidvar0_2, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_8|, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_4, t2Thread1of1ForFork1_#res.base=|v_t2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_4|, t2Thread1of1ForFork1_#res.offset=|v_t2Thread1of1ForFork1_#res.offset_4|, t2Thread1of1ForFork1_thidvar2=v_t2Thread1of1ForFork1_thidvar2_2, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#in~arg.base, t2Thread1of1ForFork1_thidvar1, t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_thidvar0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_#res.base, t2Thread1of1ForFork1_#in~arg.offset, t2Thread1of1ForFork1_#res.offset, t2Thread1of1ForFork1_thidvar2, t2Thread1of1ForFork1_~k~1] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {11087#(<= ~j~0 6)} [161] t1ENTRY-->L696: Formula: (and (= |v_t1Thread1of1ForFork0_#in~arg.offset_1| v_t1Thread1of1ForFork0_~arg.offset_1) (= |v_t1Thread1of1ForFork0_#in~arg.base_1| v_t1Thread1of1ForFork0_~arg.base_1)) InVars {t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_1|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_1|} OutVars{t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_1|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_1, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_1|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_1} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_~arg.offset] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {11087#(<= ~j~0 6)} [162] L696-->L696-5: Formula: (= v_t1Thread1of1ForFork0_~k~0_1 0) InVars {} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_1} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~k~0] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {11087#(<= ~j~0 6)} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 20) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {11087#(<= ~j~0 6)} is VALID [2022-02-20 20:09:08,066 INFO L290 TraceCheckUtils]: 32: Hoare triple {11087#(<= ~j~0 6)} [167] L697-->L699: Formula: (= (+ v_~j~0_3 1) v_~i~0_3) InVars {~j~0=v_~j~0_3} OutVars{~i~0=v_~i~0_3, ~j~0=v_~j~0_3} AuxVars[] AssignedVars[~i~0] {11088#(<= ~i~0 7)} is VALID [2022-02-20 20:09:08,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {11088#(<= ~i~0 7)} [172] t2ENTRY-->L704: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_1| v_t2Thread1of1ForFork1_~arg.base_1) (= |v_t2Thread1of1ForFork1_#in~arg.offset_1| v_t2Thread1of1ForFork1_~arg.offset_1)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_1, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_~arg.offset] {11088#(<= ~i~0 7)} is VALID [2022-02-20 20:09:08,067 INFO L290 TraceCheckUtils]: 34: Hoare triple {11088#(<= ~i~0 7)} [173] L704-->L704-5: Formula: (= v_t2Thread1of1ForFork1_~k~1_1 0) InVars {} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~k~1] {11088#(<= ~i~0 7)} is VALID [2022-02-20 20:09:08,067 INFO L290 TraceCheckUtils]: 35: Hoare triple {11088#(<= ~i~0 7)} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 20) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {11088#(<= ~i~0 7)} is VALID [2022-02-20 20:09:08,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {11088#(<= ~i~0 7)} [178] L705-->L707: Formula: (= (+ v_~i~0_4 1) v_~j~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~j~0=v_~j~0_4} AuxVars[] AssignedVars[~j~0] {11089#(and (<= ~j~0 8) (<= ~i~0 46))} is VALID [2022-02-20 20:09:08,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {11089#(and (<= ~j~0 8) (<= ~i~0 46))} [132] L714-4-->L714-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] {11089#(and (<= ~j~0 8) (<= ~i~0 46))} is VALID [2022-02-20 20:09:08,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {11089#(and (<= ~j~0 8) (<= ~i~0 46))} [126] L714-5-->L715: 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] {11089#(and (<= ~j~0 8) (<= ~i~0 46))} is VALID [2022-02-20 20:09:08,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {11089#(and (<= ~j~0 8) (<= ~i~0 46))} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (< 46 v_~i~0_2) 1 0)) InVars {~i~0=v_~i~0_2} OutVars{~i~0=v_~i~0_2, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condI~0#1] {11090#(and (<= ~j~0 8) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:08,069 INFO L290 TraceCheckUtils]: 40: Hoare triple {11090#(and (<= ~j~0 8) (= |ULTIMATE.start_main_~condI~0#1| 0))} [114] L717-->L720: Formula: (= (ite (< 46 v_~j~0_2) 1 0) |v_ULTIMATE.start_main_~condJ~0#1_2|) InVars {~j~0=v_~j~0_2} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_2|, ~j~0=v_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0#1] {11091#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:08,070 INFO L290 TraceCheckUtils]: 41: Hoare triple {11091#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} [127] L720-->L722: Formula: (or (not (= |v_ULTIMATE.start_main_~condJ~0#1_3| 0)) (not (= |v_ULTIMATE.start_main_~condI~0#1_3| 0))) InVars {ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} AuxVars[] AssignedVars[] {11086#false} is VALID [2022-02-20 20:09:08,070 INFO L290 TraceCheckUtils]: 42: Hoare triple {11086#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11086#false} is VALID [2022-02-20 20:09:08,070 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:09:08,071 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:09:08,071 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712605571] [2022-02-20 20:09:08,071 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712605571] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:09:08,071 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:09:08,071 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:09:08,071 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037717458] [2022-02-20 20:09:08,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:09:08,072 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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 43 [2022-02-20 20:09:08,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:09:08,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 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:09:08,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:09:08,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:09:08,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:09:08,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:09:08,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:09:08,094 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:09:08,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 79 transitions, 417 flow. Second operand has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 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:09:08,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:09:08,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:09:08,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:09:08,492 INFO L129 PetriNetUnfolder]: 38/219 cut-off events. [2022-02-20 20:09:08,493 INFO L130 PetriNetUnfolder]: For 824/869 co-relation queries the response was YES. [2022-02-20 20:09:08,493 INFO L84 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 219 events. 38/219 cut-off events. For 824/869 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 799 event pairs, 1 based on Foata normal form. 25/223 useless extension candidates. Maximal degree in co-relation 579. Up to 46 conditions per place. [2022-02-20 20:09:08,494 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 21 selfloop transitions, 23 changer transitions 11/100 dead transitions. [2022-02-20 20:09:08,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 100 transitions, 791 flow [2022-02-20 20:09:08,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 20:09:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-02-20 20:09:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 696 transitions. [2022-02-20 20:09:08,500 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2022-02-20 20:09:08,500 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 696 transitions. [2022-02-20 20:09:08,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 696 transitions. [2022-02-20 20:09:08,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:09:08,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 696 transitions. [2022-02-20 20:09:08,502 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:09:08,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 70.0) internal successors, (910), 13 states have internal predecessors, (910), 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:09:08,504 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 70.0) internal successors, (910), 13 states have internal predecessors, (910), 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:09:08,504 INFO L186 Difference]: Start difference. First operand has 97 places, 79 transitions, 417 flow. Second operand 12 states and 696 transitions. [2022-02-20 20:09:08,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 100 transitions, 791 flow [2022-02-20 20:09:10,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 100 transitions, 733 flow, removed 20 selfloop flow, removed 5 redundant places. [2022-02-20 20:09:10,324 INFO L242 Difference]: Finished difference. Result has 106 places, 82 transitions, 505 flow [2022-02-20 20:09:10,325 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=505, PETRI_PLACES=106, PETRI_TRANSITIONS=82} [2022-02-20 20:09:10,325 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 36 predicate places. [2022-02-20 20:09:10,325 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 82 transitions, 505 flow [2022-02-20 20:09:10,384 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2085 states, 2073 states have (on average 2.603955619874578) internal successors, (5398), 2084 states have internal predecessors, (5398), 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:09:10,388 INFO L78 Accepts]: Start accepts. Automaton has has 2085 states, 2073 states have (on average 2.603955619874578) internal successors, (5398), 2084 states have internal predecessors, (5398), 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 43 [2022-02-20 20:09:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:09:10,388 INFO L470 AbstractCegarLoop]: Abstraction has has 106 places, 82 transitions, 505 flow [2022-02-20 20:09:10,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.42857142857143) internal successors, (395), 7 states have internal predecessors, (395), 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:09:10,388 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:09:10,389 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:10,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:09:10,389 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:09:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:09:10,389 INFO L85 PathProgramCache]: Analyzing trace with hash 827405232, now seen corresponding path program 1 times [2022-02-20 20:09:10,390 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:09:10,390 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601132563] [2022-02-20 20:09:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:09:10,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:09:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:09:10,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {13199#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13199#true} is VALID [2022-02-20 20:09:10,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {13199#true} [136] 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] {13199#true} is VALID [2022-02-20 20:09:10,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {13199#true} [152] 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[] {13199#true} is VALID [2022-02-20 20:09:10,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {13199#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {13199#true} is VALID [2022-02-20 20:09:10,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {13199#true} [147] L693-->L693-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[] {13199#true} is VALID [2022-02-20 20:09:10,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {13199#true} [94] L693-1-->L693-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[] {13199#true} is VALID [2022-02-20 20:09:10,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {13199#true} [150] L693-2-->L693-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[] {13199#true} is VALID [2022-02-20 20:09:10,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {13199#true} [137] L693-3-->L693-4: Formula: (and (= 23 (select |v_#length_2| 2)) (= (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[] {13199#true} is VALID [2022-02-20 20:09:10,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {13199#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {13201#(<= ~i~0 3)} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {13201#(<= ~i~0 3)} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {13201#(<= ~i~0 3)} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {13201#(<= ~i~0 3)} [108] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {13201#(<= ~i~0 3)} [140] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {13201#(<= ~i~0 3)} [100] L-1-7-->L711: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_1|, ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#id2~0#1.offset, ULTIMATE.start_main_~condJ~0#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~condI~0#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#id2~0#1.base] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {13201#(<= ~i~0 3)} [138] L711-->L711-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,491 INFO L290 TraceCheckUtils]: 16: Hoare triple {13201#(<= ~i~0 3)} [139] L711-1-->L712: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,493 INFO L290 TraceCheckUtils]: 17: Hoare triple {13201#(<= ~i~0 3)} [157] L712-->L712-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id1~0#1.base_2|)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 1)) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#id1~0#1.offset_2| 0)) 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_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,493 INFO L290 TraceCheckUtils]: 18: Hoare triple {13201#(<= ~i~0 3)} [96] L712-1-->L712-2: Formula: (and (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id2~0#1.base_2|)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id2~0#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#id2~0#1.base] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {13201#(<= ~i~0 3)} [151] L712-2-->L713: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {13201#(<= ~i~0 3)} [131] L713-->L713-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {13201#(<= ~i~0 3)} [104] L713-1-->L713-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3|) |v_ULTIMATE.start_main_~#id1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,495 INFO L290 TraceCheckUtils]: 22: Hoare triple {13201#(<= ~i~0 3)} [184] L713-2-->t1ENTRY: Formula: (and (= v_t1Thread1of1ForFork0_thidvar1_2 0) (= |v_t1Thread1of1ForFork0_#in~arg.base_4| 0) (= |v_t1Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_t1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, t1Thread1of1ForFork0_thidvar1=v_t1Thread1of1ForFork0_thidvar1_2, t1Thread1of1ForFork0_thidvar0=v_t1Thread1of1ForFork0_thidvar0_2, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_8|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_4, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_4|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_4, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_12, t1Thread1of1ForFork0_#res.base=|v_t1Thread1of1ForFork0_#res.base_4|, t1Thread1of1ForFork0_#res.offset=|v_t1Thread1of1ForFork0_#res.offset_4|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_thidvar1, t1Thread1of1ForFork0_thidvar0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_#in~arg.base, t1Thread1of1ForFork0_~arg.offset, t1Thread1of1ForFork0_~k~0, t1Thread1of1ForFork0_#res.base, t1Thread1of1ForFork0_#res.offset, t1Thread1of1ForFork0_#in~arg.offset] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {13201#(<= ~i~0 3)} [130] L713-3-->L713-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {13201#(<= ~i~0 3)} [123] L713-4-->L714: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {13201#(<= ~i~0 3)} [98] L714-->L714-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {13201#(<= ~i~0 3)} [122] L714-1-->L714-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,496 INFO L290 TraceCheckUtils]: 27: Hoare triple {13201#(<= ~i~0 3)} [109] L714-2-->L714-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3|) |v_ULTIMATE.start_main_~#id2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,496 INFO L290 TraceCheckUtils]: 28: Hoare triple {13201#(<= ~i~0 3)} [186] L714-3-->t2ENTRY: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_4| 0) (= |v_t2Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_t2Thread1of1ForFork1_thidvar0_2) (= v_t2Thread1of1ForFork1_thidvar1_2 0) (= v_t2Thread1of1ForFork1_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_4|, t2Thread1of1ForFork1_thidvar1=v_t2Thread1of1ForFork1_thidvar1_2, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_4, t2Thread1of1ForFork1_thidvar0=v_t2Thread1of1ForFork1_thidvar0_2, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_8|, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_4, t2Thread1of1ForFork1_#res.base=|v_t2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_4|, t2Thread1of1ForFork1_#res.offset=|v_t2Thread1of1ForFork1_#res.offset_4|, t2Thread1of1ForFork1_thidvar2=v_t2Thread1of1ForFork1_thidvar2_2, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#in~arg.base, t2Thread1of1ForFork1_thidvar1, t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_thidvar0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_#res.base, t2Thread1of1ForFork1_#in~arg.offset, t2Thread1of1ForFork1_#res.offset, t2Thread1of1ForFork1_thidvar2, t2Thread1of1ForFork1_~k~1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {13201#(<= ~i~0 3)} [172] t2ENTRY-->L704: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_1| v_t2Thread1of1ForFork1_~arg.base_1) (= |v_t2Thread1of1ForFork1_#in~arg.offset_1| v_t2Thread1of1ForFork1_~arg.offset_1)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_1, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_~arg.offset] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {13201#(<= ~i~0 3)} [173] L704-->L704-5: Formula: (= v_t2Thread1of1ForFork1_~k~1_1 0) InVars {} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~k~1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,497 INFO L290 TraceCheckUtils]: 31: Hoare triple {13201#(<= ~i~0 3)} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 20) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {13201#(<= ~i~0 3)} [132] L714-4-->L714-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] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {13201#(<= ~i~0 3)} [126] L714-5-->L715: 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] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,499 INFO L290 TraceCheckUtils]: 34: Hoare triple {13201#(<= ~i~0 3)} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (< 46 v_~i~0_2) 1 0)) InVars {~i~0=v_~i~0_2} OutVars{~i~0=v_~i~0_2, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condI~0#1] {13202#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 3))} is VALID [2022-02-20 20:09:10,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {13202#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 3))} [178] L705-->L707: Formula: (= (+ v_~i~0_4 1) v_~j~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~j~0=v_~j~0_4} AuxVars[] AssignedVars[~j~0] {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} [161] t1ENTRY-->L696: Formula: (and (= |v_t1Thread1of1ForFork0_#in~arg.offset_1| v_t1Thread1of1ForFork0_~arg.offset_1) (= |v_t1Thread1of1ForFork0_#in~arg.base_1| v_t1Thread1of1ForFork0_~arg.base_1)) InVars {t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_1|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_1|} OutVars{t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_1|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_1, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_1|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_1} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_~arg.offset] {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} [162] L696-->L696-5: Formula: (= v_t1Thread1of1ForFork0_~k~0_1 0) InVars {} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_1} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~k~0] {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 20) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,501 INFO L290 TraceCheckUtils]: 39: Hoare triple {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} [167] L697-->L699: Formula: (= (+ v_~j~0_3 1) v_~i~0_3) InVars {~j~0=v_~j~0_3} OutVars{~i~0=v_~i~0_3, ~j~0=v_~j~0_3} AuxVars[] AssignedVars[~i~0] {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,501 INFO L290 TraceCheckUtils]: 40: Hoare triple {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} [180] L707-->L704-3: Formula: (= |v_t2Thread1of1ForFork1_#t~post4_1| v_t2Thread1of1ForFork1_~k~1_7) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_7} OutVars{t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_1|, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_7} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~post4] {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,502 INFO L290 TraceCheckUtils]: 41: Hoare triple {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} [181] L704-3-->L704-4: Formula: (= (+ |v_t2Thread1of1ForFork1_#t~post4_3| 1) v_t2Thread1of1ForFork1_~k~1_9) InVars {t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_3|} OutVars{t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_3|, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_9} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~k~1] {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,503 INFO L290 TraceCheckUtils]: 42: Hoare triple {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} [182] L704-4-->L704-5: Formula: true InVars {} OutVars{t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_5|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~post4] {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,503 INFO L290 TraceCheckUtils]: 43: Hoare triple {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 20) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,504 INFO L290 TraceCheckUtils]: 44: Hoare triple {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} [178] L705-->L707: Formula: (= (+ v_~i~0_4 1) v_~j~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~j~0=v_~j~0_4} AuxVars[] AssignedVars[~j~0] {13205#(and (<= ~j~0 6) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,504 INFO L290 TraceCheckUtils]: 45: Hoare triple {13205#(and (<= ~j~0 6) (= |ULTIMATE.start_main_~condI~0#1| 0))} [114] L717-->L720: Formula: (= (ite (< 46 v_~j~0_2) 1 0) |v_ULTIMATE.start_main_~condJ~0#1_2|) InVars {~j~0=v_~j~0_2} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_2|, ~j~0=v_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0#1] {13206#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,504 INFO L290 TraceCheckUtils]: 46: Hoare triple {13206#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} [127] L720-->L722: Formula: (or (not (= |v_ULTIMATE.start_main_~condJ~0#1_3| 0)) (not (= |v_ULTIMATE.start_main_~condI~0#1_3| 0))) InVars {ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} AuxVars[] AssignedVars[] {13200#false} is VALID [2022-02-20 20:09:10,505 INFO L290 TraceCheckUtils]: 47: Hoare triple {13200#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13200#false} is VALID [2022-02-20 20:09:10,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:09:10,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:09:10,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601132563] [2022-02-20 20:09:10,507 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601132563] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 20:09:10,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456590369] [2022-02-20 20:09:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:09:10,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 20:09:10,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:09:10,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 20:09:10,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 20:09:10,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:09:10,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 20:09:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:09:10,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 20:09:10,858 INFO L290 TraceCheckUtils]: 0: Hoare triple {13199#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13199#true} is VALID [2022-02-20 20:09:10,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {13199#true} [136] 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] {13199#true} is VALID [2022-02-20 20:09:10,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {13199#true} [152] 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[] {13199#true} is VALID [2022-02-20 20:09:10,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {13199#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {13199#true} is VALID [2022-02-20 20:09:10,859 INFO L290 TraceCheckUtils]: 4: Hoare triple {13199#true} [147] L693-->L693-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[] {13199#true} is VALID [2022-02-20 20:09:10,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {13199#true} [94] L693-1-->L693-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[] {13199#true} is VALID [2022-02-20 20:09:10,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {13199#true} [150] L693-2-->L693-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[] {13199#true} is VALID [2022-02-20 20:09:10,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {13199#true} [137] L693-3-->L693-4: Formula: (and (= 23 (select |v_#length_2| 2)) (= (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[] {13199#true} is VALID [2022-02-20 20:09:10,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {13199#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {13201#(<= ~i~0 3)} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {13201#(<= ~i~0 3)} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {13201#(<= ~i~0 3)} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {13201#(<= ~i~0 3)} [108] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {13201#(<= ~i~0 3)} [140] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {13201#(<= ~i~0 3)} [100] L-1-7-->L711: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_1|, ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#id2~0#1.offset, ULTIMATE.start_main_~condJ~0#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~condI~0#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#id2~0#1.base] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {13201#(<= ~i~0 3)} [138] L711-->L711-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {13201#(<= ~i~0 3)} [139] L711-1-->L712: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {13201#(<= ~i~0 3)} [157] L712-->L712-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id1~0#1.base_2|)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 1)) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#id1~0#1.offset_2| 0)) 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_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {13201#(<= ~i~0 3)} [96] L712-1-->L712-2: Formula: (and (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id2~0#1.base_2|)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id2~0#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#id2~0#1.base] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {13201#(<= ~i~0 3)} [151] L712-2-->L713: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {13201#(<= ~i~0 3)} [131] L713-->L713-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {13201#(<= ~i~0 3)} [104] L713-1-->L713-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3|) |v_ULTIMATE.start_main_~#id1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {13201#(<= ~i~0 3)} [184] L713-2-->t1ENTRY: Formula: (and (= v_t1Thread1of1ForFork0_thidvar1_2 0) (= |v_t1Thread1of1ForFork0_#in~arg.base_4| 0) (= |v_t1Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_t1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, t1Thread1of1ForFork0_thidvar1=v_t1Thread1of1ForFork0_thidvar1_2, t1Thread1of1ForFork0_thidvar0=v_t1Thread1of1ForFork0_thidvar0_2, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_8|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_4, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_4|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_4, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_12, t1Thread1of1ForFork0_#res.base=|v_t1Thread1of1ForFork0_#res.base_4|, t1Thread1of1ForFork0_#res.offset=|v_t1Thread1of1ForFork0_#res.offset_4|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_thidvar1, t1Thread1of1ForFork0_thidvar0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_#in~arg.base, t1Thread1of1ForFork0_~arg.offset, t1Thread1of1ForFork0_~k~0, t1Thread1of1ForFork0_#res.base, t1Thread1of1ForFork0_#res.offset, t1Thread1of1ForFork0_#in~arg.offset] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {13201#(<= ~i~0 3)} [130] L713-3-->L713-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {13201#(<= ~i~0 3)} [123] L713-4-->L714: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {13201#(<= ~i~0 3)} [98] L714-->L714-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {13201#(<= ~i~0 3)} [122] L714-1-->L714-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {13201#(<= ~i~0 3)} [109] L714-2-->L714-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3|) |v_ULTIMATE.start_main_~#id2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {13201#(<= ~i~0 3)} [186] L714-3-->t2ENTRY: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_4| 0) (= |v_t2Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_t2Thread1of1ForFork1_thidvar0_2) (= v_t2Thread1of1ForFork1_thidvar1_2 0) (= v_t2Thread1of1ForFork1_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_4|, t2Thread1of1ForFork1_thidvar1=v_t2Thread1of1ForFork1_thidvar1_2, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_4, t2Thread1of1ForFork1_thidvar0=v_t2Thread1of1ForFork1_thidvar0_2, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_8|, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_4, t2Thread1of1ForFork1_#res.base=|v_t2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_4|, t2Thread1of1ForFork1_#res.offset=|v_t2Thread1of1ForFork1_#res.offset_4|, t2Thread1of1ForFork1_thidvar2=v_t2Thread1of1ForFork1_thidvar2_2, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#in~arg.base, t2Thread1of1ForFork1_thidvar1, t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_thidvar0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_#res.base, t2Thread1of1ForFork1_#in~arg.offset, t2Thread1of1ForFork1_#res.offset, t2Thread1of1ForFork1_thidvar2, t2Thread1of1ForFork1_~k~1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {13201#(<= ~i~0 3)} [172] t2ENTRY-->L704: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_1| v_t2Thread1of1ForFork1_~arg.base_1) (= |v_t2Thread1of1ForFork1_#in~arg.offset_1| v_t2Thread1of1ForFork1_~arg.offset_1)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_1, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_~arg.offset] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {13201#(<= ~i~0 3)} [173] L704-->L704-5: Formula: (= v_t2Thread1of1ForFork1_~k~1_1 0) InVars {} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~k~1] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {13201#(<= ~i~0 3)} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 20) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {13201#(<= ~i~0 3)} [132] L714-4-->L714-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] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {13201#(<= ~i~0 3)} [126] L714-5-->L715: 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] {13201#(<= ~i~0 3)} is VALID [2022-02-20 20:09:10,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {13201#(<= ~i~0 3)} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (< 46 v_~i~0_2) 1 0)) InVars {~i~0=v_~i~0_2} OutVars{~i~0=v_~i~0_2, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condI~0#1] {13202#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 3))} is VALID [2022-02-20 20:09:10,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {13202#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 3))} [178] L705-->L707: Formula: (= (+ v_~i~0_4 1) v_~j~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~j~0=v_~j~0_4} AuxVars[] AssignedVars[~j~0] {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} [161] t1ENTRY-->L696: Formula: (and (= |v_t1Thread1of1ForFork0_#in~arg.offset_1| v_t1Thread1of1ForFork0_~arg.offset_1) (= |v_t1Thread1of1ForFork0_#in~arg.base_1| v_t1Thread1of1ForFork0_~arg.base_1)) InVars {t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_1|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_1|} OutVars{t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_1|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_1, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_1|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_1} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_~arg.offset] {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} [162] L696-->L696-5: Formula: (= v_t1Thread1of1ForFork0_~k~0_1 0) InVars {} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_1} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~k~0] {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 20) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {13203#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} [167] L697-->L699: Formula: (= (+ v_~j~0_3 1) v_~i~0_3) InVars {~j~0=v_~j~0_3} OutVars{~i~0=v_~i~0_3, ~j~0=v_~j~0_3} AuxVars[] AssignedVars[~i~0] {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} [180] L707-->L704-3: Formula: (= |v_t2Thread1of1ForFork1_#t~post4_1| v_t2Thread1of1ForFork1_~k~1_7) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_7} OutVars{t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_1|, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_7} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~post4] {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} [181] L704-3-->L704-4: Formula: (= (+ |v_t2Thread1of1ForFork1_#t~post4_3| 1) v_t2Thread1of1ForFork1_~k~1_9) InVars {t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_3|} OutVars{t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_3|, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_9} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~k~1] {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} [182] L704-4-->L704-5: Formula: true InVars {} OutVars{t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_5|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~post4] {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,872 INFO L290 TraceCheckUtils]: 43: Hoare triple {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 20) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {13204#(and (<= ~i~0 5) (= |ULTIMATE.start_main_~condI~0#1| 0))} [178] L705-->L707: Formula: (= (+ v_~i~0_4 1) v_~j~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~j~0=v_~j~0_4} AuxVars[] AssignedVars[~j~0] {13205#(and (<= ~j~0 6) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {13205#(and (<= ~j~0 6) (= |ULTIMATE.start_main_~condI~0#1| 0))} [114] L717-->L720: Formula: (= (ite (< 46 v_~j~0_2) 1 0) |v_ULTIMATE.start_main_~condJ~0#1_2|) InVars {~j~0=v_~j~0_2} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_2|, ~j~0=v_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0#1] {13206#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:10,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {13206#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} [127] L720-->L722: Formula: (or (not (= |v_ULTIMATE.start_main_~condJ~0#1_3| 0)) (not (= |v_ULTIMATE.start_main_~condI~0#1_3| 0))) InVars {ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} AuxVars[] AssignedVars[] {13200#false} is VALID [2022-02-20 20:09:10,874 INFO L290 TraceCheckUtils]: 47: Hoare triple {13200#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13200#false} is VALID [2022-02-20 20:09:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:09:10,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 20:09:11,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {13200#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13200#false} is VALID [2022-02-20 20:09:11,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {13206#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} [127] L720-->L722: Formula: (or (not (= |v_ULTIMATE.start_main_~condJ~0#1_3| 0)) (not (= |v_ULTIMATE.start_main_~condI~0#1_3| 0))) InVars {ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_3|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_3|} AuxVars[] AssignedVars[] {13200#false} is VALID [2022-02-20 20:09:11,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {13357#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (not (< 46 ~j~0)))} [114] L717-->L720: Formula: (= (ite (< 46 v_~j~0_2) 1 0) |v_ULTIMATE.start_main_~condJ~0#1_2|) InVars {~j~0=v_~j~0_2} OutVars{ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_2|, ~j~0=v_~j~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~condJ~0#1] {13206#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:11,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {13361#(and (<= ~i~0 45) (= |ULTIMATE.start_main_~condI~0#1| 0))} [178] L705-->L707: Formula: (= (+ v_~i~0_4 1) v_~j~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~j~0=v_~j~0_4} AuxVars[] AssignedVars[~j~0] {13357#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (not (< 46 ~j~0)))} is VALID [2022-02-20 20:09:11,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {13361#(and (<= ~i~0 45) (= |ULTIMATE.start_main_~condI~0#1| 0))} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 20) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {13361#(and (<= ~i~0 45) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:11,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {13361#(and (<= ~i~0 45) (= |ULTIMATE.start_main_~condI~0#1| 0))} [182] L704-4-->L704-5: Formula: true InVars {} OutVars{t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_5|} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~post4] {13361#(and (<= ~i~0 45) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:11,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {13361#(and (<= ~i~0 45) (= |ULTIMATE.start_main_~condI~0#1| 0))} [181] L704-3-->L704-4: Formula: (= (+ |v_t2Thread1of1ForFork1_#t~post4_3| 1) v_t2Thread1of1ForFork1_~k~1_9) InVars {t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_3|} OutVars{t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_3|, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_9} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~k~1] {13361#(and (<= ~i~0 45) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:11,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {13361#(and (<= ~i~0 45) (= |ULTIMATE.start_main_~condI~0#1| 0))} [180] L707-->L704-3: Formula: (= |v_t2Thread1of1ForFork1_#t~post4_1| v_t2Thread1of1ForFork1_~k~1_7) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_7} OutVars{t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_1|, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_7} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#t~post4] {13361#(and (<= ~i~0 45) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:11,222 INFO L290 TraceCheckUtils]: 39: Hoare triple {13377#(and (<= ~j~0 44) (= |ULTIMATE.start_main_~condI~0#1| 0))} [167] L697-->L699: Formula: (= (+ v_~j~0_3 1) v_~i~0_3) InVars {~j~0=v_~j~0_3} OutVars{~i~0=v_~i~0_3, ~j~0=v_~j~0_3} AuxVars[] AssignedVars[~i~0] {13361#(and (<= ~i~0 45) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:11,222 INFO L290 TraceCheckUtils]: 38: Hoare triple {13377#(and (<= ~j~0 44) (= |ULTIMATE.start_main_~condI~0#1| 0))} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 20) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {13377#(and (<= ~j~0 44) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:11,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {13377#(and (<= ~j~0 44) (= |ULTIMATE.start_main_~condI~0#1| 0))} [162] L696-->L696-5: Formula: (= v_t1Thread1of1ForFork0_~k~0_1 0) InVars {} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_1} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~k~0] {13377#(and (<= ~j~0 44) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:11,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {13377#(and (<= ~j~0 44) (= |ULTIMATE.start_main_~condI~0#1| 0))} [161] t1ENTRY-->L696: Formula: (and (= |v_t1Thread1of1ForFork0_#in~arg.offset_1| v_t1Thread1of1ForFork0_~arg.offset_1) (= |v_t1Thread1of1ForFork0_#in~arg.base_1| v_t1Thread1of1ForFork0_~arg.base_1)) InVars {t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_1|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_1|} OutVars{t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_1|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_1, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_1|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_1} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_~arg.offset] {13377#(and (<= ~j~0 44) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:11,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {13390#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 43))} [178] L705-->L707: Formula: (= (+ v_~i~0_4 1) v_~j~0_4) InVars {~i~0=v_~i~0_4} OutVars{~i~0=v_~i~0_4, ~j~0=v_~j~0_4} AuxVars[] AssignedVars[~j~0] {13377#(and (<= ~j~0 44) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:11,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {13394#(<= ~i~0 43)} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (< 46 v_~i~0_2) 1 0)) InVars {~i~0=v_~i~0_2} OutVars{~i~0=v_~i~0_2, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~condI~0#1] {13390#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (<= ~i~0 43))} is VALID [2022-02-20 20:09:11,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {13394#(<= ~i~0 43)} [126] L714-5-->L715: 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] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {13394#(<= ~i~0 43)} [132] L714-4-->L714-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] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {13394#(<= ~i~0 43)} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 20) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {13394#(<= ~i~0 43)} [173] L704-->L704-5: Formula: (= v_t2Thread1of1ForFork1_~k~1_1 0) InVars {} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~k~1] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {13394#(<= ~i~0 43)} [172] t2ENTRY-->L704: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_1| v_t2Thread1of1ForFork1_~arg.base_1) (= |v_t2Thread1of1ForFork1_#in~arg.offset_1| v_t2Thread1of1ForFork1_~arg.offset_1)) InVars {t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_1|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_1|, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_1, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_1} AuxVars[] AssignedVars[t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_~arg.offset] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {13394#(<= ~i~0 43)} [186] L714-3-->t2ENTRY: Formula: (and (= |v_t2Thread1of1ForFork1_#in~arg.base_4| 0) (= |v_t2Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre7#1_6| v_t2Thread1of1ForFork1_thidvar0_2) (= v_t2Thread1of1ForFork1_thidvar1_2 0) (= v_t2Thread1of1ForFork1_thidvar2_2 0)) InVars {ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|} OutVars{t2Thread1of1ForFork1_#in~arg.base=|v_t2Thread1of1ForFork1_#in~arg.base_4|, t2Thread1of1ForFork1_thidvar1=v_t2Thread1of1ForFork1_thidvar1_2, t2Thread1of1ForFork1_~arg.base=v_t2Thread1of1ForFork1_~arg.base_4, t2Thread1of1ForFork1_thidvar0=v_t2Thread1of1ForFork1_thidvar0_2, t2Thread1of1ForFork1_#t~post4=|v_t2Thread1of1ForFork1_#t~post4_8|, t2Thread1of1ForFork1_~arg.offset=v_t2Thread1of1ForFork1_~arg.offset_4, t2Thread1of1ForFork1_#res.base=|v_t2Thread1of1ForFork1_#res.base_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_6|, t2Thread1of1ForFork1_#in~arg.offset=|v_t2Thread1of1ForFork1_#in~arg.offset_4|, t2Thread1of1ForFork1_#res.offset=|v_t2Thread1of1ForFork1_#res.offset_4|, t2Thread1of1ForFork1_thidvar2=v_t2Thread1of1ForFork1_thidvar2_2, t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_12} AuxVars[] AssignedVars[t2Thread1of1ForFork1_#in~arg.base, t2Thread1of1ForFork1_thidvar1, t2Thread1of1ForFork1_~arg.base, t2Thread1of1ForFork1_thidvar0, t2Thread1of1ForFork1_#t~post4, t2Thread1of1ForFork1_~arg.offset, t2Thread1of1ForFork1_#res.base, t2Thread1of1ForFork1_#in~arg.offset, t2Thread1of1ForFork1_#res.offset, t2Thread1of1ForFork1_thidvar2, t2Thread1of1ForFork1_~k~1] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,226 INFO L290 TraceCheckUtils]: 27: Hoare triple {13394#(<= ~i~0 43)} [109] L714-2-->L714-3: Formula: (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#id2~0#1.base_3|) |v_ULTIMATE.start_main_~#id2~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre7#1_3|)) |v_#memory_int_5|) InVars {#memory_int=|v_#memory_int_6|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} OutVars{#memory_int=|v_#memory_int_5|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_3|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_3|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,226 INFO L290 TraceCheckUtils]: 26: Hoare triple {13394#(<= ~i~0 43)} [122] L714-1-->L714-2: Formula: (= (+ 1 |v_#pthreadsForks_6|) |v_#pthreadsForks_5|) InVars {#pthreadsForks=|v_#pthreadsForks_6|} OutVars{#pthreadsForks=|v_#pthreadsForks_5|} AuxVars[] AssignedVars[#pthreadsForks] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {13394#(<= ~i~0 43)} [98] L714-->L714-1: Formula: (= |v_ULTIMATE.start_main_#t~pre7#1_2| |v_#pthreadsForks_4|) InVars {#pthreadsForks=|v_#pthreadsForks_4|} OutVars{#pthreadsForks=|v_#pthreadsForks_4|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre7#1] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {13394#(<= ~i~0 43)} [123] L713-4-->L714: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {13394#(<= ~i~0 43)} [130] L713-3-->L713-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {13394#(<= ~i~0 43)} [184] L713-2-->t1ENTRY: Formula: (and (= v_t1Thread1of1ForFork0_thidvar1_2 0) (= |v_t1Thread1of1ForFork0_#in~arg.base_4| 0) (= |v_t1Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_ULTIMATE.start_main_#t~pre5#1_6| v_t1Thread1of1ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_6|, t1Thread1of1ForFork0_thidvar1=v_t1Thread1of1ForFork0_thidvar1_2, t1Thread1of1ForFork0_thidvar0=v_t1Thread1of1ForFork0_thidvar0_2, t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_8|, t1Thread1of1ForFork0_~arg.base=v_t1Thread1of1ForFork0_~arg.base_4, t1Thread1of1ForFork0_#in~arg.base=|v_t1Thread1of1ForFork0_#in~arg.base_4|, t1Thread1of1ForFork0_~arg.offset=v_t1Thread1of1ForFork0_~arg.offset_4, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_12, t1Thread1of1ForFork0_#res.base=|v_t1Thread1of1ForFork0_#res.base_4|, t1Thread1of1ForFork0_#res.offset=|v_t1Thread1of1ForFork0_#res.offset_4|, t1Thread1of1ForFork0_#in~arg.offset=|v_t1Thread1of1ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_thidvar1, t1Thread1of1ForFork0_thidvar0, t1Thread1of1ForFork0_#t~post3, t1Thread1of1ForFork0_~arg.base, t1Thread1of1ForFork0_#in~arg.base, t1Thread1of1ForFork0_~arg.offset, t1Thread1of1ForFork0_~k~0, t1Thread1of1ForFork0_#res.base, t1Thread1of1ForFork0_#res.offset, t1Thread1of1ForFork0_#in~arg.offset] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,228 INFO L290 TraceCheckUtils]: 21: Hoare triple {13394#(<= ~i~0 43)} [104] L713-1-->L713-2: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#id1~0#1.base_3|) |v_ULTIMATE.start_main_~#id1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre5#1_3|)) |v_#memory_int_3|) InVars {ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_3|, #memory_int=|v_#memory_int_3|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_3|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_3|} AuxVars[] AssignedVars[#memory_int] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,228 INFO L290 TraceCheckUtils]: 20: Hoare triple {13394#(<= ~i~0 43)} [131] L713-->L713-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {13394#(<= ~i~0 43)} [151] L712-2-->L713: Formula: (= |v_ULTIMATE.start_main_#t~pre5#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_2|, #pthreadsForks=|v_#pthreadsForks_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre5#1] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {13394#(<= ~i~0 43)} [96] L712-1-->L712-2: Formula: (and (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) 0) (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#id2~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id2~0#1.base_2|)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id2~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id2~0#1.offset_2| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_2|, #valid=|v_#valid_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#id2~0#1.base] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {13394#(<= ~i~0 43)} [157] L712-->L712-1: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) (not (= 0 |v_ULTIMATE.start_main_~#id1~0#1.base_2|)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 1)) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#id1~0#1.base_2| 4)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#id1~0#1.base_2|) 0) (= |v_ULTIMATE.start_main_~#id1~0#1.offset_2| 0)) 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_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_2|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {13394#(<= ~i~0 43)} [139] L711-1-->L712: Formula: (and (= |v_ULTIMATE.start_main_~argv#1.offset_2| |v_ULTIMATE.start_main_#in~argv#1.offset_2|) (= |v_ULTIMATE.start_main_#in~argv#1.base_2| |v_ULTIMATE.start_main_~argv#1.base_2|)) InVars {ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|} OutVars{ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_2|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_2|, ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_2|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_~argv#1.offset] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {13394#(<= ~i~0 43)} [138] L711-->L711-1: Formula: (= |v_ULTIMATE.start_main_#in~argc#1_2| |v_ULTIMATE.start_main_~argc#1_2|) InVars {ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_2|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {13394#(<= ~i~0 43)} [100] L-1-7-->L711: Formula: true InVars {} OutVars{ULTIMATE.start_main_~argc#1=|v_ULTIMATE.start_main_~argc#1_1|, ULTIMATE.start_main_~#id2~0#1.offset=|v_ULTIMATE.start_main_~#id2~0#1.offset_1|, ULTIMATE.start_main_~condJ~0#1=|v_ULTIMATE.start_main_~condJ~0#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_~condI~0#1=|v_ULTIMATE.start_main_~condI~0#1_1|, ULTIMATE.start_main_~argv#1.offset=|v_ULTIMATE.start_main_~argv#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.offset=|v_ULTIMATE.start_main_~#id1~0#1.offset_1|, ULTIMATE.start_main_~#id1~0#1.base=|v_ULTIMATE.start_main_~#id1~0#1.base_1|, ULTIMATE.start_main_#t~pre5#1=|v_ULTIMATE.start_main_#t~pre5#1_1|, ULTIMATE.start_main_~argv#1.base=|v_ULTIMATE.start_main_~argv#1.base_1|, ULTIMATE.start_main_#t~nondet8#1=|v_ULTIMATE.start_main_#t~nondet8#1_1|, ULTIMATE.start_main_#t~pre7#1=|v_ULTIMATE.start_main_#t~pre7#1_1|, ULTIMATE.start_main_~#id2~0#1.base=|v_ULTIMATE.start_main_~#id2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~argc#1, ULTIMATE.start_main_~#id2~0#1.offset, ULTIMATE.start_main_~condJ~0#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_~condI~0#1, ULTIMATE.start_main_~argv#1.offset, ULTIMATE.start_main_~#id1~0#1.offset, ULTIMATE.start_main_~#id1~0#1.base, ULTIMATE.start_main_#t~pre5#1, ULTIMATE.start_main_~argv#1.base, ULTIMATE.start_main_#t~nondet8#1, ULTIMATE.start_main_#t~pre7#1, ULTIMATE.start_main_~#id2~0#1.base] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {13394#(<= ~i~0 43)} [140] L-1-6-->L-1-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {13394#(<= ~i~0 43)} [108] L-1-5-->L-1-6: Formula: (and (= |v_ULTIMATE.start_#in~argv#1.offset_1| |v_ULTIMATE.start_main_#in~argv#1.offset_1|) (= |v_ULTIMATE.start_main_#in~argv#1.base_1| |v_ULTIMATE.start_#in~argv#1.base_1|) (= |v_ULTIMATE.start_main_#in~argc#1_1| |v_ULTIMATE.start_#in~argc#1_1|)) InVars {ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} OutVars{ULTIMATE.start_main_#in~argv#1.base=|v_ULTIMATE.start_main_#in~argv#1.base_1|, ULTIMATE.start_#in~argc#1=|v_ULTIMATE.start_#in~argc#1_1|, ULTIMATE.start_main_#in~argc#1=|v_ULTIMATE.start_main_#in~argc#1_1|, ULTIMATE.start_main_#in~argv#1.offset=|v_ULTIMATE.start_main_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.offset=|v_ULTIMATE.start_#in~argv#1.offset_1|, ULTIMATE.start_#in~argv#1.base=|v_ULTIMATE.start_#in~argv#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#in~argv#1.base, ULTIMATE.start_main_#in~argc#1, ULTIMATE.start_main_#in~argv#1.offset] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,232 INFO L290 TraceCheckUtils]: 11: Hoare triple {13394#(<= ~i~0 43)} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {13394#(<= ~i~0 43)} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {13394#(<= ~i~0 43)} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {13199#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {13394#(<= ~i~0 43)} is VALID [2022-02-20 20:09:11,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {13199#true} [137] L693-3-->L693-4: Formula: (and (= 23 (select |v_#length_2| 2)) (= (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[] {13199#true} is VALID [2022-02-20 20:09:11,235 INFO L290 TraceCheckUtils]: 6: Hoare triple {13199#true} [150] L693-2-->L693-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[] {13199#true} is VALID [2022-02-20 20:09:11,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {13199#true} [94] L693-1-->L693-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[] {13199#true} is VALID [2022-02-20 20:09:11,236 INFO L290 TraceCheckUtils]: 4: Hoare triple {13199#true} [147] L693-->L693-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[] {13199#true} is VALID [2022-02-20 20:09:11,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {13199#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {13199#true} is VALID [2022-02-20 20:09:11,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {13199#true} [152] 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[] {13199#true} is VALID [2022-02-20 20:09:11,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {13199#true} [136] 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] {13199#true} is VALID [2022-02-20 20:09:11,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {13199#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13199#true} is VALID [2022-02-20 20:09:11,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:09:11,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456590369] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 20:09:11,237 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 20:09:11,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2022-02-20 20:09:11,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468743767] [2022-02-20 20:09:11,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 20:09:11,239 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 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 48 [2022-02-20 20:09:11,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:09:11,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 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:09:11,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:09:11,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 20:09:11,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:09:11,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 20:09:11,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-02-20 20:09:11,283 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:09:11,284 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 82 transitions, 505 flow. Second operand has 13 states, 13 states have (on average 56.61538461538461) internal successors, (736), 13 states have internal predecessors, (736), 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:09:11,284 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:09:11,284 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:09:11,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:10:01,776 INFO L129 PetriNetUnfolder]: 50/296 cut-off events. [2022-02-20 20:10:01,776 INFO L130 PetriNetUnfolder]: For 1603/1652 co-relation queries the response was YES. [2022-02-20 20:10:01,777 INFO L84 FinitePrefix]: Finished finitePrefix Result has 912 conditions, 296 events. 50/296 cut-off events. For 1603/1652 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1027 event pairs, 0 based on Foata normal form. 29/296 useless extension candidates. Maximal degree in co-relation 862. Up to 62 conditions per place. [2022-02-20 20:10:01,778 INFO L132 encePairwiseOnDemand]: 64/70 looper letters, 35 selfloop transitions, 17 changer transitions 20/117 dead transitions. [2022-02-20 20:10:01,778 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 117 transitions, 1183 flow [2022-02-20 20:10:01,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 20:10:01,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-02-20 20:10:01,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1104 transitions. [2022-02-20 20:10:01,801 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8300751879699249 [2022-02-20 20:10:01,801 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1104 transitions. [2022-02-20 20:10:01,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1104 transitions. [2022-02-20 20:10:01,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:10:01,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1104 transitions. [2022-02-20 20:10:01,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 58.10526315789474) internal successors, (1104), 19 states have internal predecessors, (1104), 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:10:01,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 70.0) internal successors, (1400), 20 states have internal predecessors, (1400), 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:10:01,806 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 70.0) internal successors, (1400), 20 states have internal predecessors, (1400), 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:10:01,806 INFO L186 Difference]: Start difference. First operand has 106 places, 82 transitions, 505 flow. Second operand 19 states and 1104 transitions. [2022-02-20 20:10:01,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 117 transitions, 1183 flow