./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_35-traces-ex-2_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/13-privatized_35-traces-ex-2_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 1d0c43dd41f99fbfade8285f6054d50d854da6853e7f72e8b1866aad54c9c5c4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:40:36,929 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:40:36,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:40:36,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:40:36,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:40:36,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:40:36,952 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:40:36,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:40:36,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:40:36,955 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:40:36,956 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:40:36,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:40:36,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:40:36,958 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:40:36,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:40:36,965 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:40:36,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:40:36,971 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:40:36,976 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:40:36,978 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:40:36,980 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:40:36,982 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:40:36,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:40:36,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:40:36,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:40:36,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:40:36,992 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:40:36,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:40:36,993 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:40:36,994 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:40:36,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:40:36,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:40:36,996 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:40:36,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:40:36,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:40:36,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:40:37,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:40:37,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:40:37,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:40:37,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:40:37,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:40:37,002 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:40:37,022 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:40:37,022 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:40:37,022 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:40:37,023 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:40:37,023 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:40:37,023 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:40:37,024 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:40:37,024 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:40:37,024 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:40:37,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:40:37,025 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:40:37,025 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:40:37,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:40:37,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:40:37,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:40:37,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:40:37,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:40:37,026 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:40:37,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:40:37,026 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:40:37,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:40:37,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:40:37,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:40:37,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:40:37,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:37,027 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:40:37,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:40:37,027 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:40:37,027 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:40:37,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:40:37,028 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:40:37,028 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:40:37,028 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:40:37,028 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 -> 1d0c43dd41f99fbfade8285f6054d50d854da6853e7f72e8b1866aad54c9c5c4 [2022-02-20 20:40:37,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:40:37,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:40:37,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:40:37,234 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:40:37,239 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:40:37,240 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_35-traces-ex-2_true.i [2022-02-20 20:40:37,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72dea6bb/f3959f4298ea43c7b488938d523ba351/FLAG6288e043d [2022-02-20 20:40:37,654 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:40:37,654 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_35-traces-ex-2_true.i [2022-02-20 20:40:37,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72dea6bb/f3959f4298ea43c7b488938d523ba351/FLAG6288e043d [2022-02-20 20:40:38,051 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a72dea6bb/f3959f4298ea43c7b488938d523ba351 [2022-02-20 20:40:38,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:40:38,053 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:40:38,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:38,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:40:38,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:40:38,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:38" (1/1) ... [2022-02-20 20:40:38,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29fd8b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:38, skipping insertion in model container [2022-02-20 20:40:38,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:40:38" (1/1) ... [2022-02-20 20:40:38,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:40:38,082 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:40:38,209 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/13-privatized_35-traces-ex-2_true.i[1088,1101] [2022-02-20 20:40:38,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:38,328 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:40:38,336 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/13-privatized_35-traces-ex-2_true.i[1088,1101] [2022-02-20 20:40:38,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:40:38,419 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:40:38,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:38 WrapperNode [2022-02-20 20:40:38,421 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:40:38,421 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:38,422 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:40:38,422 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:40:38,426 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:40:38" (1/1) ... [2022-02-20 20:40:38,447 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:40:38" (1/1) ... [2022-02-20 20:40:38,466 INFO L137 Inliner]: procedures = 162, calls = 29, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 49 [2022-02-20 20:40:38,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:40:38,467 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:40:38,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:40:38,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:40:38,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:38" (1/1) ... [2022-02-20 20:40:38,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:38" (1/1) ... [2022-02-20 20:40:38,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:38" (1/1) ... [2022-02-20 20:40:38,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:38" (1/1) ... [2022-02-20 20:40:38,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:38" (1/1) ... [2022-02-20 20:40:38,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:38" (1/1) ... [2022-02-20 20:40:38,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:38" (1/1) ... [2022-02-20 20:40:38,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:40:38,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:40:38,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:40:38,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:40:38,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:38" (1/1) ... [2022-02-20 20:40:38,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:40:38,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:40:38,553 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:40:38,555 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:40:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:40:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-02-20 20:40:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:40:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:40:38,583 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-02-20 20:40:38,584 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-02-20 20:40:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:40:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:40:38,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:40:38,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:40:38,585 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:40:38,687 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:40:38,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:40:38,812 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:40:38,822 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:40:38,822 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 20:40:38,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:38 BoogieIcfgContainer [2022-02-20 20:40:38,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:40:38,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:40:38,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:40:38,828 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:40:38,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:40:38" (1/3) ... [2022-02-20 20:40:38,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a90f8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:38, skipping insertion in model container [2022-02-20 20:40:38,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:40:38" (2/3) ... [2022-02-20 20:40:38,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a90f8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:40:38, skipping insertion in model container [2022-02-20 20:40:38,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:38" (3/3) ... [2022-02-20 20:40:38,830 INFO L111 eAbstractionObserver]: Analyzing ICFG 13-privatized_35-traces-ex-2_true.i [2022-02-20 20:40:38,834 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:40:38,834 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:40:38,834 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:40:38,834 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:40:38,864 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,865 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,865 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,865 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,865 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,865 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,866 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,866 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,866 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,866 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,867 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,867 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,867 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,867 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,868 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,868 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,868 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,868 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,869 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,869 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,869 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,870 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,870 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,870 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,879 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,880 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,881 WARN L322 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,881 WARN L322 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:40:38,883 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:40:38,923 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:40:38,930 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:40:38,930 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 20:40:38,938 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 71 transitions, 147 flow [2022-02-20 20:40:38,973 INFO L129 PetriNetUnfolder]: 1/70 cut-off events. [2022-02-20 20:40:38,973 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:38,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 70 events. 1/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2022-02-20 20:40:38,988 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 71 transitions, 147 flow [2022-02-20 20:40:38,990 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 58 transitions, 119 flow [2022-02-20 20:40:39,008 INFO L129 PetriNetUnfolder]: 0/54 cut-off events. [2022-02-20 20:40:39,008 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:40:39,008 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:39,009 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:39,009 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:39,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:39,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1163219958, now seen corresponding path program 1 times [2022-02-20 20:40:39,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:39,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243429390] [2022-02-20 20:40:39,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:39,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:39,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {77#true} [127] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:39,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {77#true} [114] 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] {77#true} is VALID [2022-02-20 20:40:39,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {77#true} [134] 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[] {77#true} is VALID [2022-02-20 20:40:39,297 INFO L290 TraceCheckUtils]: 3: Hoare triple {77#true} [138] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:39,298 INFO L290 TraceCheckUtils]: 4: Hoare triple {77#true} [98] 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[] {77#true} is VALID [2022-02-20 20:40:39,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {77#true} [128] 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[] {77#true} is VALID [2022-02-20 20:40:39,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {77#true} [118] 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[] {77#true} is VALID [2022-02-20 20:40:39,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {77#true} [121] L18-3-->L18-4: Formula: (and (= 36 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {77#true} is VALID [2022-02-20 20:40:39,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {77#true} [122] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {79#(= ~g~0 0)} [81] 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] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {79#(= ~g~0 0)} [99] 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[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {79#(= ~g~0 0)} [83] 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[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {79#(= ~g~0 0)} [137] 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[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {79#(= ~g~0 0)} [110] 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[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,302 INFO L290 TraceCheckUtils]: 14: Hoare triple {79#(= ~g~0 0)} [142] 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[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,303 INFO L290 TraceCheckUtils]: 15: Hoare triple {79#(= ~g~0 0)} [90] 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[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,303 INFO L290 TraceCheckUtils]: 16: Hoare triple {79#(= ~g~0 0)} [130] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {79#(= ~g~0 0)} [85] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,304 INFO L290 TraceCheckUtils]: 18: Hoare triple {79#(= ~g~0 0)} [126] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {79#(= ~g~0 0)} [113] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {79#(= ~g~0 0)} [131] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {79#(= ~g~0 0)} [80] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {79#(= ~g~0 0)} [132] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,306 INFO L290 TraceCheckUtils]: 23: Hoare triple {79#(= ~g~0 0)} [111] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {79#(= ~g~0 0)} [141] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {79#(= ~g~0 0)} [120] 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] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {79#(= ~g~0 0)} [88] L-1-5-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {79#(= ~g~0 0)} [123] L696-->L696-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,309 INFO L290 TraceCheckUtils]: 28: Hoare triple {79#(= ~g~0 0)} [112] L696-1-->L697: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,309 INFO L290 TraceCheckUtils]: 29: Hoare triple {79#(= ~g~0 0)} [106] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,310 INFO L290 TraceCheckUtils]: 30: Hoare triple {79#(= ~g~0 0)} [89] L697-1-->L697-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|))) InVars {#memory_int=|v_#memory_int_14|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{#memory_int=|v_#memory_int_13|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,310 INFO L290 TraceCheckUtils]: 31: Hoare triple {79#(= ~g~0 0)} [162] L697-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {79#(= ~g~0 0)} [79] L697-3-->L697-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {79#(= ~g~0 0)} [101] L697-4-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {79#(= ~g~0 0)} [104] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#B~0.base_7|))) (and (= (select .cse0 |v_~#B~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {79#(= ~g~0 0)} [103] L698-1-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {79#(= ~g~0 0)} [116] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#A~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= (select .cse0 |v_~#A~0.offset_7|) 0) (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {79#(= ~g~0 0)} [91] L699-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,314 INFO L290 TraceCheckUtils]: 38: Hoare triple {79#(= ~g~0 0)} [139] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {79#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,314 INFO L290 TraceCheckUtils]: 39: Hoare triple {79#(= ~g~0 0)} [144] L700-1-->L700-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= v_~g~0_2 0) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {80#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:39,315 INFO L290 TraceCheckUtils]: 40: Hoare triple {80#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [100] L700-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] {80#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:39,315 INFO L290 TraceCheckUtils]: 41: Hoare triple {80#(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] {81#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:39,316 INFO L290 TraceCheckUtils]: 42: Hoare triple {81#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [92] 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[] {78#false} is VALID [2022-02-20 20:40:39,316 INFO L290 TraceCheckUtils]: 43: Hoare triple {78#false} [108] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {78#false} is VALID [2022-02-20 20:40:39,317 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:40:39,317 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:39,318 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243429390] [2022-02-20 20:40:39,318 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243429390] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:39,318 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:39,318 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 20:40:39,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345303858] [2022-02-20 20:40:39,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:39,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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 44 [2022-02-20 20:40:39,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:39,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 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:40:39,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:39,365 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:40:39,365 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:39,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:40:39,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:40:39,391 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 71 [2022-02-20 20:40:39,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 119 flow. Second operand has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 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:40:39,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:39,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 71 [2022-02-20 20:40:39,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:39,487 INFO L129 PetriNetUnfolder]: 8/101 cut-off events. [2022-02-20 20:40:39,487 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:40:39,489 INFO L84 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 101 events. 8/101 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 197 event pairs, 0 based on Foata normal form. 3/104 useless extension candidates. Maximal degree in co-relation 96. Up to 10 conditions per place. [2022-02-20 20:40:39,490 INFO L132 encePairwiseOnDemand]: 65/71 looper letters, 8 selfloop transitions, 3 changer transitions 9/70 dead transitions. [2022-02-20 20:40:39,491 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 183 flow [2022-02-20 20:40:39,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:40:39,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:40:39,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 442 transitions. [2022-02-20 20:40:39,506 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8893360160965795 [2022-02-20 20:40:39,507 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 442 transitions. [2022-02-20 20:40:39,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 442 transitions. [2022-02-20 20:40:39,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:39,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 442 transitions. [2022-02-20 20:40:39,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 63.142857142857146) internal successors, (442), 7 states have internal predecessors, (442), 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:40:39,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 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:40:39,518 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 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:40:39,519 INFO L186 Difference]: Start difference. First operand has 62 places, 58 transitions, 119 flow. Second operand 7 states and 442 transitions. [2022-02-20 20:40:39,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 183 flow [2022-02-20 20:40:39,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 70 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-02-20 20:40:39,523 INFO L242 Difference]: Finished difference. Result has 72 places, 58 transitions, 137 flow [2022-02-20 20:40:39,525 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=137, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2022-02-20 20:40:39,526 INFO L334 CegarLoopForPetriNet]: 62 programPoint places, 10 predicate places. [2022-02-20 20:40:39,527 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 72 places, 58 transitions, 137 flow [2022-02-20 20:40:39,549 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 197 states, 195 states have (on average 1.6871794871794872) internal successors, (329), 196 states have internal predecessors, (329), 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:40:39,554 INFO L78 Accepts]: Start accepts. Automaton has has 197 states, 195 states have (on average 1.6871794871794872) internal successors, (329), 196 states have internal predecessors, (329), 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 44 [2022-02-20 20:40:39,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:39,554 INFO L470 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 137 flow [2022-02-20 20:40:39,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 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:40:39,555 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:39,555 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:39,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:40:39,555 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:39,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:39,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1776305511, now seen corresponding path program 1 times [2022-02-20 20:40:39,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:39,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044144326] [2022-02-20 20:40:39,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:39,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:39,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {292#true} [127] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#true} is VALID [2022-02-20 20:40:39,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} [114] 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] {292#true} is VALID [2022-02-20 20:40:39,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} [134] 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[] {292#true} is VALID [2022-02-20 20:40:39,635 INFO L290 TraceCheckUtils]: 3: Hoare triple {292#true} [138] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {292#true} is VALID [2022-02-20 20:40:39,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {292#true} [98] 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[] {292#true} is VALID [2022-02-20 20:40:39,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#true} [128] 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[] {292#true} is VALID [2022-02-20 20:40:39,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#true} [118] 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[] {292#true} is VALID [2022-02-20 20:40:39,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#true} [121] L18-3-->L18-4: Formula: (and (= 36 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {292#true} is VALID [2022-02-20 20:40:39,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#true} [122] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {292#true} is VALID [2022-02-20 20:40:39,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#true} [81] 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] {292#true} is VALID [2022-02-20 20:40:39,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {292#true} [99] 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[] {292#true} is VALID [2022-02-20 20:40:39,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {292#true} [83] 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[] {292#true} is VALID [2022-02-20 20:40:39,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {292#true} [137] 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[] {292#true} is VALID [2022-02-20 20:40:39,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#true} [110] 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[] {292#true} is VALID [2022-02-20 20:40:39,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#true} [142] 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[] {292#true} is VALID [2022-02-20 20:40:39,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {292#true} [90] 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[] {292#true} is VALID [2022-02-20 20:40:39,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {292#true} [130] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {292#true} is VALID [2022-02-20 20:40:39,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {292#true} [85] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {292#true} is VALID [2022-02-20 20:40:39,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {292#true} [126] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {292#true} is VALID [2022-02-20 20:40:39,638 INFO L290 TraceCheckUtils]: 19: Hoare triple {292#true} [113] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {292#true} is VALID [2022-02-20 20:40:39,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {292#true} [131] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {292#true} is VALID [2022-02-20 20:40:39,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {292#true} [80] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {292#true} is VALID [2022-02-20 20:40:39,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {292#true} [132] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {292#true} is VALID [2022-02-20 20:40:39,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {292#true} [111] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#true} is VALID [2022-02-20 20:40:39,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {292#true} [141] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {292#true} is VALID [2022-02-20 20:40:39,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {292#true} [120] 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] {292#true} is VALID [2022-02-20 20:40:39,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {292#true} [88] L-1-5-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1] {292#true} is VALID [2022-02-20 20:40:39,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {292#true} [123] L696-->L696-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {292#true} is VALID [2022-02-20 20:40:39,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {292#true} [112] L696-1-->L697: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {292#true} is VALID [2022-02-20 20:40:39,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {292#true} [106] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {292#true} is VALID [2022-02-20 20:40:39,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {292#true} [89] L697-1-->L697-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|))) InVars {#memory_int=|v_#memory_int_14|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{#memory_int=|v_#memory_int_13|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] {292#true} is VALID [2022-02-20 20:40:39,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {292#true} [162] L697-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {292#true} is VALID [2022-02-20 20:40:39,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {292#true} [147] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_1| v_t_funThread1of1ForFork0_~arg.base_1) (= v_t_funThread1of1ForFork0_~arg.offset_1 |v_t_funThread1of1ForFork0_#in~arg.offset_1|)) InVars {t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|} OutVars{t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_1, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_1} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_~arg.base] {292#true} is VALID [2022-02-20 20:40:39,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {292#true} [148] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#A~0.base_9|))) (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#A~0.base_9| (store .cse0 |v_~#A~0.offset_9| 1))) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0) (= (select .cse0 |v_~#A~0.offset_9|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_9|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {292#true} is VALID [2022-02-20 20:40:39,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {292#true} [149] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {292#true} is VALID [2022-02-20 20:40:39,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {292#true} [150] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#B~0.base_9|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= (select .cse0 |v_~#B~0.offset_9|) 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#B~0.base_9| (store .cse0 |v_~#B~0.offset_9| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, ~#B~0.base=|v_~#B~0.base_9|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#B~0.offset=|v_~#B~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {294#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:39,643 INFO L290 TraceCheckUtils]: 36: Hoare triple {294#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [151] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {294#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} is VALID [2022-02-20 20:40:39,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {294#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) 1)} [152] L687-->L688: Formula: (= v_~g~0_3 1) InVars {} OutVars{~g~0=v_~g~0_3} AuxVars[] AssignedVars[~g~0] {295#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) ~g~0)} is VALID [2022-02-20 20:40:39,644 INFO L290 TraceCheckUtils]: 38: Hoare triple {295#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) ~g~0)} [79] L697-3-->L697-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {295#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) ~g~0)} is VALID [2022-02-20 20:40:39,644 INFO L290 TraceCheckUtils]: 39: Hoare triple {295#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) ~g~0)} [101] L697-4-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {295#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) ~g~0)} is VALID [2022-02-20 20:40:39,645 INFO L290 TraceCheckUtils]: 40: Hoare triple {295#(= (select (select |#pthreadsMutex| |~#B~0.base|) |~#B~0.offset|) ~g~0)} [104] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#B~0.base_7|))) (and (= (select .cse0 |v_~#B~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {296#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {296#(= ~g~0 0)} [103] L698-1-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {296#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,646 INFO L290 TraceCheckUtils]: 42: Hoare triple {296#(= ~g~0 0)} [116] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#A~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= (select .cse0 |v_~#A~0.offset_7|) 0) (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {296#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,646 INFO L290 TraceCheckUtils]: 43: Hoare triple {296#(= ~g~0 0)} [91] L699-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {296#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,646 INFO L290 TraceCheckUtils]: 44: Hoare triple {296#(= ~g~0 0)} [139] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {296#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,647 INFO L290 TraceCheckUtils]: 45: Hoare triple {296#(= ~g~0 0)} [144] L700-1-->L700-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= v_~g~0_2 0) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} 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:40:39,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {297#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [100] L700-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:40:39,648 INFO L290 TraceCheckUtils]: 47: 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:40:39,648 INFO L290 TraceCheckUtils]: 48: Hoare triple {298#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [92] 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[] {293#false} is VALID [2022-02-20 20:40:39,648 INFO L290 TraceCheckUtils]: 49: Hoare triple {293#false} [108] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {293#false} is VALID [2022-02-20 20:40:39,649 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:40:39,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:39,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044144326] [2022-02-20 20:40:39,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044144326] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:39,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:39,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 20:40:39,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899867404] [2022-02-20 20:40:39,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:39,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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 50 [2022-02-20 20:40:39,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:39,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 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:40:39,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:39,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 20:40:39,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:39,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 20:40:39,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 20:40:39,683 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 71 [2022-02-20 20:40:39,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 137 flow. Second operand has 7 states, 7 states have (on average 46.42857142857143) internal successors, (325), 7 states have internal predecessors, (325), 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:40:39,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:39,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 71 [2022-02-20 20:40:39,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:39,828 INFO L129 PetriNetUnfolder]: 3/87 cut-off events. [2022-02-20 20:40:39,828 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-02-20 20:40:39,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 87 events. 3/87 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 127 event pairs, 0 based on Foata normal form. 12/99 useless extension candidates. Maximal degree in co-relation 128. Up to 12 conditions per place. [2022-02-20 20:40:39,829 INFO L132 encePairwiseOnDemand]: 62/71 looper letters, 13 selfloop transitions, 5 changer transitions 13/64 dead transitions. [2022-02-20 20:40:39,829 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 64 transitions, 205 flow [2022-02-20 20:40:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:40:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:40:39,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 341 transitions. [2022-02-20 20:40:39,832 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6861167002012073 [2022-02-20 20:40:39,833 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 341 transitions. [2022-02-20 20:40:39,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 341 transitions. [2022-02-20 20:40:39,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:39,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 341 transitions. [2022-02-20 20:40:39,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 48.714285714285715) internal successors, (341), 7 states have internal predecessors, (341), 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:40:39,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 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:40:39,835 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 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:40:39,835 INFO L186 Difference]: Start difference. First operand has 72 places, 58 transitions, 137 flow. Second operand 7 states and 341 transitions. [2022-02-20 20:40:39,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 64 transitions, 205 flow [2022-02-20 20:40:39,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 191 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-02-20 20:40:39,837 INFO L242 Difference]: Finished difference. Result has 68 places, 51 transitions, 118 flow [2022-02-20 20:40:39,837 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=118, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2022-02-20 20:40:39,838 INFO L334 CegarLoopForPetriNet]: 62 programPoint places, 6 predicate places. [2022-02-20 20:40:39,838 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 51 transitions, 118 flow [2022-02-20 20:40:39,840 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 66 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 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:40:39,840 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 65 states have internal predecessors, (79), 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 50 [2022-02-20 20:40:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:39,840 INFO L470 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 118 flow [2022-02-20 20:40:39,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 46.42857142857143) internal successors, (325), 7 states have internal predecessors, (325), 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:40:39,841 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:40:39,841 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:40:39,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:40:39,841 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION] === [2022-02-20 20:40:39,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:40:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1481176972, now seen corresponding path program 1 times [2022-02-20 20:40:39,842 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:40:39,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175415685] [2022-02-20 20:40:39,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:40:39,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:40:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:40:39,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#true} [127] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {374#true} is VALID [2022-02-20 20:40:39,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#true} [114] 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] {374#true} is VALID [2022-02-20 20:40:39,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {374#true} [134] 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[] {374#true} is VALID [2022-02-20 20:40:39,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {374#true} [138] L-1-2-->L18: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {374#true} is VALID [2022-02-20 20:40:39,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {374#true} [98] 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[] {374#true} is VALID [2022-02-20 20:40:39,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {374#true} [128] 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[] {374#true} is VALID [2022-02-20 20:40:39,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {374#true} [118] 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[] {374#true} is VALID [2022-02-20 20:40:39,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {374#true} [121] L18-3-->L18-4: Formula: (and (= 36 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {374#true} is VALID [2022-02-20 20:40:39,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {374#true} [122] L18-4-->L682: Formula: (= v_~g~0_1 0) InVars {} OutVars{~g~0=v_~g~0_1} AuxVars[] AssignedVars[~g~0] {374#true} is VALID [2022-02-20 20:40:39,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {374#true} [81] 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] {376#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:39,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(<= |~#A~0.base| 3)} [99] 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[] {376#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:39,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {376#(<= |~#A~0.base| 3)} [83] 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[] {376#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:39,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {376#(<= |~#A~0.base| 3)} [137] 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[] {376#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:39,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {376#(<= |~#A~0.base| 3)} [110] 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[] {376#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:39,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {376#(<= |~#A~0.base| 3)} [142] 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[] {376#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:39,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {376#(<= |~#A~0.base| 3)} [90] 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[] {376#(<= |~#A~0.base| 3)} is VALID [2022-02-20 20:40:39,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {376#(<= |~#A~0.base| 3)} [130] L682-7-->L683: Formula: (and (= 4 |v_~#B~0.base_1|) (= |v_~#B~0.offset_1| 0)) InVars {} OutVars{~#B~0.base=|v_~#B~0.base_1|, ~#B~0.offset=|v_~#B~0.offset_1|} AuxVars[] AssignedVars[~#B~0.base, ~#B~0.offset] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [85] L683-->L683-1: Formula: (and (= (select |v_#length_4| 4) 24) (= (select |v_#valid_5| 4) 1)) InVars {#length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#length=|v_#length_4|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,984 INFO L290 TraceCheckUtils]: 18: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [126] L683-1-->L683-2: Formula: (= (select (select |v_#memory_int_8| |v_~#B~0.base_2|) |v_~#B~0.offset_2|) 0) InVars {#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} OutVars{#memory_int=|v_#memory_int_8|, ~#B~0.base=|v_~#B~0.base_2|, ~#B~0.offset=|v_~#B~0.offset_2|} AuxVars[] AssignedVars[] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [113] L683-2-->L683-3: Formula: (= 0 (select (select |v_#memory_int_9| |v_~#B~0.base_3|) (+ |v_~#B~0.offset_3| 4))) InVars {#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} OutVars{#memory_int=|v_#memory_int_9|, ~#B~0.base=|v_~#B~0.base_3|, ~#B~0.offset=|v_~#B~0.offset_3|} AuxVars[] AssignedVars[] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [131] L683-3-->L683-4: Formula: (= (select (select |v_#memory_int_10| |v_~#B~0.base_4|) (+ |v_~#B~0.offset_4| 8)) 0) InVars {#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} OutVars{#memory_int=|v_#memory_int_10|, ~#B~0.base=|v_~#B~0.base_4|, ~#B~0.offset=|v_~#B~0.offset_4|} AuxVars[] AssignedVars[] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [80] L683-4-->L683-5: Formula: (= ~unnamed1~0~PTHREAD_MUTEX_TIMED_NP (select (select |v_#memory_int_11| |v_~#B~0.base_5|) (+ |v_~#B~0.offset_5| 12))) InVars {#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} OutVars{#memory_int=|v_#memory_int_11|, ~#B~0.base=|v_~#B~0.base_5|, ~#B~0.offset=|v_~#B~0.offset_5|} AuxVars[] AssignedVars[] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [132] L683-5-->L683-6: Formula: (= (select (select |v_#memory_int_12| |v_~#B~0.base_6|) (+ |v_~#B~0.offset_6| 16)) 0) InVars {#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} OutVars{#memory_int=|v_#memory_int_12|, ~#B~0.base=|v_~#B~0.base_6|, ~#B~0.offset=|v_~#B~0.offset_6|} AuxVars[] AssignedVars[] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [111] L683-6-->L-1-3: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [141] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [120] 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] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [88] L-1-5-->L696: Formula: true InVars {} OutVars{ULTIMATE.start_main_~#id~0#1.base=|v_ULTIMATE.start_main_~#id~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_~#id~0#1.offset=|v_ULTIMATE.start_main_~#id~0#1.offset_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet6#1, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#id~0#1.offset, ULTIMATE.start_main_#t~pre4#1] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,987 INFO L290 TraceCheckUtils]: 27: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [123] L696-->L696-1: Formula: (and (not (= |v_ULTIMATE.start_main_~#id~0#1.base_2| 0)) (= (store |v_#length_6| |v_ULTIMATE.start_main_~#id~0#1.base_2| 4) |v_#length_5|) (= |v_#valid_6| (store |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2| 1)) (= |v_ULTIMATE.start_main_~#id~0#1.offset_2| 0) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#id~0#1.base_2|) 0) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#id~0#1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_6|, #valid=|v_#valid_7|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, 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_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#id~0#1.base, #valid, #length, ULTIMATE.start_main_~#id~0#1.offset] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [112] L696-1-->L697: Formula: (= |v_ULTIMATE.start_main_#t~pre4#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [106] L697-->L697-1: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [89] L697-1-->L697-2: Formula: (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#id~0#1.base_3|) |v_ULTIMATE.start_main_~#id~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre4#1_3|))) InVars {#memory_int=|v_#memory_int_14|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} OutVars{#memory_int=|v_#memory_int_13|, 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~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_3|} AuxVars[] AssignedVars[#memory_int] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,989 INFO L290 TraceCheckUtils]: 31: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [162] L697-2-->t_funENTRY: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre4#1_6| v_t_funThread1of1ForFork0_thidvar0_2) (= v_t_funThread1of1ForFork0_thidvar1_2 0) (= |v_t_funThread1of1ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|} OutVars{t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_4|, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_4, t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_6|, t_funThread1of1ForFork0_thidvar1=v_t_funThread1of1ForFork0_thidvar1_2, t_funThread1of1ForFork0_#res.base=|v_t_funThread1of1ForFork0_#res.base_4|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_6|, t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_4|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_4, t_funThread1of1ForFork0_#t~nondet3=|v_t_funThread1of1ForFork0_#t~nondet3_6|, t_funThread1of1ForFork0_thidvar0=v_t_funThread1of1ForFork0_thidvar0_2, ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_6|, t_funThread1of1ForFork0_#res.offset=|v_t_funThread1of1ForFork0_#res.offset_4|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#in~arg.offset, t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_#t~nondet1, t_funThread1of1ForFork0_thidvar1, t_funThread1of1ForFork0_#res.base, t_funThread1of1ForFork0_#t~nondet2, t_funThread1of1ForFork0_#in~arg.base, t_funThread1of1ForFork0_~arg.base, t_funThread1of1ForFork0_#t~nondet3, t_funThread1of1ForFork0_thidvar0, t_funThread1of1ForFork0_#res.offset] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [147] t_funENTRY-->L685: Formula: (and (= |v_t_funThread1of1ForFork0_#in~arg.base_1| v_t_funThread1of1ForFork0_~arg.base_1) (= v_t_funThread1of1ForFork0_~arg.offset_1 |v_t_funThread1of1ForFork0_#in~arg.offset_1|)) InVars {t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|} OutVars{t_funThread1of1ForFork0_#in~arg.base=|v_t_funThread1of1ForFork0_#in~arg.base_1|, t_funThread1of1ForFork0_#in~arg.offset=|v_t_funThread1of1ForFork0_#in~arg.offset_1|, t_funThread1of1ForFork0_~arg.base=v_t_funThread1of1ForFork0_~arg.base_1, t_funThread1of1ForFork0_~arg.offset=v_t_funThread1of1ForFork0_~arg.offset_1} AuxVars[] AssignedVars[t_funThread1of1ForFork0_~arg.offset, t_funThread1of1ForFork0_~arg.base] {377#(not (= |~#B~0.base| |~#A~0.base|))} is VALID [2022-02-20 20:40:39,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {377#(not (= |~#B~0.base| |~#A~0.base|))} [148] L685-->L685-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_10| |v_~#A~0.base_9|))) (and (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#A~0.base_9| (store .cse0 |v_~#A~0.offset_9| 1))) (= |v_t_funThread1of1ForFork0_#t~nondet1_1| 0) (= (select .cse0 |v_~#A~0.offset_9|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_1|, #pthreadsMutex=|v_#pthreadsMutex_9|, ~#A~0.offset=|v_~#A~0.offset_9|, ~#A~0.base=|v_~#A~0.base_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet1] {378#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:39,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {378#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [149] L685-1-->L686: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet1=|v_t_funThread1of1ForFork0_#t~nondet1_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet1] {378#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:39,991 INFO L290 TraceCheckUtils]: 35: Hoare triple {378#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [150] L686-->L686-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_12| |v_~#B~0.base_9|))) (and (= |v_t_funThread1of1ForFork0_#t~nondet2_1| 0) (= (select .cse0 |v_~#B~0.offset_9|) 0) (= |v_#pthreadsMutex_11| (store |v_#pthreadsMutex_12| |v_~#B~0.base_9| (store .cse0 |v_~#B~0.offset_9| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, ~#B~0.base=|v_~#B~0.base_9|, ~#B~0.offset=|v_~#B~0.offset_9|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, ~#B~0.base=|v_~#B~0.base_9|, t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_1|, ~#B~0.offset=|v_~#B~0.offset_9|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet2] {378#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:39,991 INFO L290 TraceCheckUtils]: 36: Hoare triple {378#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [151] L686-1-->L687: Formula: true InVars {} OutVars{t_funThread1of1ForFork0_#t~nondet2=|v_t_funThread1of1ForFork0_#t~nondet2_3|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet2] {378#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:39,992 INFO L290 TraceCheckUtils]: 37: Hoare triple {378#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) 1) (not (= |~#B~0.base| |~#A~0.base|)))} [152] L687-->L688: Formula: (= v_~g~0_3 1) InVars {} OutVars{~g~0=v_~g~0_3} AuxVars[] AssignedVars[~g~0] {379#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) ~g~0) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:39,992 INFO L290 TraceCheckUtils]: 38: Hoare triple {379#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) ~g~0) (not (= |~#B~0.base| |~#A~0.base|)))} [153] L688-->L689: Formula: (= |v_#pthreadsMutex_13| (store |v_#pthreadsMutex_14| |v_~#B~0.base_10| (store (select |v_#pthreadsMutex_14| |v_~#B~0.base_10|) |v_~#B~0.offset_10| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_14|, ~#B~0.base=|v_~#B~0.base_10|, ~#B~0.offset=|v_~#B~0.offset_10|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_13|, ~#B~0.base=|v_~#B~0.base_10|, ~#B~0.offset=|v_~#B~0.offset_10|} AuxVars[] AssignedVars[#pthreadsMutex] {379#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) ~g~0) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:39,993 INFO L290 TraceCheckUtils]: 39: Hoare triple {379#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) ~g~0) (not (= |~#B~0.base| |~#A~0.base|)))} [79] L697-3-->L697-4: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre4#1=|v_ULTIMATE.start_main_#t~pre4#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre4#1] {379#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) ~g~0) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:39,993 INFO L290 TraceCheckUtils]: 40: Hoare triple {379#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) ~g~0) (not (= |~#B~0.base| |~#A~0.base|)))} [101] L697-4-->L698: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {379#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) ~g~0) (not (= |~#B~0.base| |~#A~0.base|)))} is VALID [2022-02-20 20:40:39,994 INFO L290 TraceCheckUtils]: 41: Hoare triple {379#(and (= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) ~g~0) (not (= |~#B~0.base| |~#A~0.base|)))} [104] L698-->L698-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_2| |v_~#B~0.base_7|))) (and (= (select .cse0 |v_~#B~0.offset_7|) 0) (= |v_#pthreadsMutex_1| (store |v_#pthreadsMutex_2| |v_~#B~0.base_7| (store .cse0 |v_~#B~0.offset_7| 1))) (= |v_ULTIMATE.start_main_#t~nondet6#1_2| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_2|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_1|, ~#B~0.base=|v_~#B~0.base_7|, ~#B~0.offset=|v_~#B~0.offset_7|, ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet6#1] {380#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) ~g~0)} is VALID [2022-02-20 20:40:39,994 INFO L290 TraceCheckUtils]: 42: Hoare triple {380#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) ~g~0)} [103] L698-1-->L699: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet6#1=|v_ULTIMATE.start_main_#t~nondet6#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet6#1] {380#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) ~g~0)} is VALID [2022-02-20 20:40:39,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {380#(= (select (select |#pthreadsMutex| |~#A~0.base|) |~#A~0.offset|) ~g~0)} [116] L699-->L699-1: Formula: (let ((.cse0 (select |v_#pthreadsMutex_4| |v_~#A~0.base_7|))) (and (= |v_ULTIMATE.start_main_#t~nondet7#1_2| 0) (= (select .cse0 |v_~#A~0.offset_7|) 0) (= |v_#pthreadsMutex_3| (store |v_#pthreadsMutex_4| |v_~#A~0.base_7| (store .cse0 |v_~#A~0.offset_7| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_4|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_3|, ~#A~0.offset=|v_~#A~0.offset_7|, ~#A~0.base=|v_~#A~0.base_7|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet7#1] {381#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,995 INFO L290 TraceCheckUtils]: 44: Hoare triple {381#(= ~g~0 0)} [91] L699-1-->L700: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {381#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,995 INFO L290 TraceCheckUtils]: 45: Hoare triple {381#(= ~g~0 0)} [139] L700-->L700-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {381#(= ~g~0 0)} is VALID [2022-02-20 20:40:39,996 INFO L290 TraceCheckUtils]: 46: Hoare triple {381#(= ~g~0 0)} [144] L700-1-->L700-2: Formula: (= |v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1| (ite (= v_~g~0_2 0) 1 0)) InVars {~g~0=v_~g~0_2} OutVars{ULTIMATE.start___VERIFIER_assert_#in~cond#1=|v_ULTIMATE.start___VERIFIER_assert_#in~cond#1_1|, ~g~0=v_~g~0_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_#in~cond#1] {382#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:39,996 INFO L290 TraceCheckUtils]: 47: Hoare triple {382#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} [100] L700-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] {382#(not (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))} is VALID [2022-02-20 20:40:39,997 INFO L290 TraceCheckUtils]: 48: Hoare triple {382#(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] {383#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 20:40:39,997 INFO L290 TraceCheckUtils]: 49: Hoare triple {383#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} [92] 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[] {375#false} is VALID [2022-02-20 20:40:39,997 INFO L290 TraceCheckUtils]: 50: Hoare triple {375#false} [108] L19-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {375#false} is VALID [2022-02-20 20:40:39,998 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:40:39,998 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:40:39,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175415685] [2022-02-20 20:40:39,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175415685] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:40:39,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:40:40,007 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 20:40:40,007 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963965482] [2022-02-20 20:40:40,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:40:40,008 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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 51 [2022-02-20 20:40:40,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:40:40,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.1) internal successors, (51), 10 states have internal predecessors, (51), 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:40:40,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:40:40,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 20:40:40,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:40:40,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 20:40:40,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-20 20:40:40,041 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 71 [2022-02-20 20:40:40,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 118 flow. Second operand has 10 states, 10 states have (on average 40.4) internal successors, (404), 10 states have internal predecessors, (404), 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:40:40,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:40:40,042 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 71 [2022-02-20 20:40:40,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:40:40,198 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2022-02-20 20:40:40,198 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-02-20 20:40:40,198 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 43 events. 0/43 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 3 event pairs, 0 based on Foata normal form. 1/44 useless extension candidates. Maximal degree in co-relation 0. Up to 7 conditions per place. [2022-02-20 20:40:40,199 INFO L132 encePairwiseOnDemand]: 65/71 looper letters, 0 selfloop transitions, 0 changer transitions 43/43 dead transitions. [2022-02-20 20:40:40,199 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 43 transitions, 138 flow [2022-02-20 20:40:40,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:40:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:40:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 286 transitions. [2022-02-20 20:40:40,202 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.5754527162977867 [2022-02-20 20:40:40,202 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 286 transitions. [2022-02-20 20:40:40,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 286 transitions. [2022-02-20 20:40:40,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:40:40,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 286 transitions. [2022-02-20 20:40:40,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 40.857142857142854) internal successors, (286), 7 states have internal predecessors, (286), 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:40:40,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 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:40:40,209 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 71.0) internal successors, (568), 8 states have internal predecessors, (568), 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:40:40,209 INFO L186 Difference]: Start difference. First operand has 68 places, 51 transitions, 118 flow. Second operand 7 states and 286 transitions. [2022-02-20 20:40:40,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 43 transitions, 138 flow [2022-02-20 20:40:40,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 43 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-02-20 20:40:40,210 INFO L242 Difference]: Finished difference. Result has 54 places, 0 transitions, 0 flow [2022-02-20 20:40:40,211 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=54, PETRI_TRANSITIONS=0} [2022-02-20 20:40:40,211 INFO L334 CegarLoopForPetriNet]: 62 programPoint places, -8 predicate places. [2022-02-20 20:40:40,211 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 0 transitions, 0 flow [2022-02-20 20:40:40,212 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:40:40,212 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 51 [2022-02-20 20:40:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:40:40,212 INFO L470 AbstractCegarLoop]: Abstraction has has 54 places, 0 transitions, 0 flow [2022-02-20 20:40:40,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 40.4) internal successors, (404), 10 states have internal predecessors, (404), 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:40:40,214 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 20:40:40,214 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (0 of 2 remaining) [2022-02-20 20:40:40,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:40:40,217 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 20:40:40,218 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 20:40:40,218 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 20:40:40,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 08:40:40 BasicIcfg [2022-02-20 20:40:40,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 20:40:40,221 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 20:40:40,221 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 20:40:40,221 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 20:40:40,221 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:40:38" (3/4) ... [2022-02-20 20:40:40,223 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 20:40:40,227 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2022-02-20 20:40:40,229 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 20:40:40,229 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 20:40:40,229 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 20:40:40,229 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 20:40:40,249 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 20:40:40,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 20:40:40,250 INFO L158 Benchmark]: Toolchain (without parser) took 2196.23ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 61.8MB in the beginning and 94.3MB in the end (delta: -32.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:40,250 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:40,250 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.00ms. Allocated memory is still 104.9MB. Free memory was 61.6MB in the beginning and 68.2MB in the end (delta: -6.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-02-20 20:40:40,250 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.45ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 66.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:40,251 INFO L158 Benchmark]: Boogie Preprocessor took 26.55ms. Allocated memory is still 104.9MB. Free memory was 66.1MB in the beginning and 64.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 20:40:40,251 INFO L158 Benchmark]: RCFGBuilder took 330.58ms. Allocated memory is still 104.9MB. Free memory was 64.3MB in the beginning and 51.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 20:40:40,251 INFO L158 Benchmark]: TraceAbstraction took 1394.49ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 51.4MB in the beginning and 96.4MB in the end (delta: -45.0MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2022-02-20 20:40:40,252 INFO L158 Benchmark]: Witness Printer took 27.95ms. Allocated memory is still 125.8MB. Free memory was 96.4MB in the beginning and 94.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 20:40:40,253 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.17ms. Allocated memory is still 104.9MB. Free memory is still 79.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.00ms. Allocated memory is still 104.9MB. Free memory was 61.6MB in the beginning and 68.2MB in the end (delta: -6.6MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.45ms. Allocated memory is still 104.9MB. Free memory was 67.7MB in the beginning and 66.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.55ms. Allocated memory is still 104.9MB. Free memory was 66.1MB in the beginning and 64.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 330.58ms. Allocated memory is still 104.9MB. Free memory was 64.3MB in the beginning and 51.5MB in the end (delta: 12.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1394.49ms. Allocated memory was 104.9MB in the beginning and 125.8MB in the end (delta: 21.0MB). Free memory was 51.4MB in the beginning and 96.4MB in the end (delta: -45.0MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * Witness Printer took 27.95ms. Allocated memory is still 125.8MB. Free memory was 96.4MB in the beginning and 94.3MB in the end (delta: 2.1MB). 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 87 locations, 2 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.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 53 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 53 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 32 mSDtfsCounter, 166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137occurred in iteration=1, InterpolantAutomatonStates: 21, 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, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-02-20 20:40:40,277 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