./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_11-traces-max-simple_true.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/goblint-regression/36-apron_11-traces-max-simple_true.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 6ec45a8cc5eb531168b9afc45cc8af1360572640b5394bd745e0b1188f31bc79 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:44:36,150 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:44:36,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:44:36,189 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:44:36,189 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:44:36,192 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:44:36,193 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:44:36,196 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:44:36,198 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:44:36,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:44:36,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:44:36,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:44:36,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:44:36,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:44:36,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:44:36,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:44:36,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:44:36,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:44:36,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:44:36,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:44:36,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:44:36,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:44:36,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:44:36,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:44:36,229 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:44:36,229 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:44:36,229 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:44:36,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:44:36,231 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:44:36,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:44:36,232 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:44:36,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:44:36,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:44:36,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:44:36,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:44:36,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:44:36,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:44:36,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:44:36,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:44:36,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:44:36,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:44:36,241 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:44:36,266 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:44:36,266 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:44:36,267 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:44:36,267 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:44:36,268 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:44:36,268 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:44:36,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:44:36,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:44:36,269 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:44:36,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:44:36,270 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:44:36,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:44:36,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:44:36,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:44:36,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:44:36,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:44:36,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:44:36,272 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:44:36,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:44:36,272 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:44:36,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:44:36,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:44:36,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:44:36,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:44:36,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:44:36,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:44:36,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:44:36,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:44:36,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:44:36,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:44:36,275 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:44:36,275 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:44:36,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:44:36,276 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 -> 6ec45a8cc5eb531168b9afc45cc8af1360572640b5394bd745e0b1188f31bc79 [2022-02-20 20:44:36,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:44:36,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:44:36,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:44:36,522 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:44:36,522 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:44:36,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_11-traces-max-simple_true.i [2022-02-20 20:44:36,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ccc4f29/f66d635c12c7491fb2cab5e8647d826f/FLAG98461406a [2022-02-20 20:44:37,014 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:44:37,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_11-traces-max-simple_true.i [2022-02-20 20:44:37,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ccc4f29/f66d635c12c7491fb2cab5e8647d826f/FLAG98461406a [2022-02-20 20:44:37,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6ccc4f29/f66d635c12c7491fb2cab5e8647d826f [2022-02-20 20:44:37,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:44:37,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:44:37,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:44:37,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:44:37,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:44:37,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409c1756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37, skipping insertion in model container [2022-02-20 20:44:37,047 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:44:37,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:44:37,212 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/goblint-regression/36-apron_11-traces-max-simple_true.i[1089,1102] [2022-02-20 20:44:37,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:44:37,384 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:44:37,396 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/goblint-regression/36-apron_11-traces-max-simple_true.i[1089,1102] [2022-02-20 20:44:37,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:44:37,471 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:44:37,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37 WrapperNode [2022-02-20 20:44:37,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:44:37,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:44:37,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:44:37,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:44:37,479 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:44:37" (1/1) ... [2022-02-20 20:44:37,505 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:44:37" (1/1) ... [2022-02-20 20:44:37,532 INFO L137 Inliner]: procedures = 162, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2022-02-20 20:44:37,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:44:37,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:44:37,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:44:37,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:44:37,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:44:37,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:44:37,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:44:37,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:44:37,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (1/1) ... [2022-02-20 20:44:37,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:44:37,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:44:37,608 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:44:37,639 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:44:37,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:44:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:44:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:44:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:44:37,650 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:44:37,650 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:44:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:44:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:44:37,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:44:37,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:44:37,653 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:44:37,797 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:44:37,805 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:44:37,953 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:44:37,962 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:44:37,963 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:44:37,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:44:37 BoogieIcfgContainer [2022-02-20 20:44:37,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:44:37,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:44:37,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:44:37,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:44:37,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:44:37" (1/3) ... [2022-02-20 20:44:37,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f6f463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:44:37, skipping insertion in model container [2022-02-20 20:44:37,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:44:37" (2/3) ... [2022-02-20 20:44:37,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63f6f463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:44:37, skipping insertion in model container [2022-02-20 20:44:37,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:44:37" (3/3) ... [2022-02-20 20:44:37,972 INFO L111 eAbstractionObserver]: Analyzing ICFG 36-apron_11-traces-max-simple_true.i [2022-02-20 20:44:37,976 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:44:37,976 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:44:37,977 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 20:44:37,977 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:44:38,033 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,034 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,037 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,038 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,039 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,040 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,041 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,042 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,043 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,044 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,045 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,046 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,049 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,052 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,053 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,054 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:44:38,056 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:44:38,100 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:44:38,106 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:44:38,106 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 20:44:38,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 68 transitions, 141 flow [2022-02-20 20:44:38,144 INFO L129 PetriNetUnfolder]: 2/67 cut-off events. [2022-02-20 20:44:38,144 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:44:38,147 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 67 events. 2/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 40. Up to 2 conditions per place. [2022-02-20 20:44:38,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 68 transitions, 141 flow [2022-02-20 20:44:38,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 67 transitions, 137 flow [2022-02-20 20:44:38,170 INFO L129 PetriNetUnfolder]: 1/50 cut-off events. [2022-02-20 20:44:38,170 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:44:38,170 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:44:38,171 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] [2022-02-20 20:44:38,172 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:44:38,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:44:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2005908045, now seen corresponding path program 1 times [2022-02-20 20:44:38,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:44:38,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424144681] [2022-02-20 20:44:38,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:44:38,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:44:38,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:44:38,498 INFO L290 TraceCheckUtils]: 0: Hoare triple {73#true} [130] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:44:38,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {73#true} [115] 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] {73#true} is VALID [2022-02-20 20:44:38,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {73#true} [136] 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[] {73#true} is VALID [2022-02-20 20:44:38,500 INFO L290 TraceCheckUtils]: 3: Hoare triple {73#true} [139] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:44:38,501 INFO L290 TraceCheckUtils]: 4: Hoare triple {73#true} [100] L18-->L18-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[] {73#true} is VALID [2022-02-20 20:44:38,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {73#true} [131] L18-1-->L18-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[] {73#true} is VALID [2022-02-20 20:44:38,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {73#true} [123] L18-2-->L18-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[] {73#true} is VALID [2022-02-20 20:44:38,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {73#true} [125] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 37)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:44:38,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {73#true} [126] L18-4-->L682: Formula: (= v_~g~0_1 1) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {73#true} is VALID [2022-02-20 20:44:38,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {73#true} [80] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {73#true} is VALID [2022-02-20 20:44:38,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {73#true} [101] L682-1-->L682-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:44:38,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {73#true} [82] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:44:38,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {73#true} [138] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:44:38,505 INFO L290 TraceCheckUtils]: 13: Hoare triple {73#true} [111] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:44:38,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {73#true} [143] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:44:38,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {73#true} [92] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:44:38,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {73#true} [133] L682-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:44:38,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {73#true} [142] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:44:38,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {73#true} [124] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {73#true} is VALID [2022-02-20 20:44:38,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {73#true} [85] L-1-5-->L691: Formula: true InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre2#1] {73#true} is VALID [2022-02-20 20:44:38,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {73#true} [113] L691-->L691-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1] {73#true} is VALID [2022-02-20 20:44:38,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {73#true} [144] L691-1-->L692: Formula: true InVars {} OutVars{ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0#1] {73#true} is VALID [2022-02-20 20:44:38,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {73#true} [112] L692-->L692-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {73#true} is VALID [2022-02-20 20:44:38,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {73#true} [120] L692-1-->L693: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {73#true} is VALID [2022-02-20 20:44:38,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {73#true} [132] L693-->L693-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {73#true} is VALID [2022-02-20 20:44:38,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {73#true} [81] L693-1-->L693-2: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {73#true} is VALID [2022-02-20 20:44:38,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {73#true} [164] L693-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre2#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_6|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_6|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_10|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_thidvar0] {73#true} is VALID [2022-02-20 20:44:38,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {73#true} [146] t_funENTRY-->L684: Formula: (and (= |v_t_funThread1of1ForFork0_~arg#1.offset_1| |v_t_funThread1of1ForFork0_#in~arg#1.offset_1|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_1| |v_t_funThread1of1ForFork0_~arg#1.base_1|)) InVars {t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base] {73#true} is VALID [2022-02-20 20:44:38,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {73#true} [147] L684-->L684-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#A~0.base_10|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet1#1_1| 0) (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#A~0.base_10| (store .cse0 |v_~#A~0.offset_10| 1))) (= (select .cse0 |v_~#A~0.offset_10|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#A~0.offset=|v_~#A~0.offset_10|, ~#A~0.base=|v_~#A~0.base_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_1|, ~#A~0.offset=|v_~#A~0.offset_10|, ~#A~0.base=|v_~#A~0.base_10|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1] {73#true} is VALID [2022-02-20 20:44:38,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {73#true} [148] L684-1-->L685: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1#1] {73#true} is VALID [2022-02-20 20:44:38,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {73#true} [149] L685-->L686: Formula: (= 2 v_~g~0_4) InVars {} OutVars{~g~0=v_~g~0_4} AuxVars[] AssignedVars[~g~0] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:44:38,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {75#(= 2 ~g~0)} [150] L686-->L686-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {75#(= 2 ~g~0)} is VALID [2022-02-20 20:44:38,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {75#(= 2 ~g~0)} [151] L686-1-->L686-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1| (ite (= 2 v_~g~0_5) 1 0)) InVars {~g~0=v_~g~0_5} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_5} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1] {76#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:44:38,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {76#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [152] L686-2-->L19: Formula: true InVars {} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {76#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:44:38,530 INFO L290 TraceCheckUtils]: 34: Hoare triple {76#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1| 0))} [153] L19-->L19-1: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3| |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|) InVars {t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_3|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0___VERIFIER_assert_~cond#1] {77#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:44:38,531 INFO L290 TraceCheckUtils]: 35: Hoare triple {77#(not (= |t_funThread1of1ForFork0___VERIFIER_assert_~cond#1| 0))} [154] L19-1-->L19-2: Formula: (= |v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5| 0) InVars {t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} OutVars{t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_5|} AuxVars[] AssignedVars[] {74#false} is VALID [2022-02-20 20:44:38,531 INFO L290 TraceCheckUtils]: 36: Hoare triple {74#false} [156] L19-2-->t_funErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {74#false} is VALID [2022-02-20 20:44:38,532 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:44:38,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:44:38,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424144681] [2022-02-20 20:44:38,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424144681] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:44:38,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:44:38,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:44:38,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463470193] [2022-02-20 20:44:38,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:44:38,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2022-02-20 20:44:38,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:44:38,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 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:44:38,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:44:38,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:44:38,623 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:44:38,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:44:38,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:44:38,646 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 68 [2022-02-20 20:44:38,653 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 55.4) internal successors, (277), 5 states have internal predecessors, (277), 0 states have call successors, (0), 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:44:38,653 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:44:38,653 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 68 [2022-02-20 20:44:38,654 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:44:38,763 INFO L129 PetriNetUnfolder]: 10/91 cut-off events. [2022-02-20 20:44:38,764 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:44:38,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 91 events. 10/91 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 177 event pairs, 0 based on Foata normal form. 6/96 useless extension candidates. Maximal degree in co-relation 91. Up to 10 conditions per place. [2022-02-20 20:44:38,767 INFO L132 encePairwiseOnDemand]: 63/68 looper letters, 12 selfloop transitions, 3 changer transitions 9/67 dead transitions. [2022-02-20 20:44:38,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 167 flow [2022-02-20 20:44:38,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 20:44:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-02-20 20:44:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 290 transitions. [2022-02-20 20:44:38,794 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8529411764705882 [2022-02-20 20:44:38,794 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 290 transitions. [2022-02-20 20:44:38,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 290 transitions. [2022-02-20 20:44:38,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:44:38,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 290 transitions. [2022-02-20 20:44:38,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 58.0) internal successors, (290), 5 states have internal predecessors, (290), 0 states have call successors, (0), 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:44:38,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 68.0) internal successors, (408), 6 states have internal predecessors, (408), 0 states have call successors, (0), 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:44:38,808 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 68.0) internal successors, (408), 6 states have internal predecessors, (408), 0 states have call successors, (0), 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:44:38,809 INFO L186 Difference]: Start difference. First operand has 69 places, 67 transitions, 137 flow. Second operand 5 states and 290 transitions. [2022-02-20 20:44:38,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 167 flow [2022-02-20 20:44:38,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:44:38,820 INFO L242 Difference]: Finished difference. Result has 68 places, 52 transitions, 112 flow [2022-02-20 20:44:38,821 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=68, PETRI_TRANSITIONS=52} [2022-02-20 20:44:38,826 INFO L334 CegarLoopForPetriNet]: 69 programPoint places, -1 predicate places. [2022-02-20 20:44:38,827 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 52 transitions, 112 flow [2022-02-20 20:44:38,851 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 209 states, 208 states have (on average 1.75) internal successors, (364), 208 states have internal predecessors, (364), 0 states have call successors, (0), 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:44:38,852 INFO L78 Accepts]: Start accepts. Automaton has has 209 states, 208 states have (on average 1.75) internal successors, (364), 208 states have internal predecessors, (364), 0 states have call successors, (0), 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 37 [2022-02-20 20:44:38,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:44:38,854 INFO L470 AbstractCegarLoop]: Abstraction has has 68 places, 52 transitions, 112 flow [2022-02-20 20:44:38,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 55.4) internal successors, (277), 5 states have internal predecessors, (277), 0 states have call successors, (0), 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:44:38,855 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:44:38,855 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:44:38,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:44:38,855 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:44:38,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:44:38,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1512868232, now seen corresponding path program 1 times [2022-02-20 20:44:38,856 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:44:38,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802266894] [2022-02-20 20:44:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:44:38,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:44:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:44:38,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {293#true} [130] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-02-20 20:44:38,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#true} [115] 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] {293#true} is VALID [2022-02-20 20:44:38,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#true} [136] 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[] {293#true} is VALID [2022-02-20 20:44:38,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {293#true} [139] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {293#true} is VALID [2022-02-20 20:44:38,997 INFO L290 TraceCheckUtils]: 4: Hoare triple {293#true} [100] L18-->L18-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[] {293#true} is VALID [2022-02-20 20:44:38,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#true} [131] L18-1-->L18-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[] {293#true} is VALID [2022-02-20 20:44:38,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {293#true} [123] L18-2-->L18-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[] {293#true} is VALID [2022-02-20 20:44:38,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {293#true} [125] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 37)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {293#true} is VALID [2022-02-20 20:44:38,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#true} [126] L18-4-->L682: Formula: (= v_~g~0_1 1) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {293#true} is VALID [2022-02-20 20:44:38,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#true} [80] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {293#true} is VALID [2022-02-20 20:44:38,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {293#true} [101] L682-1-->L682-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {293#true} is VALID [2022-02-20 20:44:38,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {293#true} [82] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {293#true} is VALID [2022-02-20 20:44:38,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#true} [138] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {293#true} is VALID [2022-02-20 20:44:38,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {293#true} [111] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {293#true} is VALID [2022-02-20 20:44:39,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {293#true} [143] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {293#true} is VALID [2022-02-20 20:44:39,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {293#true} [92] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {293#true} is VALID [2022-02-20 20:44:39,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {293#true} [133] L682-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-02-20 20:44:39,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {293#true} [142] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#true} is VALID [2022-02-20 20:44:39,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {293#true} [124] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {293#true} is VALID [2022-02-20 20:44:39,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {293#true} [85] L-1-5-->L691: Formula: true InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre2#1] {293#true} is VALID [2022-02-20 20:44:39,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {293#true} [113] L691-->L691-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1] {293#true} is VALID [2022-02-20 20:44:39,003 INFO L290 TraceCheckUtils]: 21: Hoare triple {293#true} [144] L691-1-->L692: Formula: true InVars {} OutVars{ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0#1] {293#true} is VALID [2022-02-20 20:44:39,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {293#true} [112] L692-->L692-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {293#true} is VALID [2022-02-20 20:44:39,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {293#true} [120] L692-1-->L693: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {293#true} is VALID [2022-02-20 20:44:39,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {293#true} [132] L693-->L693-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {293#true} is VALID [2022-02-20 20:44:39,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {293#true} [81] L693-1-->L693-2: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {293#true} is VALID [2022-02-20 20:44:39,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {293#true} [164] L693-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre2#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_6|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_6|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_10|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_thidvar0] {293#true} is VALID [2022-02-20 20:44:39,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {293#true} [117] L693-3-->L693-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {293#true} is VALID [2022-02-20 20:44:39,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {293#true} [102] L693-4-->L694: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {293#true} is VALID [2022-02-20 20:44:39,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {293#true} [95] L694-->L694-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet4#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|, #pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, #pthreadsMutex] {293#true} is VALID [2022-02-20 20:44:39,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {293#true} [121] L694-1-->L695: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {293#true} is VALID [2022-02-20 20:44:39,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {293#true} [140] L695-->L696: Formula: (= |v_ULTIMATE.start_main_~x~0#1_3| v_~g~0_2) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_3|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1] {295#(= ~g~0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-20 20:44:39,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {295#(= ~g~0 |ULTIMATE.start_main_~x~0#1|)} [127] L696-->L697: Formula: (= |v_ULTIMATE.start_main_~y~0#1_3| v_~g~0_3) InVars {~g~0=v_~g~0_3} OutVars{ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_3|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0#1] {296#(= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 20:44:39,011 INFO L290 TraceCheckUtils]: 33: Hoare triple {296#(= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)} [106] L697-->L697-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {296#(= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 20:44:39,012 INFO L290 TraceCheckUtils]: 34: Hoare triple {296#(= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)} [86] L697-1-->L697-2: Formula: (= (ite (= |v_ULTIMATE.start_main_~x~0#1_4| |v_ULTIMATE.start_main_~y~0#1_4|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_4|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_4|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_4|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {297#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:44:39,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {297#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [79] L697-2-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {297#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:44:39,013 INFO L290 TraceCheckUtils]: 36: Hoare triple {297#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [105] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {298#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:44:39,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {298#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [96] L19-1-->L19-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {294#false} is VALID [2022-02-20 20:44:39,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {294#false} [109] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {294#false} is VALID [2022-02-20 20:44:39,015 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:44:39,015 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:44:39,015 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802266894] [2022-02-20 20:44:39,015 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802266894] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:44:39,015 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:44:39,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 20:44:39,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492630483] [2022-02-20 20:44:39,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:44:39,017 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:44:39,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:44:39,018 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:44:39,055 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:44:39,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 20:44:39,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:44:39,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 20:44:39,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 20:44:39,057 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 68 [2022-02-20 20:44:39,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 52 transitions, 112 flow. Second operand has 6 states, 6 states have (on average 51.833333333333336) internal successors, (311), 6 states have internal predecessors, (311), 0 states have call successors, (0), 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:44:39,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:44:39,059 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 68 [2022-02-20 20:44:39,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:44:39,239 INFO L129 PetriNetUnfolder]: 16/118 cut-off events. [2022-02-20 20:44:39,239 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2022-02-20 20:44:39,240 INFO L84 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 118 events. 16/118 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 380 event pairs, 5 based on Foata normal form. 5/123 useless extension candidates. Maximal degree in co-relation 169. Up to 25 conditions per place. [2022-02-20 20:44:39,240 INFO L132 encePairwiseOnDemand]: 62/68 looper letters, 11 selfloop transitions, 2 changer transitions 18/70 dead transitions. [2022-02-20 20:44:39,240 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 70 transitions, 232 flow [2022-02-20 20:44:39,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 20:44:39,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-02-20 20:44:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 483 transitions. [2022-02-20 20:44:39,247 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7892156862745098 [2022-02-20 20:44:39,247 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 483 transitions. [2022-02-20 20:44:39,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 483 transitions. [2022-02-20 20:44:39,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:44:39,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 483 transitions. [2022-02-20 20:44:39,249 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 53.666666666666664) internal successors, (483), 9 states have internal predecessors, (483), 0 states have call successors, (0), 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:44:39,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 68.0) internal successors, (680), 10 states have internal predecessors, (680), 0 states have call successors, (0), 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:44:39,251 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 68.0) internal successors, (680), 10 states have internal predecessors, (680), 0 states have call successors, (0), 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:44:39,251 INFO L186 Difference]: Start difference. First operand has 68 places, 52 transitions, 112 flow. Second operand 9 states and 483 transitions. [2022-02-20 20:44:39,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 70 transitions, 232 flow [2022-02-20 20:44:39,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 70 transitions, 205 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-02-20 20:44:39,254 INFO L242 Difference]: Finished difference. Result has 71 places, 52 transitions, 127 flow [2022-02-20 20:44:39,254 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=127, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2022-02-20 20:44:39,255 INFO L334 CegarLoopForPetriNet]: 69 programPoint places, 2 predicate places. [2022-02-20 20:44:39,255 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 71 places, 52 transitions, 127 flow [2022-02-20 20:44:39,258 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 131 states, 130 states have (on average 1.6) internal successors, (208), 130 states have internal predecessors, (208), 0 states have call successors, (0), 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:44:39,259 INFO L78 Accepts]: Start accepts. Automaton has has 131 states, 130 states have (on average 1.6) internal successors, (208), 130 states have internal predecessors, (208), 0 states have call successors, (0), 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:44:39,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:44:39,260 INFO L470 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 127 flow [2022-02-20 20:44:39,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.833333333333336) internal successors, (311), 6 states have internal predecessors, (311), 0 states have call successors, (0), 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:44:39,260 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:44:39,260 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:44:39,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:44:39,261 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:44:39,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:44:39,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1154435730, now seen corresponding path program 1 times [2022-02-20 20:44:39,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:44:39,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109611769] [2022-02-20 20:44:39,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:44:39,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:44:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:44:39,371 INFO L290 TraceCheckUtils]: 0: Hoare triple {449#true} [130] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {449#true} is VALID [2022-02-20 20:44:39,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#true} [115] 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] {449#true} is VALID [2022-02-20 20:44:39,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {449#true} [136] 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[] {449#true} is VALID [2022-02-20 20:44:39,372 INFO L290 TraceCheckUtils]: 3: Hoare triple {449#true} [139] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {449#true} is VALID [2022-02-20 20:44:39,373 INFO L290 TraceCheckUtils]: 4: Hoare triple {449#true} [100] L18-->L18-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[] {449#true} is VALID [2022-02-20 20:44:39,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {449#true} [131] L18-1-->L18-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[] {449#true} is VALID [2022-02-20 20:44:39,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {449#true} [123] L18-2-->L18-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[] {449#true} is VALID [2022-02-20 20:44:39,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {449#true} [125] L18-3-->L18-4: Formula: (and (= (select |v_#valid_3| 2) 1) (= (select |v_#length_2| 2) 37)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {449#true} is VALID [2022-02-20 20:44:39,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {449#true} [126] L18-4-->L682: Formula: (= v_~g~0_1 1) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {449#true} is VALID [2022-02-20 20:44:39,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {449#true} [80] L682-->L682-1: Formula: (and (= |v_~#A~0.offset_1| 0) (= 3 |v_~#A~0.base_1|)) InVars {} OutVars{~#A~0.offset=|v_~#A~0.offset_1|, ~#A~0.base=|v_~#A~0.base_1|} AuxVars[] AssignedVars[~#A~0.offset, ~#A~0.base] {449#true} is VALID [2022-02-20 20:44:39,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {449#true} [101] L682-1-->L682-2: Formula: (and (= (select |v_#length_3| 3) 24) (= (select |v_#valid_4| 3) 1)) InVars {#length=|v_#length_3|, #valid=|v_#valid_4|} OutVars{#length=|v_#length_3|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[] {449#true} is VALID [2022-02-20 20:44:39,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {449#true} [82] L682-2-->L682-3: Formula: (= (select (select |v_#memory_int_3| |v_~#A~0.base_2|) |v_~#A~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} OutVars{#memory_int=|v_#memory_int_3|, ~#A~0.offset=|v_~#A~0.offset_2|, ~#A~0.base=|v_~#A~0.base_2|} AuxVars[] AssignedVars[] {449#true} is VALID [2022-02-20 20:44:39,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {449#true} [138] L682-3-->L682-4: Formula: (= (select (select |v_#memory_int_4| |v_~#A~0.base_3|) (+ |v_~#A~0.offset_3| 4)) 0) InVars {#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} OutVars{#memory_int=|v_#memory_int_4|, ~#A~0.offset=|v_~#A~0.offset_3|, ~#A~0.base=|v_~#A~0.base_3|} AuxVars[] AssignedVars[] {449#true} is VALID [2022-02-20 20:44:39,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {449#true} [111] L682-4-->L682-5: Formula: (= (select (select |v_#memory_int_5| |v_~#A~0.base_4|) (+ |v_~#A~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} OutVars{#memory_int=|v_#memory_int_5|, ~#A~0.offset=|v_~#A~0.offset_4|, ~#A~0.base=|v_~#A~0.base_4|} AuxVars[] AssignedVars[] {449#true} is VALID [2022-02-20 20:44:39,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {449#true} [143] L682-5-->L682-6: Formula: (= (select (select |v_#memory_int_6| |v_~#A~0.base_5|) (+ |v_~#A~0.offset_5| 12)) ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP) InVars {#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} OutVars{#memory_int=|v_#memory_int_6|, ~#A~0.offset=|v_~#A~0.offset_5|, ~#A~0.base=|v_~#A~0.base_5|} AuxVars[] AssignedVars[] {449#true} is VALID [2022-02-20 20:44:39,375 INFO L290 TraceCheckUtils]: 15: Hoare triple {449#true} [92] L682-6-->L682-7: Formula: (= (select (select |v_#memory_int_7| |v_~#A~0.base_6|) (+ |v_~#A~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} OutVars{#memory_int=|v_#memory_int_7|, ~#A~0.offset=|v_~#A~0.offset_6|, ~#A~0.base=|v_~#A~0.base_6|} AuxVars[] AssignedVars[] {449#true} is VALID [2022-02-20 20:44:39,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {449#true} [133] L682-7-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {449#true} is VALID [2022-02-20 20:44:39,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {449#true} [142] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {449#true} is VALID [2022-02-20 20:44:39,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {449#true} [124] L-1-4-->L-1-5: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] {449#true} is VALID [2022-02-20 20:44:39,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {449#true} [85] L-1-5-->L691: Formula: true InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_1|, ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_1|, ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_1|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_#t~nondet4#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre2#1] {449#true} is VALID [2022-02-20 20:44:39,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {449#true} [113] L691-->L691-1: Formula: true InVars {} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1] {449#true} is VALID [2022-02-20 20:44:39,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {449#true} [144] L691-1-->L692: Formula: true InVars {} OutVars{ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0#1] {449#true} is VALID [2022-02-20 20:44:39,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {449#true} [112] L692-->L692-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= |v_#length_4| (store |v_#length_5| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #valid=|v_#valid_6|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_2|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {449#true} is VALID [2022-02-20 20:44:39,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {449#true} [120] L692-1-->L693: Formula: (= |v_ULTIMATE.start_main_#t~pre2#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {449#true} is VALID [2022-02-20 20:44:39,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {449#true} [132] L693-->L693-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {449#true} is VALID [2022-02-20 20:44:39,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {449#true} [81] L693-1-->L693-2: Formula: (= (store |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_9| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre2#1_3|)) |v_#memory_int_8|) InVars {#memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} OutVars{#memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_3|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_3|, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_3|} AuxVars[] AssignedVars[#memory_int] {449#true} is VALID [2022-02-20 20:44:39,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {449#true} [164] L693-2-->t_funENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre2#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_4| 0) (= |v_t_funThread1of1ForFork0_#in~arg#1.offset_4| 0) (= v_t_funThread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} OutVars{t_funThread1of1ForFork0_#res#1.offset=|v_t_funThread1of1ForFork0_#res#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1_6|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_6|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_4|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_4|, t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_4|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res#1.base=|v_t_funThread1of1ForFork0_#res#1.base_4|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_4|, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1=|v_t_funThread1of1ForFork0___VERIFIER_assert_~cond#1_10|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_6|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#res#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_#in~cond#1, t_funThread1of1ForFork0_#t~nondet1#1, t_funThread1of1ForFork0_#in~arg#1.base, t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res#1.base, t_funThread1of1ForFork0_#in~arg#1.offset, t_funThread1of1ForFork0___VERIFIER_assert_~cond#1, t_funThread1of1ForFork0_thidvar0] {449#true} is VALID [2022-02-20 20:44:39,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {449#true} [146] t_funENTRY-->L684: Formula: (and (= |v_t_funThread1of1ForFork0_~arg#1.offset_1| |v_t_funThread1of1ForFork0_#in~arg#1.offset_1|) (= |v_t_funThread1of1ForFork0_#in~arg#1.base_1| |v_t_funThread1of1ForFork0_~arg#1.base_1|)) InVars {t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|} OutVars{t_funThread1of1ForFork0_~arg#1.base=|v_t_funThread1of1ForFork0_~arg#1.base_1|, t_funThread1of1ForFork0_#in~arg#1.offset=|v_t_funThread1of1ForFork0_#in~arg#1.offset_1|, t_funThread1of1ForFork0_#in~arg#1.base=|v_t_funThread1of1ForFork0_#in~arg#1.base_1|, t_funThread1of1ForFork0_~arg#1.offset=|v_t_funThread1of1ForFork0_~arg#1.offset_1|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg#1.offset, t_funThread1of1ForFork0_~arg#1.base] {449#true} is VALID [2022-02-20 20:44:39,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {449#true} [147] L684-->L684-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_8| |v_~#A~0.base_10|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet1#1_1| 0) (= |v_#pthreadsMutex_7| (store |v_#pthreadsMutex_8| |v_~#A~0.base_10| (store .cse0 |v_~#A~0.offset_10| 1))) (= (select .cse0 |v_~#A~0.offset_10|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_8|, ~#A~0.offset=|v_~#A~0.offset_10|, ~#A~0.base=|v_~#A~0.base_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_7|, t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_1|, ~#A~0.offset=|v_~#A~0.offset_10|, ~#A~0.base=|v_~#A~0.base_10|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1#1] {451#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:44:39,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {451#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [148] L684-1-->L685: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1#1=|v_t_funThread1of1ForFork0_#t~nondet1#1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1#1] {451#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:44:39,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {451#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [117] L693-3-->L693-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre2#1=|v_ULTIMATE.start_main_#t~pre2#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre2#1] {451#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:44:39,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {451#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [102] L693-4-->L694: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet3#1=|v_ULTIMATE.start_main_#t~nondet3#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3#1] {451#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} is VALID [2022-02-20 20:44:39,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {451#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1)} [95] L694-->L694-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#A~0.base_7|))) (and (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))) (= (select .cse0 |v_~#A~0.offset_7|) 0) (= |v_ULTIMATE.start_main_#t~nondet4#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_2|, #pthreadsMutex=|v_#pthreadsMutex_1|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1, #pthreadsMutex] {450#false} is VALID [2022-02-20 20:44:39,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {450#false} [121] L694-1-->L695: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet4#1=|v_ULTIMATE.start_main_#t~nondet4#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet4#1] {450#false} is VALID [2022-02-20 20:44:39,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {450#false} [140] L695-->L696: Formula: (= |v_ULTIMATE.start_main_~x~0#1_3| v_~g~0_2) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_3|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start_main_~x~0#1] {450#false} is VALID [2022-02-20 20:44:39,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {450#false} [149] L685-->L686: Formula: (= 2 v_~g~0_4) InVars {} OutVars{~g~0=v_~g~0_4} AuxVars[] AssignedVars[~g~0] {450#false} is VALID [2022-02-20 20:44:39,383 INFO L290 TraceCheckUtils]: 36: Hoare triple {450#false} [127] L696-->L697: Formula: (= |v_ULTIMATE.start_main_~y~0#1_3| v_~g~0_3) InVars {~g~0=v_~g~0_3} OutVars{ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_3|, ~g~0=v_~g~0_3} AuxVars[] AssignedVars[ULTIMATE.start_main_~y~0#1] {450#false} is VALID [2022-02-20 20:44:39,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {450#false} [106] L697-->L697-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {450#false} is VALID [2022-02-20 20:44:39,383 INFO L290 TraceCheckUtils]: 38: Hoare triple {450#false} [86] L697-1-->L697-2: Formula: (= (ite (= |v_ULTIMATE.start_main_~x~0#1_4| |v_ULTIMATE.start_main_~y~0#1_4|) 1 0) |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|) InVars {ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_4|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_4|} OutVars{ULTIMATE.start_main_~x~0#1=|v_ULTIMATE.start_main_~x~0#1_4|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ULTIMATE.start_main_~y~0#1=|v_ULTIMATE.start_main_~y~0#1_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {450#false} is VALID [2022-02-20 20:44:39,383 INFO L290 TraceCheckUtils]: 39: Hoare triple {450#false} [79] L697-2-->L19: Formula: true InVars {} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_1|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {450#false} is VALID [2022-02-20 20:44:39,384 INFO L290 TraceCheckUtils]: 40: Hoare triple {450#false} [105] L19-->L19-1: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_2| |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|) InVars {ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_2|, ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_2|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~cond#1] {450#false} is VALID [2022-02-20 20:44:39,384 INFO L290 TraceCheckUtils]: 41: Hoare triple {450#false} [96] L19-1-->L19-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_~cond#1_3| 0) InVars {ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} OutVars{ULTIMATE.start___VERIFIER_assert_~cond#1=|v_ULTIMATE.start___VERIFIER_assert_~cond#1_3|} AuxVars[] AssignedVars[] {450#false} is VALID [2022-02-20 20:44:39,384 INFO L290 TraceCheckUtils]: 42: Hoare triple {450#false} [109] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {450#false} is VALID [2022-02-20 20:44:39,385 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:44:39,385 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:44:39,385 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109611769] [2022-02-20 20:44:39,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109611769] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:44:39,385 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:44:39,386 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 20:44:39,386 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134602278] [2022-02-20 20:44:39,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:44:39,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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:44:39,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:44:39,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 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:44:39,418 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:44:39,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:44:39,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:44:39,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:44:39,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:44:39,422 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 68 [2022-02-20 20:44:39,423 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:44:39,423 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:44:39,423 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 68 [2022-02-20 20:44:39,423 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:44:39,449 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2022-02-20 20:44:39,449 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:44:39,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 35 events. 0/35 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 6 event pairs, 0 based on Foata normal form. 2/37 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2022-02-20 20:44:39,450 INFO L132 encePairwiseOnDemand]: 66/68 looper letters, 0 selfloop transitions, 0 changer transitions 35/35 dead transitions. [2022-02-20 20:44:39,450 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 35 transitions, 93 flow [2022-02-20 20:44:39,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:44:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:44:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-20 20:44:39,454 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2022-02-20 20:44:39,454 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 170 transitions. [2022-02-20 20:44:39,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 170 transitions. [2022-02-20 20:44:39,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:44:39,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 170 transitions. [2022-02-20 20:44:39,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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:44:39,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 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:44:39,456 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 68.0) internal successors, (272), 4 states have internal predecessors, (272), 0 states have call successors, (0), 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:44:39,456 INFO L186 Difference]: Start difference. First operand has 71 places, 52 transitions, 127 flow. Second operand 3 states and 170 transitions. [2022-02-20 20:44:39,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 35 transitions, 93 flow [2022-02-20 20:44:39,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 35 transitions, 91 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:44:39,458 INFO L242 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2022-02-20 20:44:39,458 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=68, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2022-02-20 20:44:39,459 INFO L334 CegarLoopForPetriNet]: 69 programPoint places, -22 predicate places. [2022-02-20 20:44:39,460 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 0 transitions, 0 flow [2022-02-20 20:44:39,460 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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:44:39,460 INFO L78 Accepts]: Start accepts. Automaton has has 1 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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:44:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:44:39,460 INFO L470 AbstractCegarLoop]: Abstraction has has 47 places, 0 transitions, 0 flow [2022-02-20 20:44:39,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:44:39,463 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-02-20 20:44:39,464 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 4 remaining) [2022-02-20 20:44:39,464 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-02-20 20:44:39,464 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-02-20 20:44:39,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:44:39,470 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:44:39,474 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:44:39,474 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:44:39,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:44:39 BasicIcfg [2022-02-20 20:44:39,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:44:39,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:44:39,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:44:39,482 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:44:39,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:44:37" (3/4) ... [2022-02-20 20:44:39,484 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:44:39,488 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-02-20 20:44:39,492 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 20:44:39,492 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:44:39,495 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:44:39,495 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:44:39,531 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:44:39,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:44:39,533 INFO L158 Benchmark]: Toolchain (without parser) took 2493.98ms. Allocated memory is still 117.4MB. Free memory was 84.4MB in the beginning and 75.4MB in the end (delta: 9.0MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2022-02-20 20:44:39,535 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 79.7MB. Free memory was 35.7MB in the beginning and 35.6MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:44:39,536 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.81ms. Allocated memory is still 117.4MB. Free memory was 84.2MB in the beginning and 84.1MB in the end (delta: 21.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 20:44:39,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.85ms. Allocated memory is still 117.4MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:44:39,536 INFO L158 Benchmark]: Boogie Preprocessor took 45.26ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:44:39,538 INFO L158 Benchmark]: RCFGBuilder took 385.41ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 68.7MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 20:44:39,538 INFO L158 Benchmark]: TraceAbstraction took 1514.16ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 77.6MB in the end (delta: -9.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:44:39,538 INFO L158 Benchmark]: Witness Printer took 50.40ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:44:39,540 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 79.7MB. Free memory was 35.7MB in the beginning and 35.6MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.81ms. Allocated memory is still 117.4MB. Free memory was 84.2MB in the beginning and 84.1MB in the end (delta: 21.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.85ms. Allocated memory is still 117.4MB. Free memory was 84.1MB in the beginning and 82.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.26ms. Allocated memory is still 117.4MB. Free memory was 82.0MB in the beginning and 80.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.41ms. Allocated memory is still 117.4MB. Free memory was 80.6MB in the beginning and 68.7MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1514.16ms. Allocated memory is still 117.4MB. Free memory was 68.0MB in the beginning and 77.6MB in the end (delta: -9.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 50.40ms. Allocated memory is still 117.4MB. Free memory was 77.6MB in the beginning and 75.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 85 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79 IncrementalHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 26 mSDtfsCounter, 79 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 168 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:44:39,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE