./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/triangular-2.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-2.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 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:08:55,227 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:08:55,229 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:08:55,265 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:08:55,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:08:55,266 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:08:55,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:08:55,268 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:08:55,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:08:55,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:08:55,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:08:55,271 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:08:55,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:08:55,272 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:08:55,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:08:55,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:08:55,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:08:55,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:08:55,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:08:55,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:08:55,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:08:55,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:08:55,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:08:55,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:08:55,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:08:55,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:08:55,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:08:55,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:08:55,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:08:55,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:08:55,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:08:55,285 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:08:55,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:08:55,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:08:55,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:08:55,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:08:55,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:08:55,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:08:55,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:08:55,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:08:55,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:08:55,289 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:08:55,302 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:08:55,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:08:55,312 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:08:55,312 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:08:55,312 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:08:55,313 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:08:55,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:08:55,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:08:55,313 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:08:55,314 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:08:55,314 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:08:55,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:08:55,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:08:55,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:08:55,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:08:55,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:08:55,315 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:08:55,315 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:08:55,315 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:08:55,315 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:08:55,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:08:55,316 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:08:55,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:08:55,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:08:55,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:08:55,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:08:55,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:08:55,316 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:08:55,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:08:55,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:08:55,317 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:08:55,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:08:55,317 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:08:55,317 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 -> 9ca4ad6de5ce46f9737c47ccc55c2628eaef135acf1b94c234f6d96d13f1ccb1 [2022-02-20 20:08:55,512 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:08:55,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:08:55,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:08:55,536 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:08:55,537 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:08:55,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-2.i [2022-02-20 20:08:55,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95be21cf/680d6f00abbf4062b2d1df0b03de8b45/FLAG508bbe2e1 [2022-02-20 20:08:55,914 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:08:55,915 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-2.i [2022-02-20 20:08:55,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95be21cf/680d6f00abbf4062b2d1df0b03de8b45/FLAG508bbe2e1 [2022-02-20 20:08:56,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95be21cf/680d6f00abbf4062b2d1df0b03de8b45 [2022-02-20 20:08:56,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:08:56,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:08:56,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:08:56,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:08:56,326 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:08:56,327 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:08:56" (1/1) ... [2022-02-20 20:08:56,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f3b25c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:08:56, skipping insertion in model container [2022-02-20 20:08:56,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:08:56" (1/1) ... [2022-02-20 20:08:56,333 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:08:56,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:08:56,707 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-2.i[30952,30965] [2022-02-20 20:08:56,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:08:56,715 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:08:56,750 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-2.i[30952,30965] [2022-02-20 20:08:56,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:08:56,787 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:08:56,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:08:56 WrapperNode [2022-02-20 20:08:56,788 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:08:56,789 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:08:56,789 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:08:56,789 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:08:56,795 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:08:56" (1/1) ... [2022-02-20 20:08:56,823 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:08:56" (1/1) ... [2022-02-20 20:08:56,837 INFO L137 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2022-02-20 20:08:56,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:08:56,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:08:56,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:08:56,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:08:56,843 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:08:56" (1/1) ... [2022-02-20 20:08:56,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:08:56" (1/1) ... [2022-02-20 20:08:56,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:08:56" (1/1) ... [2022-02-20 20:08:56,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:08:56" (1/1) ... [2022-02-20 20:08:56,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:08:56" (1/1) ... [2022-02-20 20:08:56,863 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:08:56" (1/1) ... [2022-02-20 20:08:56,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:08:56" (1/1) ... [2022-02-20 20:08:56,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:08:56,875 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:08:56,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:08:56,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:08:56,877 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:08:56" (1/1) ... [2022-02-20 20:08:56,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:08:56,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:08:56,901 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:08:56,928 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:08:56,940 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-02-20 20:08:56,941 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-02-20 20:08:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-02-20 20:08:56,941 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-02-20 20:08:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:08:56,941 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 20:08:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:08:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:08:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:08:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:08:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 20:08:56,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:08:56,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:08:56,944 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:08:57,045 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:08:57,046 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:08:57,170 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:08:57,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:08:57,177 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 20:08:57,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:08:57 BoogieIcfgContainer [2022-02-20 20:08:57,179 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:08:57,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:08:57,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:08:57,182 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:08:57,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:08:56" (1/3) ... [2022-02-20 20:08:57,183 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cab6004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:08:57, skipping insertion in model container [2022-02-20 20:08:57,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:08:56" (2/3) ... [2022-02-20 20:08:57,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5cab6004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:08:57, skipping insertion in model container [2022-02-20 20:08:57,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:08:57" (3/3) ... [2022-02-20 20:08:57,185 INFO L111 eAbstractionObserver]: Analyzing ICFG triangular-2.i [2022-02-20 20:08:57,188 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:08:57,188 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:08:57,188 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:08:57,188 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:08:57,225 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,225 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,225 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,225 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,226 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,226 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,226 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,226 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,227 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,227 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,227 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,228 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,229 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,230 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,231 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,231 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,232 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,232 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,232 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,232 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,233 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,233 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,233 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,233 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,233 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,234 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,234 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,234 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,234 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,235 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,235 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,235 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,235 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,235 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,235 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,236 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,236 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,236 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,236 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,237 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,238 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,239 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,240 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,241 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,241 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,241 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,241 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,242 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,242 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,242 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,242 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,242 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,243 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,243 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,243 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,243 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,246 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,246 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,246 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,246 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~k~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,246 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,246 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,248 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,252 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,252 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,252 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,252 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,253 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~k~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:08:57,253 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:08:57,289 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:08:57,294 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:08:57,294 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:08:57,305 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 70 transitions, 150 flow [2022-02-20 20:08:57,344 INFO L129 PetriNetUnfolder]: 5/68 cut-off events. [2022-02-20 20:08:57,344 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:08:57,347 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:08:57,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 70 transitions, 150 flow [2022-02-20 20:08:57,350 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 68 transitions, 142 flow [2022-02-20 20:08:57,362 INFO L129 PetriNetUnfolder]: 4/58 cut-off events. [2022-02-20 20:08:57,367 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:08:57,367 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:08:57,376 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:08:57,377 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:08:57,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:08:57,381 INFO L85 PathProgramCache]: Analyzing trace with hash 398220865, now seen corresponding path program 1 times [2022-02-20 20:08:57,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:08:57,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603957662] [2022-02-20 20:08:57,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:08:57,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:08:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:08:57,747 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:08:57,747 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:08:57,747 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:08:57,748 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:08:57,748 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:08:57,748 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:08:57,748 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:08:57,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {75#true} [137] L693-3-->L693-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) 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:08:57,749 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 16)} is VALID [2022-02-20 20:08:57,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {77#(< ~i~0 16)} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78#(and (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78#(and (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,760 INFO L290 TraceCheckUtils]: 25: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [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 (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:08:57,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {78#(and (< ~j~0 16) (< ~i~0 16))} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (<= 16 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 16))} is VALID [2022-02-20 20:08:57,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {79#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (< ~j~0 16))} [114] L717-->L720: Formula: (= (ite (<= 16 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:08:57,766 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:08:57,766 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:08:57,768 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:08:57,769 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:08:57,769 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603957662] [2022-02-20 20:08:57,769 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603957662] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:08:57,770 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:08:57,770 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:08:57,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399570399] [2022-02-20 20:08:57,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:08:57,781 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:08:57,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:08:57,785 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:08:57,819 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:08:57,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:08:57,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:08:57,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:08:57,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:08:57,834 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:08:57,837 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:08:57,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:08:57,837 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:08:57,838 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:08:58,004 INFO L129 PetriNetUnfolder]: 42/210 cut-off events. [2022-02-20 20:08:58,004 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-02-20 20:08:58,006 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:08:58,008 INFO L132 encePairwiseOnDemand]: 59/70 looper letters, 22 selfloop transitions, 17 changer transitions 0/92 dead transitions. [2022-02-20 20:08:58,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 92 transitions, 271 flow [2022-02-20 20:08:58,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 20:08:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-02-20 20:08:58,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 613 transitions. [2022-02-20 20:08:58,049 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8757142857142857 [2022-02-20 20:08:58,049 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 613 transitions. [2022-02-20 20:08:58,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 613 transitions. [2022-02-20 20:08:58,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:08:58,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 613 transitions. [2022-02-20 20:08:58,059 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:08:58,065 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:08:58,067 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:08:58,068 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:08:58,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 92 transitions, 271 flow [2022-02-20 20:08:58,071 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:08:58,073 INFO L242 Difference]: Finished difference. Result has 85 places, 85 transitions, 276 flow [2022-02-20 20:08:58,074 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:08:58,077 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 15 predicate places. [2022-02-20 20:08:58,077 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 85 places, 85 transitions, 276 flow [2022-02-20 20:08:58,241 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:08:58,253 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:08:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:08:58,254 INFO L470 AbstractCegarLoop]: Abstraction has has 85 places, 85 transitions, 276 flow [2022-02-20 20:08:58,254 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:08:58,254 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:08:58,255 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:08:58,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:08:58,255 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:08:58,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:08:58,256 INFO L85 PathProgramCache]: Analyzing trace with hash 245149124, now seen corresponding path program 1 times [2022-02-20 20:08:58,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:08:58,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890044270] [2022-02-20 20:08:58,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:08:58,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:08:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:08:58,431 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:08:58,431 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:08:58,432 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:08:58,432 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:08:58,432 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:08:58,432 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:08:58,433 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:08:58,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {3811#true} [137] L693-3-->L693-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) 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:08:58,433 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:08:58,433 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:08:58,434 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:08:58,434 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:08:58,435 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:08:58,435 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:08:58,436 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:08:58,438 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:08:58,439 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:08:58,440 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:08:58,440 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:08:58,440 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:08:58,441 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:08:58,441 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:08:58,442 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:08:58,443 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:08:58,444 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:08:58,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {3813#(<= ~j~0 6)} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 5) 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:08:58,447 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 16))} is VALID [2022-02-20 20:08:58,448 INFO L290 TraceCheckUtils]: 27: Hoare triple {3814#(and (<= ~j~0 6) (< ~i~0 16))} [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 16))} is VALID [2022-02-20 20:08:58,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {3814#(and (<= ~j~0 6) (< ~i~0 16))} [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 16))} is VALID [2022-02-20 20:08:58,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {3814#(and (<= ~j~0 6) (< ~i~0 16))} [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 16))} is VALID [2022-02-20 20:08:58,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {3814#(and (<= ~j~0 6) (< ~i~0 16))} [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 16))} is VALID [2022-02-20 20:08:58,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {3814#(and (<= ~j~0 6) (< ~i~0 16))} [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 16))} is VALID [2022-02-20 20:08:58,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {3814#(and (<= ~j~0 6) (< ~i~0 16))} [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 16))} is VALID [2022-02-20 20:08:58,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {3814#(and (<= ~j~0 6) (< ~i~0 16))} [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 16))} is VALID [2022-02-20 20:08:58,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {3814#(and (<= ~j~0 6) (< ~i~0 16))} [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 16))} is VALID [2022-02-20 20:08:58,457 INFO L290 TraceCheckUtils]: 35: Hoare triple {3814#(and (<= ~j~0 6) (< ~i~0 16))} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (<= 16 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:08:58,458 INFO L290 TraceCheckUtils]: 36: Hoare triple {3815#(and (<= ~j~0 6) (= |ULTIMATE.start_main_~condI~0#1| 0))} [114] L717-->L720: Formula: (= (ite (<= 16 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:08:58,458 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:08:58,458 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:08:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 20:08:58,459 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:08:58,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890044270] [2022-02-20 20:08:58,460 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890044270] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:08:58,460 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:08:58,460 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:08:58,460 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961896392] [2022-02-20 20:08:58,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:08:58,462 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:08:58,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:08:58,464 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:08:58,489 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:08:58,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:08:58,490 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:08:58,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:08:58,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:08:58,493 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:08:58,493 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:08:58,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:08:58,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:08:58,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:08:58,676 INFO L129 PetriNetUnfolder]: 46/217 cut-off events. [2022-02-20 20:08:58,677 INFO L130 PetriNetUnfolder]: For 109/112 co-relation queries the response was YES. [2022-02-20 20:08:58,678 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:08:58,679 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 16 selfloop transitions, 9 changer transitions 40/110 dead transitions. [2022-02-20 20:08:58,679 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 110 transitions, 508 flow [2022-02-20 20:08:58,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 20:08:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-02-20 20:08:58,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 475 transitions. [2022-02-20 20:08:58,689 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8482142857142857 [2022-02-20 20:08:58,690 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 475 transitions. [2022-02-20 20:08:58,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 475 transitions. [2022-02-20 20:08:58,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:08:58,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 475 transitions. [2022-02-20 20:08:58,692 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:08:58,692 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:08:58,693 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:08:58,693 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:08:58,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 110 transitions, 508 flow [2022-02-20 20:08:58,715 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:08:58,717 INFO L242 Difference]: Finished difference. Result has 96 places, 67 transitions, 237 flow [2022-02-20 20:08:58,717 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:08:58,717 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 26 predicate places. [2022-02-20 20:08:58,718 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 67 transitions, 237 flow [2022-02-20 20:08:58,749 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:08:58,752 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:08:58,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:08:58,752 INFO L470 AbstractCegarLoop]: Abstraction has has 96 places, 67 transitions, 237 flow [2022-02-20 20:08:58,753 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:08:58,753 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:08:58,753 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:08:58,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:08:58,753 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:08:58,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:08:58,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1444168350, now seen corresponding path program 1 times [2022-02-20 20:08:58,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:08:58,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073886016] [2022-02-20 20:08:58,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:08:58,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:08:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:08:58,852 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:08:58,853 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:08:58,853 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:08:58,853 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:08:58,853 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:08:58,854 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:08:58,854 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:08:58,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {5258#true} [137] L693-3-->L693-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) 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:08:58,854 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:08:58,855 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:08:58,855 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:08:58,855 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:08:58,856 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:08:58,856 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:08:58,857 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:08:58,857 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:08:58,857 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:08:58,858 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:08:58,859 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:08:58,859 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:08:58,859 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:08:58,860 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:08:58,860 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:08:58,860 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:08:58,861 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:08:58,861 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:08:58,862 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:08:58,862 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:08:58,862 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:08:58,863 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:08:58,863 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:08:58,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {5260#(<= ~i~0 3)} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (<= 16 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:08:58,866 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:08:58,866 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:08:58,866 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 5) 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:08:58,867 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 (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:08:58,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {5262#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} [114] L717-->L720: Formula: (= (ite (<= 16 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:08:58,868 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:08:58,868 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:08:58,869 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:08:58,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:08:58,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073886016] [2022-02-20 20:08:58,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073886016] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:08:58,870 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:08:58,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:08:58,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119582336] [2022-02-20 20:08:58,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:08:58,871 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:08:58,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:08:58,872 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:08:58,893 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:08:58,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:08:58,893 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:08:58,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:08:58,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:08:58,897 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:08:58,897 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:08:58,897 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:08:58,897 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:08:58,898 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:08:59,045 INFO L129 PetriNetUnfolder]: 37/196 cut-off events. [2022-02-20 20:08:59,046 INFO L130 PetriNetUnfolder]: For 258/265 co-relation queries the response was YES. [2022-02-20 20:08:59,047 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:08:59,048 INFO L132 encePairwiseOnDemand]: 64/70 looper letters, 23 selfloop transitions, 11 changer transitions 8/87 dead transitions. [2022-02-20 20:08:59,048 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 87 transitions, 457 flow [2022-02-20 20:08:59,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:08:59,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:08:59,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 530 transitions. [2022-02-20 20:08:59,052 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8412698412698413 [2022-02-20 20:08:59,052 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 530 transitions. [2022-02-20 20:08:59,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 530 transitions. [2022-02-20 20:08:59,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:08:59,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 530 transitions. [2022-02-20 20:08:59,054 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:08:59,055 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:08:59,055 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:08:59,055 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:08:59,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 87 transitions, 457 flow [2022-02-20 20:08:59,081 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:08:59,083 INFO L242 Difference]: Finished difference. Result has 86 places, 72 transitions, 289 flow [2022-02-20 20:08:59,083 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:08:59,083 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 16 predicate places. [2022-02-20 20:08:59,083 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 86 places, 72 transitions, 289 flow [2022-02-20 20:08:59,123 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:08:59,127 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:08:59,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:08:59,128 INFO L470 AbstractCegarLoop]: Abstraction has has 86 places, 72 transitions, 289 flow [2022-02-20 20:08:59,128 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:08:59,128 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:08:59,128 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:08:59,128 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:08:59,129 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:08:59,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:08:59,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1245653052, now seen corresponding path program 2 times [2022-02-20 20:08:59,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:08:59,130 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571385259] [2022-02-20 20:08:59,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:08:59,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:08:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:08:59,216 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:08:59,217 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:08:59,217 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:08:59,217 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:08:59,217 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:08:59,217 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:08:59,217 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:08:59,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {7188#true} [137] L693-3-->L693-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) 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:08:59,219 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:08:59,219 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:08:59,226 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:08:59,226 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:08:59,226 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:08:59,227 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:08:59,227 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:08:59,228 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:08:59,229 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:08:59,229 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:08:59,229 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:08:59,230 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:08:59,230 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:08:59,230 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:08:59,231 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:08:59,231 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:08:59,232 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:08:59,232 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:08:59,232 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:08:59,232 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:08:59,233 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:08:59,233 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:08:59,233 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:08:59,234 INFO L290 TraceCheckUtils]: 31: Hoare triple {7190#(<= ~i~0 3)} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 5) 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:08:59,234 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 (<= ~j~0 4) (< ~i~0 16))} is VALID [2022-02-20 20:08:59,234 INFO L290 TraceCheckUtils]: 33: Hoare triple {7191#(and (<= ~j~0 4) (< ~i~0 16))} [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 (<= ~j~0 4) (< ~i~0 16))} is VALID [2022-02-20 20:08:59,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {7191#(and (<= ~j~0 4) (< ~i~0 16))} [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 (<= ~j~0 4) (< ~i~0 16))} is VALID [2022-02-20 20:08:59,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {7191#(and (<= ~j~0 4) (< ~i~0 16))} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (<= 16 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 (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:08:59,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {7192#(and (<= ~j~0 4) (= |ULTIMATE.start_main_~condI~0#1| 0))} [114] L717-->L720: Formula: (= (ite (<= 16 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:08:59,236 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:08:59,236 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:08:59,236 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:08:59,237 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:08:59,237 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571385259] [2022-02-20 20:08:59,237 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571385259] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:08:59,237 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:08:59,237 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:08:59,237 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058353487] [2022-02-20 20:08:59,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:08:59,238 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:08:59,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:08:59,239 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:08:59,260 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:08:59,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:08:59,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:08:59,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:08:59,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:08:59,262 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:08:59,262 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:08:59,263 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:08:59,263 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:08:59,263 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:08:59,440 INFO L129 PetriNetUnfolder]: 34/199 cut-off events. [2022-02-20 20:08:59,440 INFO L130 PetriNetUnfolder]: For 292/326 co-relation queries the response was YES. [2022-02-20 20:08:59,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 199 events. 34/199 cut-off events. For 292/326 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 699 event pairs, 0 based on Foata normal form. 25/206 useless extension candidates. Maximal degree in co-relation 412. Up to 37 conditions per place. [2022-02-20 20:08:59,442 INFO L132 encePairwiseOnDemand]: 64/70 looper letters, 21 selfloop transitions, 15 changer transitions 11/92 dead transitions. [2022-02-20 20:08:59,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 92 transitions, 536 flow [2022-02-20 20:08:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 20:08:59,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-02-20 20:08:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 585 transitions. [2022-02-20 20:08:59,447 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8357142857142857 [2022-02-20 20:08:59,447 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 585 transitions. [2022-02-20 20:08:59,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 585 transitions. [2022-02-20 20:08:59,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:08:59,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 585 transitions. [2022-02-20 20:08:59,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 58.5) internal successors, (585), 10 states have internal predecessors, (585), 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:08:59,450 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:08:59,450 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:08:59,450 INFO L186 Difference]: Start difference. First operand has 86 places, 72 transitions, 289 flow. Second operand 10 states and 585 transitions. [2022-02-20 20:08:59,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 92 transitions, 536 flow [2022-02-20 20:08:59,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 92 transitions, 511 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-02-20 20:08:59,496 INFO L242 Difference]: Finished difference. Result has 95 places, 77 transitions, 370 flow [2022-02-20 20:08:59,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=10, PETRI_FLOW=370, PETRI_PLACES=95, PETRI_TRANSITIONS=77} [2022-02-20 20:08:59,497 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 25 predicate places. [2022-02-20 20:08:59,497 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 77 transitions, 370 flow [2022-02-20 20:08:59,544 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1757 states, 1747 states have (on average 2.6044647967945047) internal successors, (4550), 1756 states have internal predecessors, (4550), 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:08:59,547 INFO L78 Accepts]: Start accepts. Automaton has has 1757 states, 1747 states have (on average 2.6044647967945047) internal successors, (4550), 1756 states have internal predecessors, (4550), 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:08:59,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:08:59,548 INFO L470 AbstractCegarLoop]: Abstraction has has 95 places, 77 transitions, 370 flow [2022-02-20 20:08:59,549 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:08:59,549 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:08:59,549 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:08:59,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:08:59,549 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 20:08:59,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:08:59,550 INFO L85 PathProgramCache]: Analyzing trace with hash 704825237, now seen corresponding path program 1 times [2022-02-20 20:08:59,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:08:59,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710708432] [2022-02-20 20:08:59,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:08:59,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:08:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:08:59,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {8969#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8969#true} is VALID [2022-02-20 20:08:59,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {8969#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] {8969#true} is VALID [2022-02-20 20:08:59,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {8969#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[] {8969#true} is VALID [2022-02-20 20:08:59,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {8969#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {8969#true} is VALID [2022-02-20 20:08:59,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {8969#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[] {8969#true} is VALID [2022-02-20 20:08:59,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {8969#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[] {8969#true} is VALID [2022-02-20 20:08:59,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {8969#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[] {8969#true} is VALID [2022-02-20 20:08:59,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {8969#true} [137] L693-3-->L693-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {8969#true} is VALID [2022-02-20 20:08:59,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {8969#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {8969#true} is VALID [2022-02-20 20:08:59,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {8969#true} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {8971#(<= ~j~0 6)} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {8971#(<= ~j~0 6)} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,653 INFO L290 TraceCheckUtils]: 24: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {8971#(<= ~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] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {8971#(<= ~j~0 6)} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 5) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {8971#(<= ~j~0 6)} is VALID [2022-02-20 20:08:59,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {8971#(<= ~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] {8972#(<= ~i~0 7)} is VALID [2022-02-20 20:08:59,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {8972#(<= ~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] {8972#(<= ~i~0 7)} is VALID [2022-02-20 20:08:59,657 INFO L290 TraceCheckUtils]: 33: Hoare triple {8972#(<= ~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] {8972#(<= ~i~0 7)} is VALID [2022-02-20 20:08:59,657 INFO L290 TraceCheckUtils]: 34: Hoare triple {8972#(<= ~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] {8972#(<= ~i~0 7)} is VALID [2022-02-20 20:08:59,658 INFO L290 TraceCheckUtils]: 35: Hoare triple {8972#(<= ~i~0 7)} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 5) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {8972#(<= ~i~0 7)} is VALID [2022-02-20 20:08:59,658 INFO L290 TraceCheckUtils]: 36: Hoare triple {8972#(<= ~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] {8972#(<= ~i~0 7)} is VALID [2022-02-20 20:08:59,658 INFO L290 TraceCheckUtils]: 37: Hoare triple {8972#(<= ~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] {8972#(<= ~i~0 7)} is VALID [2022-02-20 20:08:59,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {8972#(<= ~i~0 7)} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (<= 16 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] {8973#(and (<= ~i~0 7) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:08:59,659 INFO L290 TraceCheckUtils]: 39: Hoare triple {8973#(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] {8974#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (< ~j~0 16))} is VALID [2022-02-20 20:08:59,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {8974#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (< ~j~0 16))} [114] L717-->L720: Formula: (= (ite (<= 16 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] {8975#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:08:59,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {8975#(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[] {8970#false} is VALID [2022-02-20 20:08:59,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {8970#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8970#false} is VALID [2022-02-20 20:08:59,661 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:08:59,661 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:08:59,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710708432] [2022-02-20 20:08:59,661 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710708432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:08:59,661 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:08:59,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:08:59,662 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767999606] [2022-02-20 20:08:59,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:08:59,662 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:08:59,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:08:59,663 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:08:59,685 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:08:59,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:08:59,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:08:59,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:08:59,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:08:59,688 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:08:59,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 77 transitions, 370 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:08:59,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:08:59,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:08:59,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:08:59,861 INFO L129 PetriNetUnfolder]: 47/275 cut-off events. [2022-02-20 20:08:59,862 INFO L130 PetriNetUnfolder]: For 540/559 co-relation queries the response was YES. [2022-02-20 20:08:59,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 275 events. 47/275 cut-off events. For 540/559 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1165 event pairs, 1 based on Foata normal form. 17/266 useless extension candidates. Maximal degree in co-relation 588. Up to 55 conditions per place. [2022-02-20 20:08:59,863 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 25 selfloop transitions, 23 changer transitions 8/101 dead transitions. [2022-02-20 20:08:59,863 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 101 transitions, 694 flow [2022-02-20 20:08:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:08:59,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-02-20 20:08:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 644 transitions. [2022-02-20 20:08:59,868 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8363636363636363 [2022-02-20 20:08:59,868 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 644 transitions. [2022-02-20 20:08:59,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 644 transitions. [2022-02-20 20:08:59,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:08:59,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 644 transitions. [2022-02-20 20:08:59,870 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:08:59,870 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:08:59,871 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:08:59,871 INFO L186 Difference]: Start difference. First operand has 95 places, 77 transitions, 370 flow. Second operand 11 states and 644 transitions. [2022-02-20 20:08:59,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 101 transitions, 694 flow [2022-02-20 20:09:00,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 101 transitions, 647 flow, removed 19 selfloop flow, removed 5 redundant places. [2022-02-20 20:09:00,036 INFO L242 Difference]: Finished difference. Result has 104 places, 83 transitions, 485 flow [2022-02-20 20:09:00,036 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=485, PETRI_PLACES=104, PETRI_TRANSITIONS=83} [2022-02-20 20:09:00,036 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 34 predicate places. [2022-02-20 20:09:00,036 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 104 places, 83 transitions, 485 flow [2022-02-20 20:09:00,146 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2717 states, 2702 states have (on average 2.631384159881569) internal successors, (7110), 2716 states have internal predecessors, (7110), 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:00,149 INFO L78 Accepts]: Start accepts. Automaton has has 2717 states, 2702 states have (on average 2.631384159881569) internal successors, (7110), 2716 states have internal predecessors, (7110), 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:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:09:00,149 INFO L470 AbstractCegarLoop]: Abstraction has has 104 places, 83 transitions, 485 flow [2022-02-20 20:09:00,150 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:00,150 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:09:00,150 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:09:00,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:09:00,150 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:00,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:09:00,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1426423327, now seen corresponding path program 2 times [2022-02-20 20:09:00,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:09:00,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734699265] [2022-02-20 20:09:00,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:09:00,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:09:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:09:00,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {11712#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11712#true} is VALID [2022-02-20 20:09:00,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {11712#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] {11712#true} is VALID [2022-02-20 20:09:00,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {11712#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[] {11712#true} is VALID [2022-02-20 20:09:00,267 INFO L290 TraceCheckUtils]: 3: Hoare triple {11712#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {11712#true} is VALID [2022-02-20 20:09:00,267 INFO L290 TraceCheckUtils]: 4: Hoare triple {11712#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[] {11712#true} is VALID [2022-02-20 20:09:00,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {11712#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[] {11712#true} is VALID [2022-02-20 20:09:00,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {11712#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[] {11712#true} is VALID [2022-02-20 20:09:00,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {11712#true} [137] L693-3-->L693-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {11712#true} is VALID [2022-02-20 20:09:00,268 INFO L290 TraceCheckUtils]: 8: Hoare triple {11712#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {11712#true} is VALID [2022-02-20 20:09:00,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {11712#true} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {11714#(<= ~j~0 6)} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {11714#(<= ~j~0 6)} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,275 INFO L290 TraceCheckUtils]: 22: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,276 INFO L290 TraceCheckUtils]: 24: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {11714#(<= ~j~0 6)} [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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {11714#(<= ~j~0 6)} [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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {11714#(<= ~j~0 6)} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 5) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {11714#(<= ~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] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {11714#(<= ~j~0 6)} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 5) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {11714#(<= ~j~0 6)} is VALID [2022-02-20 20:09:00,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {11714#(<= ~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] {11715#(<= ~i~0 7)} is VALID [2022-02-20 20:09:00,280 INFO L290 TraceCheckUtils]: 36: Hoare triple {11715#(<= ~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] {11716#(and (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:09:00,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {11716#(and (< ~j~0 16) (< ~i~0 16))} [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] {11716#(and (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:09:00,281 INFO L290 TraceCheckUtils]: 38: Hoare triple {11716#(and (< ~j~0 16) (< ~i~0 16))} [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] {11716#(and (< ~j~0 16) (< ~i~0 16))} is VALID [2022-02-20 20:09:00,282 INFO L290 TraceCheckUtils]: 39: Hoare triple {11716#(and (< ~j~0 16) (< ~i~0 16))} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (<= 16 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] {11717#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (< ~j~0 16))} is VALID [2022-02-20 20:09:00,282 INFO L290 TraceCheckUtils]: 40: Hoare triple {11717#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (< ~j~0 16))} [114] L717-->L720: Formula: (= (ite (<= 16 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] {11718#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:00,282 INFO L290 TraceCheckUtils]: 41: Hoare triple {11718#(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[] {11713#false} is VALID [2022-02-20 20:09:00,283 INFO L290 TraceCheckUtils]: 42: Hoare triple {11713#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11713#false} is VALID [2022-02-20 20:09:00,283 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:00,284 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:09:00,284 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734699265] [2022-02-20 20:09:00,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734699265] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:09:00,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:09:00,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:09:00,284 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020263623] [2022-02-20 20:09:00,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:09:00,285 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:00,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:09:00,285 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:00,309 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:00,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:09:00,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:09:00,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:09:00,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:09:00,311 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:09:00,311 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 83 transitions, 485 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:00,311 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:09:00,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:09:00,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:09:00,636 INFO L129 PetriNetUnfolder]: 41/239 cut-off events. [2022-02-20 20:09:00,636 INFO L130 PetriNetUnfolder]: For 944/972 co-relation queries the response was YES. [2022-02-20 20:09:00,637 INFO L84 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 239 events. 41/239 cut-off events. For 944/972 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 921 event pairs, 1 based on Foata normal form. 22/238 useless extension candidates. Maximal degree in co-relation 660. Up to 51 conditions per place. [2022-02-20 20:09:00,638 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 23 selfloop transitions, 23 changer transitions 11/102 dead transitions. [2022-02-20 20:09:00,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 102 transitions, 868 flow [2022-02-20 20:09:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 20:09:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-02-20 20:09:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 638 transitions. [2022-02-20 20:09:00,645 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2022-02-20 20:09:00,645 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 638 transitions. [2022-02-20 20:09:00,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 638 transitions. [2022-02-20 20:09:00,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:09:00,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 638 transitions. [2022-02-20 20:09:00,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 58.0) internal successors, (638), 11 states have internal predecessors, (638), 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:00,648 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:00,648 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:00,648 INFO L186 Difference]: Start difference. First operand has 104 places, 83 transitions, 485 flow. Second operand 11 states and 638 transitions. [2022-02-20 20:09:00,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 102 transitions, 868 flow [2022-02-20 20:09:01,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 102 transitions, 805 flow, removed 22 selfloop flow, removed 5 redundant places. [2022-02-20 20:09:01,210 INFO L242 Difference]: Finished difference. Result has 111 places, 85 transitions, 555 flow [2022-02-20 20:09:01,210 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=555, PETRI_PLACES=111, PETRI_TRANSITIONS=85} [2022-02-20 20:09:01,211 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 41 predicate places. [2022-02-20 20:09:01,211 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 111 places, 85 transitions, 555 flow [2022-02-20 20:09:01,288 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2269 states, 2254 states have (on average 2.5581188997338065) internal successors, (5766), 2268 states have internal predecessors, (5766), 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:01,291 INFO L78 Accepts]: Start accepts. Automaton has has 2269 states, 2254 states have (on average 2.5581188997338065) internal successors, (5766), 2268 states have internal predecessors, (5766), 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:01,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:09:01,291 INFO L470 AbstractCegarLoop]: Abstraction has has 111 places, 85 transitions, 555 flow [2022-02-20 20:09:01,292 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:01,292 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:09:01,292 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:01,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:09:01,292 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:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:09:01,293 INFO L85 PathProgramCache]: Analyzing trace with hash -211553739, now seen corresponding path program 1 times [2022-02-20 20:09:01,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:09:01,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406798638] [2022-02-20 20:09:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:09:01,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:09:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:09:01,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {14007#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14007#true} is VALID [2022-02-20 20:09:01,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {14007#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] {14007#true} is VALID [2022-02-20 20:09:01,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {14007#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[] {14007#true} is VALID [2022-02-20 20:09:01,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {14007#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {14007#true} is VALID [2022-02-20 20:09:01,375 INFO L290 TraceCheckUtils]: 4: Hoare triple {14007#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[] {14007#true} is VALID [2022-02-20 20:09:01,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {14007#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[] {14007#true} is VALID [2022-02-20 20:09:01,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {14007#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[] {14007#true} is VALID [2022-02-20 20:09:01,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {14007#true} [137] L693-3-->L693-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {14007#true} is VALID [2022-02-20 20:09:01,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {14007#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {14007#true} is VALID [2022-02-20 20:09:01,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {14007#true} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {14009#(<= ~j~0 6)} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {14009#(<= ~j~0 6)} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,377 INFO L290 TraceCheckUtils]: 12: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {14009#(<= ~j~0 6)} [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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {14009#(<= ~j~0 6)} [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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {14009#(<= ~j~0 6)} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 5) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {14009#(<= ~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] {14010#(<= ~i~0 7)} is VALID [2022-02-20 20:09:01,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {14010#(<= ~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] {14010#(<= ~i~0 7)} is VALID [2022-02-20 20:09:01,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {14010#(<= ~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] {14010#(<= ~i~0 7)} is VALID [2022-02-20 20:09:01,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {14010#(<= ~i~0 7)} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 5) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {14010#(<= ~i~0 7)} is VALID [2022-02-20 20:09:01,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {14010#(<= ~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] {14011#(<= ~j~0 8)} is VALID [2022-02-20 20:09:01,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {14011#(<= ~j~0 8)} [169] L699-->L696-3: Formula: (= |v_t1Thread1of1ForFork0_#t~post3_1| v_t1Thread1of1ForFork0_~k~0_7) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_7} OutVars{t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_1|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_7} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~post3] {14011#(<= ~j~0 8)} is VALID [2022-02-20 20:09:01,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {14011#(<= ~j~0 8)} [170] L696-3-->L696-4: Formula: (= v_t1Thread1of1ForFork0_~k~0_9 (+ |v_t1Thread1of1ForFork0_#t~post3_3| 1)) InVars {t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_3|} OutVars{t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_3|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_9} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~k~0] {14011#(<= ~j~0 8)} is VALID [2022-02-20 20:09:01,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {14011#(<= ~j~0 8)} [171] L696-4-->L696-5: Formula: true InVars {} OutVars{t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_5|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~post3] {14011#(<= ~j~0 8)} is VALID [2022-02-20 20:09:01,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {14011#(<= ~j~0 8)} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 5) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {14011#(<= ~j~0 8)} is VALID [2022-02-20 20:09:01,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {14011#(<= ~j~0 8)} [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] {14012#(and (<= ~j~0 8) (< ~i~0 16))} is VALID [2022-02-20 20:09:01,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {14012#(and (<= ~j~0 8) (< ~i~0 16))} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (<= 16 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] {14013#(and (<= ~j~0 8) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:01,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {14013#(and (<= ~j~0 8) (= |ULTIMATE.start_main_~condI~0#1| 0))} [114] L717-->L720: Formula: (= (ite (<= 16 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] {14014#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:01,392 INFO L290 TraceCheckUtils]: 46: Hoare triple {14014#(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[] {14008#false} is VALID [2022-02-20 20:09:01,392 INFO L290 TraceCheckUtils]: 47: Hoare triple {14008#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14008#false} is VALID [2022-02-20 20:09:01,393 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:01,393 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:09:01,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406798638] [2022-02-20 20:09:01,393 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406798638] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 20:09:01,393 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429364226] [2022-02-20 20:09:01,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:09:01,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 20:09:01,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:09:01,396 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:01,400 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:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:09:01,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 20:09:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:09:01,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 20:09:01,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {14007#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14007#true} is VALID [2022-02-20 20:09:01,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {14007#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] {14007#true} is VALID [2022-02-20 20:09:01,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {14007#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[] {14007#true} is VALID [2022-02-20 20:09:01,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {14007#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {14007#true} is VALID [2022-02-20 20:09:01,784 INFO L290 TraceCheckUtils]: 4: Hoare triple {14007#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[] {14007#true} is VALID [2022-02-20 20:09:01,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {14007#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[] {14007#true} is VALID [2022-02-20 20:09:01,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {14007#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[] {14007#true} is VALID [2022-02-20 20:09:01,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {14007#true} [137] L693-3-->L693-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {14007#true} is VALID [2022-02-20 20:09:01,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {14007#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {14007#true} is VALID [2022-02-20 20:09:01,784 INFO L290 TraceCheckUtils]: 9: Hoare triple {14007#true} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {14009#(<= ~j~0 6)} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {14009#(<= ~j~0 6)} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,787 INFO L290 TraceCheckUtils]: 14: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {14009#(<= ~j~0 6)} [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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {14009#(<= ~j~0 6)} [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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {14009#(<= ~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] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {14009#(<= ~j~0 6)} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 5) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {14009#(<= ~j~0 6)} is VALID [2022-02-20 20:09:01,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {14009#(<= ~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] {14010#(<= ~i~0 7)} is VALID [2022-02-20 20:09:01,793 INFO L290 TraceCheckUtils]: 35: Hoare triple {14010#(<= ~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] {14010#(<= ~i~0 7)} is VALID [2022-02-20 20:09:01,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {14010#(<= ~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] {14010#(<= ~i~0 7)} is VALID [2022-02-20 20:09:01,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {14010#(<= ~i~0 7)} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 5) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {14010#(<= ~i~0 7)} is VALID [2022-02-20 20:09:01,794 INFO L290 TraceCheckUtils]: 38: Hoare triple {14010#(<= ~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] {14011#(<= ~j~0 8)} is VALID [2022-02-20 20:09:01,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {14011#(<= ~j~0 8)} [169] L699-->L696-3: Formula: (= |v_t1Thread1of1ForFork0_#t~post3_1| v_t1Thread1of1ForFork0_~k~0_7) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_7} OutVars{t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_1|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_7} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~post3] {14011#(<= ~j~0 8)} is VALID [2022-02-20 20:09:01,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {14011#(<= ~j~0 8)} [170] L696-3-->L696-4: Formula: (= v_t1Thread1of1ForFork0_~k~0_9 (+ |v_t1Thread1of1ForFork0_#t~post3_3| 1)) InVars {t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_3|} OutVars{t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_3|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_9} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~k~0] {14011#(<= ~j~0 8)} is VALID [2022-02-20 20:09:01,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {14011#(<= ~j~0 8)} [171] L696-4-->L696-5: Formula: true InVars {} OutVars{t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_5|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~post3] {14011#(<= ~j~0 8)} is VALID [2022-02-20 20:09:01,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {14011#(<= ~j~0 8)} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 5) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {14011#(<= ~j~0 8)} is VALID [2022-02-20 20:09:01,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {14011#(<= ~j~0 8)} [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] {14147#(and (<= ~j~0 8) (<= ~i~0 (+ ~j~0 1)))} is VALID [2022-02-20 20:09:01,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {14147#(and (<= ~j~0 8) (<= ~i~0 (+ ~j~0 1)))} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (<= 16 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] {14013#(and (<= ~j~0 8) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:01,796 INFO L290 TraceCheckUtils]: 45: Hoare triple {14013#(and (<= ~j~0 8) (= |ULTIMATE.start_main_~condI~0#1| 0))} [114] L717-->L720: Formula: (= (ite (<= 16 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] {14014#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:01,797 INFO L290 TraceCheckUtils]: 46: Hoare triple {14014#(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[] {14008#false} is VALID [2022-02-20 20:09:01,797 INFO L290 TraceCheckUtils]: 47: Hoare triple {14008#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14008#false} is VALID [2022-02-20 20:09:01,797 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:01,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 20:09:02,052 INFO L290 TraceCheckUtils]: 47: Hoare triple {14008#false} [155] L722-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14008#false} is VALID [2022-02-20 20:09:02,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {14014#(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[] {14008#false} is VALID [2022-02-20 20:09:02,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {14166#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (< ~j~0 16))} [114] L717-->L720: Formula: (= (ite (<= 16 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] {14014#(and (= |ULTIMATE.start_main_~condJ~0#1| 0) (= |ULTIMATE.start_main_~condI~0#1| 0))} is VALID [2022-02-20 20:09:02,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {14170#(and (not (<= 16 ~i~0)) (< ~j~0 16))} [102] L715-->L717: Formula: (= |v_ULTIMATE.start_main_~condI~0#1_2| (ite (<= 16 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] {14166#(and (= |ULTIMATE.start_main_~condI~0#1| 0) (< ~j~0 16))} is VALID [2022-02-20 20:09:02,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {14174#(< ~j~0 15)} [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] {14170#(and (not (<= 16 ~i~0)) (< ~j~0 16))} is VALID [2022-02-20 20:09:02,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {14174#(< ~j~0 15)} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 5) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {14174#(< ~j~0 15)} is VALID [2022-02-20 20:09:02,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {14174#(< ~j~0 15)} [171] L696-4-->L696-5: Formula: true InVars {} OutVars{t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_5|} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~post3] {14174#(< ~j~0 15)} is VALID [2022-02-20 20:09:02,055 INFO L290 TraceCheckUtils]: 40: Hoare triple {14174#(< ~j~0 15)} [170] L696-3-->L696-4: Formula: (= v_t1Thread1of1ForFork0_~k~0_9 (+ |v_t1Thread1of1ForFork0_#t~post3_3| 1)) InVars {t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_3|} OutVars{t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_3|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_9} AuxVars[] AssignedVars[t1Thread1of1ForFork0_~k~0] {14174#(< ~j~0 15)} is VALID [2022-02-20 20:09:02,057 INFO L290 TraceCheckUtils]: 39: Hoare triple {14174#(< ~j~0 15)} [169] L699-->L696-3: Formula: (= |v_t1Thread1of1ForFork0_#t~post3_1| v_t1Thread1of1ForFork0_~k~0_7) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_7} OutVars{t1Thread1of1ForFork0_#t~post3=|v_t1Thread1of1ForFork0_#t~post3_1|, t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_7} AuxVars[] AssignedVars[t1Thread1of1ForFork0_#t~post3] {14174#(< ~j~0 15)} is VALID [2022-02-20 20:09:02,058 INFO L290 TraceCheckUtils]: 38: Hoare triple {14190#(< ~i~0 14)} [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] {14174#(< ~j~0 15)} is VALID [2022-02-20 20:09:02,058 INFO L290 TraceCheckUtils]: 37: Hoare triple {14190#(< ~i~0 14)} [176] L704-5-->L705: Formula: (< v_t2Thread1of1ForFork1_~k~1_5 5) InVars {t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} OutVars{t2Thread1of1ForFork1_~k~1=v_t2Thread1of1ForFork1_~k~1_5} AuxVars[] AssignedVars[] {14190#(< ~i~0 14)} is VALID [2022-02-20 20:09:02,058 INFO L290 TraceCheckUtils]: 36: Hoare triple {14190#(< ~i~0 14)} [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] {14190#(< ~i~0 14)} is VALID [2022-02-20 20:09:02,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {14190#(< ~i~0 14)} [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] {14190#(< ~i~0 14)} is VALID [2022-02-20 20:09:02,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {14203#(< ~j~0 13)} [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] {14190#(< ~i~0 14)} is VALID [2022-02-20 20:09:02,060 INFO L290 TraceCheckUtils]: 33: Hoare triple {14203#(< ~j~0 13)} [165] L696-5-->L697: Formula: (< v_t1Thread1of1ForFork0_~k~0_5 5) InVars {t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} OutVars{t1Thread1of1ForFork0_~k~0=v_t1Thread1of1ForFork0_~k~0_5} AuxVars[] AssignedVars[] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,060 INFO L290 TraceCheckUtils]: 31: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,061 INFO L290 TraceCheckUtils]: 27: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,062 INFO L290 TraceCheckUtils]: 25: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,062 INFO L290 TraceCheckUtils]: 24: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {14203#(< ~j~0 13)} [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] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {14203#(< ~j~0 13)} [141] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {14203#(< ~j~0 13)} [154] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {14007#true} [117] L694-->L-1-3: Formula: (= 6 v_~j~0_1) InVars {} OutVars{~j~0=v_~j~0_1} AuxVars[] AssignedVars[~j~0] {14203#(< ~j~0 13)} is VALID [2022-02-20 20:09:02,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {14007#true} [124] L693-4-->L694: Formula: (= 3 v_~i~0_1) InVars {} OutVars{~i~0=v_~i~0_1} AuxVars[] AssignedVars[~i~0] {14007#true} is VALID [2022-02-20 20:09:02,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {14007#true} [137] L693-3-->L693-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= 15 (select |v_#length_2| 2))) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {14007#true} is VALID [2022-02-20 20:09:02,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {14007#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[] {14007#true} is VALID [2022-02-20 20:09:02,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {14007#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[] {14007#true} is VALID [2022-02-20 20:09:02,068 INFO L290 TraceCheckUtils]: 4: Hoare triple {14007#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[] {14007#true} is VALID [2022-02-20 20:09:02,069 INFO L290 TraceCheckUtils]: 3: Hoare triple {14007#true} [153] L-1-2-->L693: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {14007#true} is VALID [2022-02-20 20:09:02,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {14007#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[] {14007#true} is VALID [2022-02-20 20:09:02,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {14007#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] {14007#true} is VALID [2022-02-20 20:09:02,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {14007#true} [145] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14007#true} is VALID [2022-02-20 20:09:02,069 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:02,069 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429364226] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 20:09:02,070 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 20:09:02,070 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2022-02-20 20:09:02,070 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730351898] [2022-02-20 20:09:02,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 20:09:02,071 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 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:02,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:09:02,071 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 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:02,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:09:02,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 20:09:02,121 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:09:02,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 20:09:02,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-02-20 20:09:02,123 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 70 [2022-02-20 20:09:02,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 85 transitions, 555 flow. Second operand has 14 states, 14 states have (on average 56.57142857142857) internal successors, (792), 14 states have internal predecessors, (792), 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:02,123 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:09:02,123 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 70 [2022-02-20 20:09:02,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:09:05,565 INFO L129 PetriNetUnfolder]: 55/317 cut-off events. [2022-02-20 20:09:05,565 INFO L130 PetriNetUnfolder]: For 1620/1661 co-relation queries the response was YES. [2022-02-20 20:09:05,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 317 events. 55/317 cut-off events. For 1620/1661 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1278 event pairs, 1 based on Foata normal form. 23/309 useless extension candidates. Maximal degree in co-relation 943. Up to 67 conditions per place. [2022-02-20 20:09:05,568 INFO L132 encePairwiseOnDemand]: 63/70 looper letters, 27 selfloop transitions, 38 changer transitions 14/124 dead transitions. [2022-02-20 20:09:05,568 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 124 transitions, 1327 flow [2022-02-20 20:09:05,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 20:09:05,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-02-20 20:09:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1159 transitions. [2022-02-20 20:09:05,576 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8278571428571428 [2022-02-20 20:09:05,576 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1159 transitions. [2022-02-20 20:09:05,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1159 transitions. [2022-02-20 20:09:05,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:09:05,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1159 transitions. [2022-02-20 20:09:05,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 57.95) internal successors, (1159), 20 states have internal predecessors, (1159), 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,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 70.0) internal successors, (1470), 21 states have internal predecessors, (1470), 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,580 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 70.0) internal successors, (1470), 21 states have internal predecessors, (1470), 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,580 INFO L186 Difference]: Start difference. First operand has 111 places, 85 transitions, 555 flow. Second operand 20 states and 1159 transitions. [2022-02-20 20:09:05,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 124 transitions, 1327 flow